oj.uz

답안 #408958

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
408958 2021-05-19T22:39:48 Z AmineWeslati Bubble Sort 2 (JOI18_bubblesort2) C++14
38 / 100
 9000 ms 3880 KB 
#include <bits/stdc++.h>
#include "bubblesort2.h"
using namespace std;
 
typedef long long ll;
typedef vector<int>vi;
#define pb push_back
#define sz(v) (int)v.size()
#define all(x) begin(x),end(x)
 
#define FOR(i,a,b) for(int i=a; i<b; i++)
#define ROF(i,a,b) for(int i=b-1; i>=a; i--)
 
//--------------------------------------------//
 
int N,Q;
vi a; 
 
void ckmax(int &x, int y){x=max(x,y);}
 
const int MX=5e5+10;
vi t(MX,0);

void upd(int i){
	for(;i<MX; i+=i&-i) t[i]++;
}
int get(int i){
	int ans=0;
	for(;i;i-=i&-i) ans+=t[i];
	return ans;
}
 
vi countScans(vi A,vi X,vi V){
	N=sz(A); Q=sz(X);
	a.assign(all(A));

	vi temp;
	temp.assign(all(a));
	FOR(i,0,Q) temp.pb(V[i]);
	sort(all(temp));

	unordered_map<int,int>mp;
	int cnt=0;
	for(int x: temp) if(!mp.count(x)) mp[x]=++cnt;

	FOR(i,0,N) a[i]=mp[a[i]];
	FOR(i,0,Q) V[i]=mp[V[i]];

	vi ans(Q,0);
	FOR(idx,0,Q){
		a[X[idx]]=V[idx];
 
		vi st,vec(N,0);
		/*ROF(i,0,N){
			while(sz(st) && st.back()<a[i]) st.pop_back();
 			
			if(!sz(st)){
				vec[i]=(i!=N-1);
			} 
			else{
				if(st.back()==i+1 && !vec[st.back()])
					vec[i]=0;
				else vec[i]=vec[st.back()]+1;
			}
 
			st.pb(i);
		}*/
		
		FOR(i,0,N+Q+1) t[i]=0;
		FOR(i,0,N){
			ckmax(vec[i],i-get(a[i]));
			upd(a[i]);
		}

		FOR(i,0,N) ckmax(ans[idx],vec[i]);
	}
	return ans; 
}

Subtask #1
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 2252 KB Output is correct
2 Correct 37 ms 2380 KB Output is correct
3 Correct 187 ms 2508 KB Output is correct
4 Correct 189 ms 2508 KB Output is correct
5 Correct 197 ms 2540 KB Output is correct
6 Correct 185 ms 2540 KB Output is correct
7 Correct 197 ms 2508 KB Output is correct
8 Correct 185 ms 2508 KB Output is correct
9 Correct 186 ms 2552 KB Output is correct
10 Correct 181 ms 2528 KB Output is correct
11 Correct 188 ms 2508 KB Output is correct
12 Correct 189 ms 2528 KB Output is correct
13 Correct 198 ms 2512 KB Output is correct
14 Correct 186 ms 2512 KB Output is correct
15 Correct 194 ms 2508 KB Output is correct
16 Correct 185 ms 2508 KB Output is correct
17 Correct 186 ms 2628 KB Output is correct
18 Correct 186 ms 2508 KB Output is correct

Subtask #2
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 2252 KB Output is correct
2 Correct 37 ms 2380 KB Output is correct
3 Correct 187 ms 2508 KB Output is correct
4 Correct 189 ms 2508 KB Output is correct
5 Correct 197 ms 2540 KB Output is correct
6 Correct 185 ms 2540 KB Output is correct
7 Correct 197 ms 2508 KB Output is correct
8 Correct 185 ms 2508 KB Output is correct
9 Correct 186 ms 2552 KB Output is correct
10 Correct 181 ms 2528 KB Output is correct
11 Correct 188 ms 2508 KB Output is correct
12 Correct 189 ms 2528 KB Output is correct
13 Correct 198 ms 2512 KB Output is correct
14 Correct 186 ms 2512 KB Output is correct
15 Correct 194 ms 2508 KB Output is correct
16 Correct 185 ms 2508 KB Output is correct
17 Correct 186 ms 2628 KB Output is correct
18 Correct 186 ms 2508 KB Output is correct
19 Correct 2294 ms 3420 KB Output is correct
20 Correct 2967 ms 3440 KB Output is correct
21 Correct 2935 ms 3448 KB Output is correct
22 Correct 2959 ms 3524 KB Output is correct
23 Correct 2894 ms 3276 KB Output is correct
24 Correct 2839 ms 3352 KB Output is correct
25 Correct 2931 ms 3320 KB Output is correct
26 Correct 2786 ms 3312 KB Output is correct
27 Correct 2933 ms 3308 KB Output is correct
28 Correct 2855 ms 3276 KB Output is correct

Subtask #3
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2684 ms 2928 KB Output is correct
2 Execution timed out 9082 ms 3880 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #4
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 2252 KB Output is correct
2 Correct 37 ms 2380 KB Output is correct
3 Correct 187 ms 2508 KB Output is correct
4 Correct 189 ms 2508 KB Output is correct
5 Correct 197 ms 2540 KB Output is correct
6 Correct 185 ms 2540 KB Output is correct
7 Correct 197 ms 2508 KB Output is correct
8 Correct 185 ms 2508 KB Output is correct
9 Correct 186 ms 2552 KB Output is correct
10 Correct 181 ms 2528 KB Output is correct
11 Correct 188 ms 2508 KB Output is correct
12 Correct 189 ms 2528 KB Output is correct
13 Correct 198 ms 2512 KB Output is correct
14 Correct 186 ms 2512 KB Output is correct
15 Correct 194 ms 2508 KB Output is correct
16 Correct 185 ms 2508 KB Output is correct
17 Correct 186 ms 2628 KB Output is correct
18 Correct 186 ms 2508 KB Output is correct
19 Correct 2294 ms 3420 KB Output is correct
20 Correct 2967 ms 3440 KB Output is correct
21 Correct 2935 ms 3448 KB Output is correct
22 Correct 2959 ms 3524 KB Output is correct
23 Correct 2894 ms 3276 KB Output is correct
24 Correct 2839 ms 3352 KB Output is correct
25 Correct 2931 ms 3320 KB Output is correct
26 Correct 2786 ms 3312 KB Output is correct
27 Correct 2933 ms 3308 KB Output is correct
28 Correct 2855 ms 3276 KB Output is correct
29 Correct 2684 ms 2928 KB Output is correct
30 Execution timed out 9082 ms 3880 KB Time limit exceeded
31 Halted 0 ms 0 KB -