oj.uz

Submission #851945

# Submission time Handle Problem Language Result Execution time Memory
851945 2023-09-20T21:19:50 Z MrM7md Bubble Sort 2 (JOI18_bubblesort2) C++17
38 / 100
 9000 ms 1748 KB 
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
// #define int long long
#define F first
#define S second
#define pb push_back
#define all(a) a.begin(),a.end()
const int N=2e5 + 3;
const int MOD=1e9+7;
const int off=(1<<20);
 
// int mx[off*2],mn[off*2];
// void upd(int x,int v){
// 	x+=off;
// 	mx[x]=v;
// 	mn[x]=v;
// 	while(x/=2){
// 		mx[x]=max(mx[x*2],mx[x*2+1]);
// 		if(mn[x*2]==0)mn[x*2]=INT_MAX;
// 		if(mn[x*2+1]==0)mn[x*2+1]=INT_MAX;
// 		mn[x]=min(mn[x*2],mn[x*2+1]);
// 	}
// }
// int get(int x,int l,int r,int st,int en,int val){
// 	if(r<st||l>en)return 0;
//    if(l>=st&&r<=en){
//       // if(mn[x]>val)
//       return r-l+1;
//       // if(mx[x]<=val)
//       return 0;
//    }
//    int mid=(l+r)/2;
//    return (get(x*2,l,mid,st,en,val)+get(x*2+1,mid+1,r,st,en,val));
// }
 
std::vector<int> countScans(std::vector<int> A,std::vector<int> X,std::vector<int> V){

	vector<int>ans;
	int q=X.size(),n=A.size();
	if(n>=50000||q>=50000){
		vector<set<int>>vv(101);
		for(int i=0;i<n;i++){
			vv[A[i]].insert(i+1);
		}
		for(int j=0;j<q;j++){
			int x=X[j],v=V[j];
			vv[A[x]].erase(x+1);
			vv[v].insert(x+1);
			A[x]=v;
			int cur=0,mxx=0;
			for(int i=1;i<=100;i++){
				if(vv[i].empty())continue;
				cur+=vv[i].size();
				mxx=max(mxx,(*vv[i].rbegin())-cur);
			}
			ans.pb(mxx);
		}
		return ans;
	}
	// int dis[n]={0};
	multiset<int>ms;
	vector<pair<int,int>>per,yo;
	for(int i=0;i<n;i++)per.pb({A[i],i});
   for(int j=0;j<q;j++){
      int x=X[j],v=V[j];
		A[x]=v;
		per[x]={v,x};
		yo=per;
		sort(all(yo));
		int mxx=0;
 		for(int i=0;i<n;i++){
			mxx=max(mxx,yo[i].S-i);
		}
		
      ans.pb(mxx);
   }
	return ans;
}

Subtask #1
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 344 KB Output is correct
2 Correct 26 ms 348 KB Output is correct
3 Correct 181 ms 592 KB Output is correct
4 Correct 179 ms 344 KB Output is correct
5 Correct 174 ms 348 KB Output is correct
6 Correct 108 ms 344 KB Output is correct
7 Correct 146 ms 344 KB Output is correct
8 Correct 167 ms 344 KB Output is correct
9 Correct 174 ms 344 KB Output is correct
10 Correct 102 ms 516 KB Output is correct
11 Correct 106 ms 512 KB Output is correct
12 Correct 100 ms 508 KB Output is correct
13 Correct 101 ms 512 KB Output is correct
14 Correct 99 ms 344 KB Output is correct
15 Correct 101 ms 348 KB Output is correct
16 Correct 92 ms 504 KB Output is correct
17 Correct 93 ms 504 KB Output is correct
18 Correct 91 ms 508 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 344 KB Output is correct
2 Correct 26 ms 348 KB Output is correct
3 Correct 181 ms 592 KB Output is correct
4 Correct 179 ms 344 KB Output is correct
5 Correct 174 ms 348 KB Output is correct
6 Correct 108 ms 344 KB Output is correct
7 Correct 146 ms 344 KB Output is correct
8 Correct 167 ms 344 KB Output is correct
9 Correct 174 ms 344 KB Output is correct
10 Correct 102 ms 516 KB Output is correct
11 Correct 106 ms 512 KB Output is correct
12 Correct 100 ms 508 KB Output is correct
13 Correct 101 ms 512 KB Output is correct
14 Correct 99 ms 344 KB Output is correct
15 Correct 101 ms 348 KB Output is correct
16 Correct 92 ms 504 KB Output is correct
17 Correct 93 ms 504 KB Output is correct
18 Correct 91 ms 508 KB Output is correct
19 Correct 2587 ms 752 KB Output is correct
20 Correct 3409 ms 784 KB Output is correct
21 Correct 2945 ms 792 KB Output is correct
22 Correct 3318 ms 600 KB Output is correct
23 Correct 1930 ms 772 KB Output is correct
24 Correct 1975 ms 784 KB Output is correct
25 Correct 1911 ms 788 KB Output is correct
26 Correct 1921 ms 848 KB Output is correct
27 Correct 1932 ms 788 KB Output is correct
28 Correct 1915 ms 788 KB Output is correct

Subtask #3
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 4438 ms 1236 KB Output is correct
2 Execution timed out 9094 ms 1748 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #4
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 344 KB Output is correct
2 Correct 26 ms 348 KB Output is correct
3 Correct 181 ms 592 KB Output is correct
4 Correct 179 ms 344 KB Output is correct
5 Correct 174 ms 348 KB Output is correct
6 Correct 108 ms 344 KB Output is correct
7 Correct 146 ms 344 KB Output is correct
8 Correct 167 ms 344 KB Output is correct
9 Correct 174 ms 344 KB Output is correct
10 Correct 102 ms 516 KB Output is correct
11 Correct 106 ms 512 KB Output is correct
12 Correct 100 ms 508 KB Output is correct
13 Correct 101 ms 512 KB Output is correct
14 Correct 99 ms 344 KB Output is correct
15 Correct 101 ms 348 KB Output is correct
16 Correct 92 ms 504 KB Output is correct
17 Correct 93 ms 504 KB Output is correct
18 Correct 91 ms 508 KB Output is correct
19 Correct 2587 ms 752 KB Output is correct
20 Correct 3409 ms 784 KB Output is correct
21 Correct 2945 ms 792 KB Output is correct
22 Correct 3318 ms 600 KB Output is correct
23 Correct 1930 ms 772 KB Output is correct
24 Correct 1975 ms 784 KB Output is correct
25 Correct 1911 ms 788 KB Output is correct
26 Correct 1921 ms 848 KB Output is correct
27 Correct 1932 ms 788 KB Output is correct
28 Correct 1915 ms 788 KB Output is correct
29 Correct 4438 ms 1236 KB Output is correct
30 Execution timed out 9094 ms 1748 KB Time limit exceeded
31 Halted 0 ms 0 KB -