oj.uz

답안 #851946

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
851946 2023-09-20T21:21:01 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){
		return ans;
		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);
		}
	}
	// 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

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 344 KB Output is correct
2 Correct 27 ms 344 KB Output is correct
3 Correct 198 ms 500 KB Output is correct
4 Correct 185 ms 344 KB Output is correct
5 Correct 185 ms 504 KB Output is correct
6 Correct 114 ms 508 KB Output is correct
7 Correct 153 ms 344 KB Output is correct
8 Correct 171 ms 512 KB Output is correct
9 Correct 181 ms 504 KB Output is correct
10 Correct 108 ms 344 KB Output is correct
11 Correct 107 ms 508 KB Output is correct
12 Correct 107 ms 344 KB Output is correct
13 Correct 106 ms 504 KB Output is correct
14 Correct 108 ms 344 KB Output is correct
15 Correct 119 ms 344 KB Output is correct
16 Correct 104 ms 504 KB Output is correct
17 Correct 100 ms 504 KB Output is correct
18 Correct 93 ms 508 KB Output is correct

Subtask #2
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 344 KB Output is correct
2 Correct 27 ms 344 KB Output is correct
3 Correct 198 ms 500 KB Output is correct
4 Correct 185 ms 344 KB Output is correct
5 Correct 185 ms 504 KB Output is correct
6 Correct 114 ms 508 KB Output is correct
7 Correct 153 ms 344 KB Output is correct
8 Correct 171 ms 512 KB Output is correct
9 Correct 181 ms 504 KB Output is correct
10 Correct 108 ms 344 KB Output is correct
11 Correct 107 ms 508 KB Output is correct
12 Correct 107 ms 344 KB Output is correct
13 Correct 106 ms 504 KB Output is correct
14 Correct 108 ms 344 KB Output is correct
15 Correct 119 ms 344 KB Output is correct
16 Correct 104 ms 504 KB Output is correct
17 Correct 100 ms 504 KB Output is correct
18 Correct 93 ms 508 KB Output is correct
19 Correct 2647 ms 996 KB Output is correct
20 Correct 3523 ms 848 KB Output is correct
21 Correct 3049 ms 788 KB Output is correct
22 Correct 3386 ms 788 KB Output is correct
23 Correct 2063 ms 788 KB Output is correct
24 Correct 2109 ms 792 KB Output is correct
25 Correct 2087 ms 788 KB Output is correct
26 Correct 2075 ms 788 KB Output is correct
27 Correct 2027 ms 788 KB Output is correct
28 Correct 2033 ms 848 KB Output is correct

Subtask #3
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4557 ms 1492 KB Output is correct
2 Execution timed out 9031 ms 1748 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #4
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 344 KB Output is correct
2 Correct 27 ms 344 KB Output is correct
3 Correct 198 ms 500 KB Output is correct
4 Correct 185 ms 344 KB Output is correct
5 Correct 185 ms 504 KB Output is correct
6 Correct 114 ms 508 KB Output is correct
7 Correct 153 ms 344 KB Output is correct
8 Correct 171 ms 512 KB Output is correct
9 Correct 181 ms 504 KB Output is correct
10 Correct 108 ms 344 KB Output is correct
11 Correct 107 ms 508 KB Output is correct
12 Correct 107 ms 344 KB Output is correct
13 Correct 106 ms 504 KB Output is correct
14 Correct 108 ms 344 KB Output is correct
15 Correct 119 ms 344 KB Output is correct
16 Correct 104 ms 504 KB Output is correct
17 Correct 100 ms 504 KB Output is correct
18 Correct 93 ms 508 KB Output is correct
19 Correct 2647 ms 996 KB Output is correct
20 Correct 3523 ms 848 KB Output is correct
21 Correct 3049 ms 788 KB Output is correct
22 Correct 3386 ms 788 KB Output is correct
23 Correct 2063 ms 788 KB Output is correct
24 Correct 2109 ms 792 KB Output is correct
25 Correct 2087 ms 788 KB Output is correct
26 Correct 2075 ms 788 KB Output is correct
27 Correct 2027 ms 788 KB Output is correct
28 Correct 2033 ms 848 KB Output is correct
29 Correct 4557 ms 1492 KB Output is correct
30 Execution timed out 9031 ms 1748 KB Time limit exceeded
31 Halted 0 ms 0 KB -