# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
985368 | vjudge2 | Council (JOI23_council) | C++17 | 4035 ms | 57948 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
void update(vector<pair<int, int>>& a, vector<pair<int, int>>& b) {
vector<pair<int, int>> u;
set<int> occ;
// for (int i = 0; i < 2; i++) cout << a[i].first << ' ' << a[i].second << '\n';
// for (int i = 0; i < 2; i++) cout << b[i].first << ' ' << b[i].second << '\n';
for (int i = 0; i < 2; i++) {
// if (!occ.count(a[i]) && a[i].first != -1) {
u.push_back(a[i]);
// occ.insert(a[i]);
// }
// if (!occ.count(b[i]) && b[i].first != -1) {
u.push_back(b[i]);
// occ.insert(b[i]);
// }
}
sort(u.begin(), u.end(), [] (pair<int, int> x, pair<int, int> y) {
return x.first > y.first;
});
vector<pair<int, int>> v;
for (int i = 0; i < u.size(); i++) {
if (!occ.count(u[i].second) && u[i].first != -1) {
v.push_back(u[i]);
occ.insert(u[i].second);
}
}
while ((int) v.size() > 2) v.pop_back();
while ((int) v.size() < 2) v.push_back({-1, -1});
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |