Segcolt/Codeforces-solutions
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Add a bunch of other problems.

Browse Source 
Some are not finished...
This commit is contained in:
Segcolt
2025-09-12 14:50:25 -03:00
parent 88e542c982
commit 489cb2ba51
385 changed files with 49442 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

99
Codeforces Round 1022 (Div. 2)/A. Permutation Warm-Up.cpp Normal file
View File

@@ -0,0 +1,99 @@
/* Problem URL: https://codeforces.com/contest/2108/problem/0 */
#include <bits/stdc++.h>
using namespace std;
#define V vector
#define rmin(a, b) a = min(a, b)
#define rmax(a, b) a = max(a, b)
#define rep(i, lim) for (int i = 0; i < (lim); i++)
#define nrep(i, s, lim) for (int i = s; i < (lim); i++)
#define repv(i, v) for (auto &i : (v))
#define fillv(v) for (auto &itr_ : (v)) { cin >> itr_; }
#define sortv(v) sort(v.begin(), v.end())
#define all(v) (v).begin(), (v).end()
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vvvvi = vector<vvvi>;
using ll = long long;
using vl = vector<ll>;
using vvl = vector<vl>;
using vvvl = vector<vvl>;
using vvvvl = vector<vvvl>;
template<class v>
auto operator<<(ostream &os, const vector<v> &vec)->ostream& {
os << vec[0];
for (size_t i = 1; i < vec.size(); i++) {
os << ' ' << vec[i];
}
os << '\n';
return os;
}
template<class v>
auto operator>>(istream &is, vector<v> &vec)->istream& {
for (auto &i : vec) {
is >> i;
}
return is;
}
template<class v>
auto operator<<(ostream &os, const vector<vector<v>> &vec)->ostream& {
for (auto &i : vec) {
os << i[0];
for (size_t j = 1; j < i.size(); j++) {
os << ' ' << i[j];
}
os << '\n';
}
return os;
}
template<class v>
auto operator>>(istream &is, vector<vector<v>> &vec)->istream& {
for (auto &i : vec) {
for (auto &j : i) {
is >> j;
}
}
return is;
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(nullptr);
vl dp(501, 0);
dp[1] = 1;
int count = 0;
int add = 1;
nrep(i, 2, 501) {
dp[i] = dp[i - 1] + add;
count++;
if (count == 2) {
count = 0;
add++;
}
}
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
cout << dp[n] << '\n';
}
}

123
Codeforces Round 1022 (Div. 2)/B. SUMdamental Decomposition.cpp Normal file
View File

@@ -0,0 +1,123 @@
/* Problem URL: https://codeforces.com/contest/2108/problem/B */
#include <bits/stdc++.h>
using namespace std;
#define V vector
#define rmin(a, b) a = min(a, b)
#define rmax(a, b) a = max(a, b)
#define rep(i, lim) for (int i = 0; i < (lim); i++)
#define nrep(i, s, lim) for (int i = s; i < (lim); i++)
#define repv(i, v) for (auto &i : (v))
#define fillv(v) for (auto &itr_ : (v)) { cin >> itr_; }
#define sortv(v) sort(v.begin(), v.end())
#define all(v) (v).begin(), (v).end()
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vvvvi = vector<vvvi>;
using ll = long long;
using vl = vector<ll>;
using vvl = vector<vl>;
using vvvl = vector<vvl>;
using vvvvl = vector<vvvl>;
template<class v>
auto operator<<(ostream &os, const vector<v> &vec)->ostream& {
os << vec[0];
for (size_t i = 1; i < vec.size(); i++) {
os << ' ' << vec[i];
}
os << '\n';
return os;
}
template<class v>
auto operator>>(istream &is, vector<v> &vec)->istream& {
for (auto &i : vec) {
is >> i;
}
return is;
}
template<class v>
auto operator<<(ostream &os, const vector<vector<v>> &vec)->ostream& {
for (auto &i : vec) {
os << i[0];
for (size_t j = 1; j < i.size(); j++) {
os << ' ' << i[j];
}
os << '\n';
}
return os;
}
template<class v>
auto operator>>(istream &is, vector<vector<v>> &vec)->istream& {
for (auto &i : vec) {
for (auto &j : i) {
is >> j;
}
}
return is;
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(nullptr);
int t;
cin >> t;
while (t--) {
ll n, x;
cin >> n >> x;
if (x == 0) {
if (n == 1) {
cout << "-1\n";
continue;
}
if (n & 1) {
cout << n + 3 << '\n';
continue;
}
cout << n << '\n';
continue;
}
int count = __builtin_popcountll(x);
if (n <= count) {
cout << x << '\n';
continue;
}
n -= count;
if (n & 1) {
if (count >= 2) {
cout << n + 1 + x << '\n';
continue;
}
ll ans = 1;
while (x & ans) {
ans <<= 1;
}
cout << n + ans * 2 + x - 1 << '\n';
continue;
}
cout << n + x << '\n';
}
}

124
Codeforces Round 1022 (Div. 2)/C. Neo's Escape.cpp Normal file
View File

@@ -0,0 +1,124 @@
/* Problem URL: https://codeforces.com/contest/2108/problem/C */
#include <bits/stdc++.h>
using namespace std;
#define V vector
#define rmin(a, b) a = min(a, b)
#define rmax(a, b) a = max(a, b)
#define rep(i, lim) for (int i = 0; i < (lim); i++)
#define nrep(i, s, lim) for (int i = s; i < (lim); i++)
#define repv(i, v) for (auto &i : (v))
#define fillv(v) for (auto &itr_ : (v)) { cin >> itr_; }
#define sortv(v) sort(v.begin(), v.end())
#define all(v) (v).begin(), (v).end()
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vvvvi = vector<vvvi>;
using ll = long long;
using vl = vector<ll>;
using vvl = vector<vl>;
using vvvl = vector<vvl>;
using vvvvl = vector<vvvl>;
template<class v>
auto operator<<(ostream &os, const vector<v> &vec)->ostream& {
os << vec[0];
for (size_t i = 1; i < vec.size(); i++) {
os << ' ' << vec[i];
}
os << '\n';
return os;
}
template<class v>
auto operator>>(istream &is, vector<v> &vec)->istream& {
for (auto &i : vec) {
is >> i;
}
return is;
}
template<class v>
auto operator<<(ostream &os, const vector<vector<v>> &vec)->ostream& {
for (auto &i : vec) {
os << i[0];
for (size_t j = 1; j < i.size(); j++) {
os << ' ' << i[j];
}
os << '\n';
}
return os;
}
template<class v>
auto operator>>(istream &is, vector<vector<v>> &vec)->istream& {
for (auto &i : vec) {
for (auto &j : i) {
is >> j;
}
}
return is;
}
struct func {
bool operator()(pair<ll, int> &a, pair<ll, int> &b) {
if (a.first == b.first) {
return a.second > b.second;
}
return a.first < b.first;
};
};
int main()
{
ios::sync_with_stdio(false);
cin.tie(nullptr);
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
vl fds;
ll prev = 0;
rep(i, n) {
ll now;
cin >> now;
if (now == prev) {
continue;
}
fds.push_back(now);
prev = now;
}
int ans = 0;
rep(i, fds.size()) {
int count = 0;
if (i + 1 >= fds.size() || (i + 1 < fds.size() && fds[i + 1] < fds[i])) {
count++;
}
if (i - 1 < 0 || (i - 1 >= 0 && fds[i - 1] < fds[i])) {
count++;
}
if (count == 2) {
ans++;
}
}
cout << ans << '\n';
}
}