oj.uz

답안 #284031

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
284031 2020-08-26T14:01:04 Z AMnu Bubble Sort 2 (JOI18_bubblesort2) C++14
38 / 100
 9000 ms 3328 KB 
#include "bubblesort2.h"
#include <bits/stdc++.h>
#define pii pair<int,int>
#define i1 first
#define i2 second
using namespace std;

const int INF=1e6+5;

int N, Q;
int T[INF];
int C[INF];
vector<int> H;
vector<pii> S;

void build(int x,int y) {
	for (int i=x;i<=y;i++) {
		T[i]=-INF;
		C[i]=0;
	}
}

void update(int x,int y) {
	for (int i=x;i<N+Q;i++) {
		T[i]+=y;
	}
}

int query(int x) {
	int ret=0;
	
	for (int i=0;i<=x;i++) {
		ret+=C[i];
	}
	
	return ret;
}

int ans() {
	int ret=-INF;
	
	for (int i=0;i<N+Q;i++) {
		ret=max(ret,T[i]);
	}
	
	return ret;
}

void del(pii x) {
	int y=lower_bound(S.begin(),S.end(),x)-S.begin();
	T[y]=-INF;
	C[y]=0;
	update(y+1,1);
}

void add(pii x) {
	int y=lower_bound(S.begin(),S.end(),x)-S.begin();
	T[y]=x.i2-query(y-1);
	C[y]=1;
	update(y+1,-1);
}

vector<int> countScans(vector<int> A,vector<int> X,vector<int> V){
	N=A.size();
	Q=X.size();
	H=vector<int>(Q);
	S=vector<pii>(N+Q);
	
	for (int i=0;i<N;i++) {
		S[i]={A[i],i};
	}
	
	for (int i=0;i<Q;i++) {
		S[i+N]={V[i],X[i]};
	}
	
	sort(S.begin(),S.end());
	build(0,N+Q-1);
	
	for (int i=0;i<N;i++) {
		add({A[i],i});
	}
	
	for (int i=0;i<Q;i++) {
		del({A[X[i]],X[i]});
		A[X[i]]=V[i];
		add({A[X[i]],X[i]});
		H[i]=ans();
	}
	
	return H;
}

Subtask #1
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 22 ms 504 KB Output is correct
4 Correct 22 ms 512 KB Output is correct
5 Correct 23 ms 504 KB Output is correct
6 Correct 21 ms 512 KB Output is correct
7 Correct 30 ms 512 KB Output is correct
8 Correct 23 ms 512 KB Output is correct
9 Correct 22 ms 512 KB Output is correct
10 Correct 21 ms 512 KB Output is correct
11 Correct 21 ms 512 KB Output is correct
12 Correct 22 ms 512 KB Output is correct
13 Correct 22 ms 504 KB Output is correct
14 Correct 24 ms 512 KB Output is correct
15 Correct 22 ms 512 KB Output is correct
16 Correct 23 ms 512 KB Output is correct
17 Correct 22 ms 512 KB Output is correct
18 Correct 22 ms 512 KB Output is correct

Subtask #2
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 22 ms 504 KB Output is correct
4 Correct 22 ms 512 KB Output is correct
5 Correct 23 ms 504 KB Output is correct
6 Correct 21 ms 512 KB Output is correct
7 Correct 30 ms 512 KB Output is correct
8 Correct 23 ms 512 KB Output is correct
9 Correct 22 ms 512 KB Output is correct
10 Correct 21 ms 512 KB Output is correct
11 Correct 21 ms 512 KB Output is correct
12 Correct 22 ms 512 KB Output is correct
13 Correct 22 ms 504 KB Output is correct
14 Correct 24 ms 512 KB Output is correct
15 Correct 22 ms 512 KB Output is correct
16 Correct 23 ms 512 KB Output is correct
17 Correct 22 ms 512 KB Output is correct
18 Correct 22 ms 512 KB Output is correct
19 Correct 269 ms 888 KB Output is correct
20 Correct 331 ms 888 KB Output is correct
21 Correct 316 ms 888 KB Output is correct
22 Correct 330 ms 1016 KB Output is correct
23 Correct 319 ms 888 KB Output is correct
24 Correct 311 ms 888 KB Output is correct
25 Correct 311 ms 888 KB Output is correct
26 Correct 314 ms 852 KB Output is correct
27 Correct 315 ms 1016 KB Output is correct
28 Correct 318 ms 888 KB Output is correct

Subtask #3
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 545 ms 1116 KB Output is correct
2 Correct 4389 ms 2188 KB Output is correct
3 Execution timed out 9005 ms 3328 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #4
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 22 ms 504 KB Output is correct
4 Correct 22 ms 512 KB Output is correct
5 Correct 23 ms 504 KB Output is correct
6 Correct 21 ms 512 KB Output is correct
7 Correct 30 ms 512 KB Output is correct
8 Correct 23 ms 512 KB Output is correct
9 Correct 22 ms 512 KB Output is correct
10 Correct 21 ms 512 KB Output is correct
11 Correct 21 ms 512 KB Output is correct
12 Correct 22 ms 512 KB Output is correct
13 Correct 22 ms 504 KB Output is correct
14 Correct 24 ms 512 KB Output is correct
15 Correct 22 ms 512 KB Output is correct
16 Correct 23 ms 512 KB Output is correct
17 Correct 22 ms 512 KB Output is correct
18 Correct 22 ms 512 KB Output is correct
19 Correct 269 ms 888 KB Output is correct
20 Correct 331 ms 888 KB Output is correct
21 Correct 316 ms 888 KB Output is correct
22 Correct 330 ms 1016 KB Output is correct
23 Correct 319 ms 888 KB Output is correct
24 Correct 311 ms 888 KB Output is correct
25 Correct 311 ms 888 KB Output is correct
26 Correct 314 ms 852 KB Output is correct
27 Correct 315 ms 1016 KB Output is correct
28 Correct 318 ms 888 KB Output is correct
29 Correct 545 ms 1116 KB Output is correct
30 Correct 4389 ms 2188 KB Output is correct
31 Execution timed out 9005 ms 3328 KB Time limit exceeded
32 Halted 0 ms 0 KB -