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

Add a lot more problems and a TODO list

Browse Source
This commit is contained in:
Segcolt
2025-10-18 16:54:05 -03:00
parent f82c3630cf
commit f3275cd442
72 changed files with 9550 additions and 17 deletions
Download Patch File Download Diff File Expand all files Collapse all files

89
Educational Codeforces Round 45 (Rated for Div. 2)/A. Commentary Boxes.cpp Normal file
View File

@@ -0,0 +1,89 @@
/* Problem URL: https://codeforces.com/contest/990/problem/A */
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
template <class T, class comp = less<>>
using ordered_set = tree<T, null_type , comp , rb_tree_tag , tree_order_statistics_node_update>;
#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);
ll n, m, a, b;
cin >> n >> m >> a >> b;
ll mod = n % m;
cout << min(mod * b, (m - mod) * a) << '\n';
}

104
Educational Codeforces Round 45 (Rated for Div. 2)/B. Micro-World.cpp Normal file
View File

@@ -0,0 +1,104 @@
/* Problem URL: https://codeforces.com/contest/990/problem/B */
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
template <class T, class comp = less<>>
using ordered_set = tree<T, null_type , comp , rb_tree_tag , tree_order_statistics_node_update>;
#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 n, k;
cin >> n >> k;
vl fds(n);
cin >> fds;
multiset<int> pq;
rep(i, n) {
pq.insert(fds[i]);
}
auto itr = pq.begin();
while (itr != pq.end()) {
auto get = pq.lower_bound(*itr - k);
while (*get != *itr) {
get = pq.erase(get);
}
itr++;
}
cout << pq.size() << '\n';
}

144
Educational Codeforces Round 45 (Rated for Div. 2)/C. Bracket Sequences Concatenation Problem.cpp Normal file
View File

@@ -0,0 +1,144 @@
/* Problem URL: https://codeforces.com/contest/990/problem/C */
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
template <class T, class comp = less<>>
using ordered_set = tree<T, null_type , comp , rb_tree_tag , tree_order_statistics_node_update>;
#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 n;
cin >> n;
map<int, int> count;
int c = 0;
ll ans = 0;
while (n--) {
string a;
cin >> a;
int suf = 0;
repv(i, a) {
if (i == '(') {
suf++;
continue;
}
if (suf == 0) {
suf = -1;
break;
}
suf--;
}
int pref = 0;
for (int i = a.size() - 1; i >= 0; i--) {
if (a[i] == ')') {
pref++;
continue;
}
if (pref == 0) {
pref = -1;
break;
}
pref--;
}
if (pref == -1 && suf == -1) {
continue;
}
if (pref == 0 || suf == 0) {
c++;
continue;
}
if (pref == -1) {
ans += count[-suf];
count[suf]++;
continue;
}
ans += count[pref];
count[-pref]++;
}
ans += (ll)c * c;
cout << ans << '\n';
}

168
Educational Codeforces Round 45 (Rated for Div. 2)/D. Graph And Its Complement.cpp Normal file
View File

@@ -0,0 +1,168 @@
/* Problem URL: https://codeforces.com/contest/990/problem/D */
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
template <class T, class comp = less<>>
using ordered_set = tree<T, null_type , comp , rb_tree_tag , tree_order_statistics_node_update>;
#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 n, a, b;
cin >> n >> a >> b;
if (n == 1) {
cout << "YES\n0\n";
return 0;
}
if (n == 2) {
if (a == b) {
cout << "NO\n";
} else {
cout << "YES\n";
if (a == 1) {
cout << "01\n10\n";
} else {
cout << "00\n00\n";
}
}
return 0;
}
if (a != 1 && b != 1) {
cout << "NO\n";
return 0;
}
if (n == 3 && max(a, b) == 1) {
cout << "NO\n";
return 0;
}
bool inv = false;
if (b == 1) {
swap(a, b);
inv = true;
}
cout << "YES\n";
vvi adj(n, vi(n));
if (b == 1) {
nrep(i, 1, n - 1) {
adj[0][i] = 1;
adj[i][0] = 1;
}
adj[n - 1][n - 2] = 1;
adj[n - 2][n - 1] = 1;
repv(i, adj) {
repv(j, i) {
cout << j;
}
cout << '\n';
}
return 0;
}
rep(i, b - 1) {
nrep(j, i + 1, n) {
adj[i][j] = 1;
adj[j][i] = 1;
}
}
if (inv) {
rep(i, n) {
rep(j, n) {
if (i == j) {
continue;
}
adj[i][j] ^= 1;
}
}
}
repv(i, adj) {
repv(j, i) {
cout << j;
}
cout << '\n';
}
}

138
Educational Codeforces Round 45 (Rated for Div. 2)/E. Post Lamps.cpp Normal file
View File

@@ -0,0 +1,138 @@
/* Problem URL: https://codeforces.com/contest/990/problem/E */
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
template <class T, class comp = less<>>
using ordered_set = tree<T, null_type , comp , rb_tree_tag , tree_order_statistics_node_update>;
#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 n, m, k;
cin >> n >> m >> k;
n += 2;
V<bool> blocked(n);
while (m--) {
int n;
cin >> n;
blocked[n] = true;
}
if (blocked[0]) {
cout << "-1\n";
return 0;
}
int prev = 0;
vi pref(n);
int c = 1;
int minimal = 0;
nrep(i, 1, n) {
rmax(minimal, c);
c++;
if (!blocked[i]) {
prev = i;
c = 1;
}
pref[i] = prev;
}
if (minimal > k) {
cout << "-1\n";
return 0;
}
vl cost(k);
cin >> cost;
ll ans = INT64_MAX >> 1;
nrep(i, minimal - 1, k) {
ll now = 0;
int cur = 0;
while (cur < n - 2) {
now += cost[i];
cur = pref[min(cur + i + 1, n - 1)];
}
rmin(ans, now);
}
cout << ans << '\n';
}