# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
277937 | Revo7 | Bubble Sort 2 (JOI18_bubblesort2) | C++14 | 121 ms | 4980 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 "bubblesort2.h"
#include<bits/stdc++.h>
#define pb push_back
using namespace std;
vector<int> countScans(vector<int> a,vector<int> pos,vector<int> v){
set<int>s[111];
for(int i=0;i<a.size();i++){
s[a[i]].insert(i);
}
vector<int>ans;
for(int i=0;i<pos.size();i++){
//cout<<i<<endl;
int mx=0,id=pos[i],newval=v[i];
s[a[id]].erase(id);
a[id]=newval;
s[newval].insert(id);
int cur=0;
for(int j=1;j<=100;j++){
cur+=s[j].size();
if(s[j].size())
mx=max(mx,*s[j].rbegin()-cur+1);
}
ans.pb(mx);
}
return ans;
}
/*
4 2
1 2 3 4
0 3
2 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... |