# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
837481 | _martynas | Rope (JOI17_rope) | C++11 | 785 ms | 80596 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;
const int mxn = 1e6+5;
int n, m;
int a[mxn], ans[mxn];
int mxcnt = 0;
int cnt[mxn], revcnt[mxn];
vector<vector<int>> where;
void add(int x) {
if(cnt[x] == mxcnt) mxcnt++;
revcnt[cnt[x]]--;
cnt[x]++;
revcnt[cnt[x]]++;
}
void rem(int x) {
if(cnt[x] == mxcnt && revcnt[cnt[x]] == 1) mxcnt--;
revcnt[cnt[x]]--;
cnt[x]--;
revcnt[cnt[x]]++;
}
int main(int argc, char const *argv[]) {
cin >> n >> m;
where.resize(m+1);
for(int i = 0; i < n; i++) cin >> a[i], where[a[i]].push_back(i);
# | 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... |