# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
128109 | EntityIT | Rope (JOI17_rope) | C++14 | 2610 ms | 172652 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;
#define fi first
#define se second
#define pb push_back
using ii = pair<int, int>;
int n, m;
vector<int> c, cnt, Cnt;
vector<bool> existed;
vector< vector<int> > vec[2];
multiset<int> rem;
void upd (int col, int val) {
rem.erase(rem.find(cnt[col]) );
cnt[col] += val;
rem.insert(cnt[col]);
}
int solve (int col, bool _) {
int cnt_rem = n - cnt[col];
for (int _col : vec[_][col]) ++Cnt[_col];
for (int _col : vec[_][col]) if (!existed[_col]) {
existed[_col] = 1;
cnt_rem -= Cnt[_col];
upd(_col, -Cnt[_col]);
}
rem.erase(rem.find(cnt[col]) );
# | 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... |