# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
256299 | pit4h | Rope (JOI17_rope) | C++14 | 2580 ms | 83284 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>
#define st first
#define nd second
using namespace std;
int main() {
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int n, m;
cin>>n>>m;
vector<int> a(n), occ(m+1);
vector<vector<pair<int, int>>> col(m+1);
vector<pair<int, int>> best;
for(int i=0; i<n; ++i) {
cin>>a[i];
occ[a[i]]++;
if(i==0 || a[i] != a[i-1]) {
col[a[i]].push_back({i, i});
}
else {
col[a[i]].back().nd = i;
}
}
for(int i=1; i<=m; ++i) {
best.push_back({occ[i], i});
}
sort(best.rbegin(), best.rend());
for(int c=1; c<=m; ++c) {
if(col[c].empty()) continue;
vector<vector<int>> cnt(2, vector<int>(m+1));
# | 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... |