oj.uz

답안 #408777

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
408777 2021-05-19T15:48:49 Z AmineWeslati Bubble Sort 2 (JOI18_bubblesort2) C++14
0 / 100
 2547 ms 3448 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 aa; 

const int MX=5e5+10;

void ckmax(int &x, int y){x=max(x,y);}


vi t(MX,0);
void upd(int idx){
	int i=idx; 
	for(;i<=N; i+=i&-i){
		t[i]++;
	}
}

int get(int idx){
	int i=idx; 
	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);
	aa.assign(all(A));

	vi temp;
	temp.assign(all(aa));
	sort(all(temp));

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

	vi a(N);
	FOR(i,0,N) a[i]=mp[aa[i]];

	vi ans(Q);
	FOR(idx,0,Q){
		aa[X[idx]]=V[idx];

		if(!mp.count(V[idx])) FOR(i,0,N) if(aa[i]>V[idx]) 
			a[i]++;
		

		vi st,vec(N);
		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);
		}
		
		t.assign(N+1,0);
		FOR(i,0,N){
			ckmax(vec[i],i-get(a[i]));
			upd(a[i]);
		}

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

	}
	return ans; 
}

/*

4 2
1 2 3 4
0 3
2 1

*/

Subtask #1
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 14 ms 2252 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 14 ms 2252 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2547 ms 3448 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 14 ms 2252 KB Output isn't correct
2 Halted 0 ms 0 KB -