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

98
Educational Codeforces Round 36 (Rated for Div. 2)/A. Garden.cpp Normal file
View File

@@ -0,0 +1,98 @@
/* Problem URL: https://codeforces.com/contest/915/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);
int n, k;
cin >> n >> k;
vi fds(n);
cin >> fds;
int ans = INT32_MAX >> 1;
repv(i, fds) {
if (k % i == 0) {
rmin(ans, k / i);
}
}
cout << ans << '\n';
}

117
Educational Codeforces Round 36 (Rated for Div. 2)/B. Browser.cpp Normal file
View File

@@ -0,0 +1,117 @@
/* Problem URL: https://codeforces.com/contest/915/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, pos, l, r;
cin >> n >> pos >> l >> r;
int ans = 0;
if (pos >= l && pos <= r) {
int first = (pos - l + (l != 1)) * (l != 1) + (r - l + (r != n)) * (r != n);
int second = (r - pos + (r != n)) * (r != n) + (r - l + (l != 1)) * (l != 1);
cout << min(first, second) << '\n';
return 0;
}
if (pos < l) {
ans += l - pos;
pos = l;
}
if (pos > r) {
ans += pos - r;
pos = r;
}
if (r != n) {
ans += abs(r - pos) + 1;
}
if (l != 1) {
ans += abs(pos - l) + 1;
}
cout << ans << '\n';
}

153
Educational Codeforces Round 36 (Rated for Div. 2)/C. Permute Digits.cpp Normal file
View File

@@ -0,0 +1,153 @@
/* Problem URL: https://codeforces.com/contest/915/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);
string a, b;
cin >> a >> b;
sort(all(a), greater<>());
if (b.size() > a.size()) {
cout << a << '\n';
return 0;
}
V<char> maximal(b.size());
maximal.back() = b.back();
for (int i = (int)b.size() - 2; i >= 0; i--) {
maximal[i] = max(maximal[i + 1], b[i]);
}
vi count(10);
repv(i, a) {
count[i - '0']++;
}
function<bool(int, int)> getans = [&](int i, int p) {
if (i >= a.size()) {
return a <= b;
}
if (p) {
int now = 0;
while (count[now] == 0) {
now++;
}
count[now]--;
a[i] = now + '0';
bool res = getans(i + 1, 1);
count[now]++;
return res;
}
int now = 9;
while (count[now] == 0) {
now--;
}
a[i] = now + '0';
count[now]--;
while (!getans(i + 1, 1)) {
count[now]++;
now--;
while (count[now] == 0) {
now--;
}
a[i] = now + '0';
count[now]--;
}
return getans(i + 1, 0);
};
getans(0, 0);
cout << a << '\n';
}

191
Educational Codeforces Round 36 (Rated for Div. 2)/D. Almost Acyclic Graph.cpp Normal file
View File

@@ -0,0 +1,191 @@
/* Problem URL: https://codeforces.com/contest/915/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, m;
cin >> n >> m;
V<V<pair<int, int>>> graph(n);
rep(i, m) {
int a, b;
cin >> a >> b;
graph[a - 1].emplace_back(b - 1, i);
}
V<bool> vis(n);
V<bool> frame(n);
vi choices;
function<bool(int)> dfs = [&](int i) {
vis[i] = true;
frame[i] = true;
for (auto [j, id] : graph[i]) {
if (frame[j]) {
choices.push_back(id);
return true;
}
if (vis[j]) {
continue;
}
if (dfs(j)) {
choices.push_back(id);
return true;
}
}
frame[i] = false;
return false;
};
rep(i, n) {
if (vis[i]) {
continue;
}
if (dfs(i)) {
break;
}
}
if (choices.empty()) {
cout << "YES\n";
return 0;
}
function<bool(int, int)> cyclecheck = [&](int i, int ig) {
vis[i] = true;
frame[i] = true;
for (auto [j, id] : graph[i]) {
if (id == ig) {
continue;
}
if (frame[j]) {
return true;
}
if (vis[j]) {
continue;
}
if (cyclecheck(j, ig)) {
return true;
}
}
frame[i] = false;
return false;
};
repv(ig, choices) {
fill(all(vis), false);
fill(all(frame), false);
bool valid = true;
rep(i, n) {
if (vis[i]) {
continue;
}
if (cyclecheck(i, ig)) {
valid = false;
break;
}
}
if (valid) {
cout << "YES\n";
return 0;
}
}
cout << "NO\n";
}

128
Educational Codeforces Round 36 (Rated for Div. 2)/E. Physical Education Lessons.cpp Normal file
View File

@@ -0,0 +1,128 @@
/* Problem URL: https://codeforces.com/contest/915/problem/E */
/*
* TODO: Finish the problem
*/
#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, q;
cin >> n >> q;
set<pair<int, int>> var;
ll ans = 0;
while (q--) {
int l, r, k;
cin >> l >> r >> k;
auto itr = var.lower_bound({l, 0});
while (itr != var.end() && itr->second <= r) {
ans -= itr->first - itr->second + 1;
int lone = itr->second;
int rone = min(l - 1, itr->first);
if (lone <= rone) {
ans += rone - lone + 1;
var.emplace(rone, lone);
}
int ltwo = max(itr->second, r + 1);
int rtwo = itr->first;
if (ltwo <= rtwo) {
ans += rtwo - ltwo + 1;
var.emplace(rtwo, ltwo);
}
itr = var.erase(itr);
}
if (k == 1) {
ans += r - l + 1;
var.emplace(r, l);
}
cout << n - ans << '\n';
}
}