# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
985498 | vjudge2 | Council (JOI23_council) | C++17 | 4008 ms | 92756 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 (auto& x : a) if (x.first != -1) u.push_back(x);
for (auto& y : b) if (y.first != -1) u.push_back(y);
sort(u.begin(), u.end(), [] (pair<int, int> x, pair<int, int> y) {
return x.first > y.first;
});
a.clear();
for (int i = 0; i < u.size(); i++) {
if (!occ.count(u[i].second) && u[i].first != -1) {
a.push_back(u[i]);
occ.insert(u[i].second);
}
}
while ((int) a.size() > 2) a.pop_back();
}
int main() {
ios::sync_with_stdio(0); cin.tie(0);
int n, m;
cin >> n >> m;
vector<int> a(n, 0), freq(m, 0), b(n, 0);
vector<vector<pair<int, int>>> dp(1 << m);
for (int i = 0; i < n; i++) {
int x;
for (int j = 0; j < m; j++) {
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... |