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
2024 United Kingdom and Ireland Programming Contest (UKIEPC 2024)/A. Amalgram.cpp Normal file
View File

@@ -0,0 +1,99 @@
/* Problem URL: https://codeforces.com/gym/105446/problem/A */
#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);
string a, b;
cin >> a >> b;
vi counta(26);
vi countb(26);
repv(i, a) {
counta[i - 'a']++;
}
repv(i, b) {
countb[i - 'a']++;
}
rep(i, 26) {
int now = max(counta[i], countb[i]);
while (now--) {
cout << (char)(i + 'a');
}
}
cout << '\n';
}

123
2024 United Kingdom and Ireland Programming Contest (UKIEPC 2024)/D. Drone Control.cpp Normal file
View File

@@ -0,0 +1,123 @@
/* Problem URL: https://codeforces.com/gym/105446/problem/D */
#include <bits/stdc++.h>
#include <algorithm>
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 q;
cin >> q;
while (q--) {
double p, r, y;
cin >> p >> r >> y;
double low = -1.5;
double high = 1.5;
while (high - low >= 1e-10) {
double third = (high - low) / 3;
double mid1 = low + third;
double mid2 = high - third;
auto check = [&](double mid) {
double w = mid;
double s = (y - p - r) / 2 + w;
double n = r + s;
double e = p + w;
return max({abs(w), abs(s), abs(n), abs(e)});
};
if (check(mid1) < check(mid2)) {
high = mid1;
continue;
}
if (check(mid1) > check(mid2)) {
low = mid2;
continue;
}
low = mid1;
high = mid2;
}
double w = low;
double s = (y - p - r) / 2 + w;
double n = r + s;
double e = p + w;
cout << fixed << setprecision(6) << n << ' ' << e << ' ' << s << ' ' << w << '\n';
}
}

140
2024 United Kingdom and Ireland Programming Contest (UKIEPC 2024)/F. Finding Suspicious Proteins.cpp Normal file
View File

@@ -0,0 +1,140 @@
/* Problem URL: https://codeforces.com/gym/105446/problem/F */
#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, l, k;
cin >> n >> l >> k;
V<bool> vis(n);
V<string> rev(n);
vvi s(n, vi(l));
rep(i, n) {
string fds;
cin >> fds;
rev[i] = fds;
rep(j, l) {
cin >> s[i][j];
}
}
auto diff = [&](int i, int j) {
int ans = 0;
rep(f, l) {
ans += abs(s[i][f] - s[j][f]);
}
return ans;
};
vi dis(n, INT32_MAX);
vi choices;
int now = 0;
int maximal = 0;
nrep(i, 1, n) {
int d = diff(0, i);
if (d > maximal) {
maximal = d;
now = i;
}
}
choices.push_back(now);
nrep(i, 1, k) {
now = 0;
maximal = 0;
rep(j, n) {
rmin(dis[j], diff(choices.back(), j));
if (dis[j] > maximal) {
maximal = dis[j];
now = j;
}
}
choices.push_back(now);
}
repv(i, choices) {
cout << rev[i] << '\n';
}
}