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

95
2019-2020 ACM-ICPC Brazil Subregional Programming Contest/B. Buffoon.cpp Normal file
View File

@@ -0,0 +1,95 @@
/* Problem URL: https://codeforces.com/gym/102346/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 n;
cin >> n;
n--;
int carlos;
cin >> carlos;
while (n--) {
int nm;
cin >> nm;
if (nm > carlos) {
cout << "N\n";
return 0;
}
}
cout << "S\n";
}

129
2019-2020 ACM-ICPC Brazil Subregional Programming Contest/D. Denouncing Mafia.cpp Normal file
View File

@@ -0,0 +1,129 @@
/* Problem URL: https://codeforces.com/gym/102346/problem/D */
#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 n, k;
cin >> n >> k;
vvi graph(n);
nrep(i, 1, n) {
int p;
cin >> p;
graph[p - 1].push_back(i);
}
V<multiset<int, greater<>>> sets(n);
function<void(int)> dfs = [&](int i) {
for (auto j : graph[i]) {
dfs(j);
if (sets[j].size() > sets[i].size()) {
swap(sets[j], sets[i]);
}
for (auto k : sets[j]) {
sets[i].insert(k);
}
}
if (sets[i].empty()) {
sets[i].insert(1);
return;
}
auto itr = sets[i].begin();
int v = *itr + 1;
sets[i].erase(itr);
sets[i].insert(v);
};
dfs(0);
int ans = 0;
auto itr = sets[0].begin();
rep(i, k) {
if (itr == sets[0].end()) {
break;
}
ans += *itr;
itr++;
}
cout << ans << '\n';
}

91
2019-2020 ACM-ICPC Brazil Subregional Programming Contest/H. Hour for a Run.cpp Normal file
View File

@@ -0,0 +1,91 @@
/* Problem URL: https://codeforces.com/gym/102346/problem/H */
#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 n, v;
cin >> n >> v;
v *= n;
cout << (ll)ceil(v * 0.1) << ' ';
cout << (ll)ceil(v * 0.2) << ' ';
cout << (ll)ceil(v * 0.3) << ' ';
cout << (ll)ceil(v * 0.4) << ' ';
cout << (ll)ceil(v * 0.5) << ' ';
cout << (ll)ceil(v * 0.6) << ' ';
cout << (ll)ceil(v * 0.7) << ' ';
cout << (ll)ceil(v * 0.8) << ' ';
cout << (ll)ceil(v * 0.9) << '\n';
}

204
2019-2020 ACM-ICPC Brazil Subregional Programming Contest/J. Jar of Water Game.cpp Normal file
View File

@@ -0,0 +1,204 @@
/* Problem URL: https://codeforces.com/gym/102346/problem/J */
#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 n, k;
cin >> n >> k;
vvi cards(n, vi(14, 0));
map<char, int> act;
act['A'] = 1;
act['2'] = 2;
act['3'] = 3;
act['4'] = 4;
act['5'] = 5;
act['6'] = 6;
act['7'] = 7;
act['8'] = 8;
act['9'] = 9;
act['D'] = 10;
act['Q'] = 11;
act['J'] = 12;
act['K'] = 13;
rep(i, n) {
string a;
cin >> a;
repv(j, a) {
cards[i][act[j]]++;
}
}
k--;
rep(i, n) {
if (i == k) {
continue;
}
nrep(j, 1, 14) {
if (cards[i][j] == 4) {
cout << i + 1 << '\n';
return 0;
}
}
}
rep(i, n) {
int minimal = 2;
int choice = 13;
int now = (i + k) % n;
for (int j = 13; j > 0; j--) {
if (cards[now][j] <= minimal && cards[now][j] > 0) {
minimal = cards[now][j];
choice = j;
}
}
cards[now][choice]--;
cards[(now + 1) % n][choice]++;
if (now != k) {
nrep(j, 1, 14) {
if (cards[now][j] == 4) {
rep(l, n) {
nrep(c, 1, 14) {
if (cards[l][c] == 4 && l != k) {
cout << l + 1 << '\n';
return 0;
}
}
}
}
}
}
}
nrep(i, 1, 14) {
if (cards[k][i] == 4) {
cout << k + 1 << '\n';
return 0;
}
}
k = (k + 1) % n;
while (true) {
rep(i, n - 1) {
int minimal = 2;
int choice = 13;
int now = (k + i) % n;
for (int j = 13; j > 0; j--) {
if (cards[now][j] <= minimal && cards[now][j] > 0) {
minimal = cards[now][j];
choice = j;
}
}
cards[now][choice]--;
cards[(now + 1) % n][choice]++;
if (now != ((k - 1) % n + n) % n) {
nrep(j, 1, 14) {
if (cards[now][j] == 4) {
rep(l, n) {
nrep(c, 1, 14) {
if (cards[l][c] == 4 && l != ((k - 1) % n + n) % n) {
cout << l + 1 << '\n';
return 0;
}
}
}
}
}
}
}
nrep(i, 1, 14) {
if (cards[k][i] == 4) {
cout << k + 1 << '\n';
return 0;
}
}
k = (k + 1) % n;
}
}

80
2019-2020 ACM-ICPC Brazil Subregional Programming Contest/L. Less Coin Tosses.cpp Normal file
View File

@@ -0,0 +1,80 @@
/* Problem URL: https://codeforces.com/gym/102346/problem/L */
#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);
ll n;
cin >> n;
cout << (1LL << (__builtin_popcountll(n))) << '\n';
}

125
2019-2020 ACM-ICPC Brazil Subregional Programming Contest/M. Maratona Brasileira de Popcorn.cpp Normal file
View File

@@ -0,0 +1,125 @@
/* Problem URL: https://codeforces.com/gym/102346/problem/M */
#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 n, c, t;
cin >> n >> c >> t;
vi pop(n);
repv(i, pop) {
cin >> i;
// i = (i + (t - 1)) / t;
}
ll ans = 1;
ll low = 1;
ll high = 1e9;
while (low <= high) {
ll mid = (low + high) / 2;
int count = 1;
ll now = 0;
rep(i, n) {
if ((pop[i] + (t - 1)) / t > mid) {
now = 1e9 + 1;
break;
}
now += pop[i];
if ((now + (t - 1)) / t > mid) {
if (count == c) {
break;
}
count++;
now = pop[i];
}
}
if ((now + (t - 1)) / t <= mid) {
ans = mid;
high = mid - 1;
continue;
}
low = mid + 1;
}
cout << ans << '\n';
}