oj.uz

Submission #385634

# Submission time Handle Problem Language Result Execution time Memory
385634 2021-04-04T16:22:35 Z keta_tsimakuridze Bubble Sort 2 (JOI18_bubblesort2) C++14
60 / 100
 1758 ms 217140 KB 
#include<bits/stdc++.h>
#include "bubblesort2.h"
#define f first
#define s second
using namespace std;
const int N=5e5+5,mod=1e9+7;
int t,lazy[4*N],ind[N],b[N],a[N],n,q;
map<pair<int,int>,int>idx;
string s;
vector<pair<int,int> >p;
pair<int,int> tree[4*N];
vector<int>ans;
void update(int u,int start,int end,int l,int r,int type,int val){
	if(lazy[u]){
		tree[u].s+=lazy[u];
		if(l!=r){
			lazy[2*u]+=lazy[u];
			lazy[2*u+1]+=lazy[u];
		}
		lazy[u]=0;
	}
	if(l>end || r<start) return;
	if(start<=l && r<=end){
		if(type==1) {
			tree[u].f+=val;
			return;
		}
		tree[u].s+=val;
		lazy[u]=val;
		if(l!=r){
			lazy[2*u]+=lazy[u];
			lazy[2*u+1]+=lazy[u];
		}
		lazy[u]=0;
		return;
	}
	int mid=(l+r)/2;
	update(2*u,start,end,l,mid,type,val);
	update(2*u+1,start,end,mid+1,r,type,val);
	if(tree[2*u].f && tree[2*u+1].f) tree[u]={1,max(tree[2*u+1].s,tree[2*u].s)};
	else if(tree[2*u].f) tree[u]={1,tree[2*u].s};
	else if(tree[2*u+1].f) tree[u]={1,tree[2*u+1].s};
	else tree[u]={0,0};
}
vector<int> countScans(vector<int> A, vector<int> X, vector<int> V){
	// t=1;
	int n=A.size();
	int q=X.size();

	for(int i=1;i<=n;i++){
		a[i]=A[i-1]; 
		p.push_back({a[i],i});
	}
	for(int i=1;i<=q;i++){
		ind[i]=X[i-1];
		b[i]=V[i-1];
		ind[i]++;
		p.push_back({b[i],ind[i]});
	}
	sort(p.begin(),p.end());
	int cur=0;
	for(int i=0;i<p.size();i++){
		if(!i || p[i].f!=p[i-1].f || p[i].s!=p[i-1].s) cur++;
		idx[{p[i].f,p[i].s}] = cur;
	}
	for(int i=1;i<=n;i++){
		update(1,idx[{a[i],i}],idx[{a[i],i}],1,cur,1,1);
		update(1,idx[{a[i],i}],idx[{a[i],i}],1,cur,0,i-1);  
		update(1,idx[{a[i],i}]+1,cur,1,cur,0,-1);	
	}
	for(int i=1;i<=q;i++){
		if(a[ind[i]]<b[i]) {
			update(1,idx[{a[ind[i]],ind[i]}]+1,idx[{b[i],ind[i]}],1,cur,0,1);
			
		} 
		else {
			update(1,idx[{b[i],ind[i]}]+1,idx[{a[ind[i]],ind[i]}],1,cur,0,-1);
		}
		update(1,idx[{a[ind[i]],ind[i]}],idx[{a[ind[i]],ind[i]}],1,cur,1,-1);
		update(1,idx[{a[ind[i]],ind[i]}],idx[{a[ind[i]],ind[i]}],1,cur,0,-ind[i]+1);
		update(1,idx[{b[i],ind[i]}],idx[{b[i],ind[i]}],1,cur,0,ind[i]-1);
		update(1,idx[{b[i],ind[i]}],idx[{b[i],ind[i]}],1,cur,1,+1);
		a[ind[i]]=b[i];			
		ans.push_back(tree[1].s);
	}
	return ans;
}

Compilation message

bubblesort2.cpp: In function 'std::vector<int> countScans(std::vector<int>, std::vector<int>, std::vector<int>)':
bubblesort2.cpp:62:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   62 |  for(int i=0;i<p.size();i++){
      |              ~^~~~~~~~~

Subtask #1
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 492 KB Output is correct
2 Correct 5 ms 620 KB Output is correct
3 Correct 15 ms 876 KB Output is correct
4 Correct 13 ms 876 KB Output is correct
5 Correct 12 ms 876 KB Output is correct
6 Correct 11 ms 876 KB Output is correct
7 Correct 12 ms 920 KB Output is correct
8 Correct 11 ms 876 KB Output is correct
9 Correct 12 ms 876 KB Output is correct
10 Correct 12 ms 876 KB Output is correct
11 Correct 15 ms 876 KB Output is correct
12 Correct 11 ms 876 KB Output is correct
13 Correct 15 ms 876 KB Output is correct
14 Correct 10 ms 876 KB Output is correct
15 Correct 10 ms 876 KB Output is correct
16 Correct 10 ms 876 KB Output is correct
17 Correct 10 ms 876 KB Output is correct
18 Correct 10 ms 876 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 492 KB Output is correct
2 Correct 5 ms 620 KB Output is correct
3 Correct 15 ms 876 KB Output is correct
4 Correct 13 ms 876 KB Output is correct
5 Correct 12 ms 876 KB Output is correct
6 Correct 11 ms 876 KB Output is correct
7 Correct 12 ms 920 KB Output is correct
8 Correct 11 ms 876 KB Output is correct
9 Correct 12 ms 876 KB Output is correct
10 Correct 12 ms 876 KB Output is correct
11 Correct 15 ms 876 KB Output is correct
12 Correct 11 ms 876 KB Output is correct
13 Correct 15 ms 876 KB Output is correct
14 Correct 10 ms 876 KB Output is correct
15 Correct 10 ms 876 KB Output is correct
16 Correct 10 ms 876 KB Output is correct
17 Correct 10 ms 876 KB Output is correct
18 Correct 10 ms 876 KB Output is correct
19 Correct 43 ms 2204 KB Output is correct
20 Correct 63 ms 2540 KB Output is correct
21 Correct 48 ms 2540 KB Output is correct
22 Correct 53 ms 2540 KB Output is correct
23 Correct 48 ms 2284 KB Output is correct
24 Correct 46 ms 2284 KB Output is correct
25 Correct 46 ms 2284 KB Output is correct
26 Correct 45 ms 2284 KB Output is correct
27 Correct 43 ms 2156 KB Output is correct
28 Correct 43 ms 2156 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 72 ms 3560 KB Output is correct
2 Correct 259 ms 7652 KB Output is correct
3 Correct 449 ms 12628 KB Output is correct
4 Correct 475 ms 12640 KB Output is correct
5 Correct 446 ms 12584 KB Output is correct
6 Correct 444 ms 13152 KB Output is correct
7 Correct 443 ms 13024 KB Output is correct
8 Correct 443 ms 13132 KB Output is correct
9 Correct 463 ms 13152 KB Output is correct
10 Correct 305 ms 9056 KB Output is correct
11 Correct 318 ms 9056 KB Output is correct
12 Correct 300 ms 8928 KB Output is correct
13 Correct 297 ms 8928 KB Output is correct
14 Correct 300 ms 8968 KB Output is correct
15 Correct 288 ms 8928 KB Output is correct
16 Correct 300 ms 9044 KB Output is correct
17 Correct 294 ms 8928 KB Output is correct
18 Correct 284 ms 9056 KB Output is correct

Subtask #4
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 492 KB Output is correct
2 Correct 5 ms 620 KB Output is correct
3 Correct 15 ms 876 KB Output is correct
4 Correct 13 ms 876 KB Output is correct
5 Correct 12 ms 876 KB Output is correct
6 Correct 11 ms 876 KB Output is correct
7 Correct 12 ms 920 KB Output is correct
8 Correct 11 ms 876 KB Output is correct
9 Correct 12 ms 876 KB Output is correct
10 Correct 12 ms 876 KB Output is correct
11 Correct 15 ms 876 KB Output is correct
12 Correct 11 ms 876 KB Output is correct
13 Correct 15 ms 876 KB Output is correct
14 Correct 10 ms 876 KB Output is correct
15 Correct 10 ms 876 KB Output is correct
16 Correct 10 ms 876 KB Output is correct
17 Correct 10 ms 876 KB Output is correct
18 Correct 10 ms 876 KB Output is correct
19 Correct 43 ms 2204 KB Output is correct
20 Correct 63 ms 2540 KB Output is correct
21 Correct 48 ms 2540 KB Output is correct
22 Correct 53 ms 2540 KB Output is correct
23 Correct 48 ms 2284 KB Output is correct
24 Correct 46 ms 2284 KB Output is correct
25 Correct 46 ms 2284 KB Output is correct
26 Correct 45 ms 2284 KB Output is correct
27 Correct 43 ms 2156 KB Output is correct
28 Correct 43 ms 2156 KB Output is correct
29 Correct 72 ms 3560 KB Output is correct
30 Correct 259 ms 7652 KB Output is correct
31 Correct 449 ms 12628 KB Output is correct
32 Correct 475 ms 12640 KB Output is correct
33 Correct 446 ms 12584 KB Output is correct
34 Correct 444 ms 13152 KB Output is correct
35 Correct 443 ms 13024 KB Output is correct
36 Correct 443 ms 13132 KB Output is correct
37 Correct 463 ms 13152 KB Output is correct
38 Correct 305 ms 9056 KB Output is correct
39 Correct 318 ms 9056 KB Output is correct
40 Correct 300 ms 8928 KB Output is correct
41 Correct 297 ms 8928 KB Output is correct
42 Correct 300 ms 8968 KB Output is correct
43 Correct 288 ms 8928 KB Output is correct
44 Correct 300 ms 9044 KB Output is correct
45 Correct 294 ms 8928 KB Output is correct
46 Correct 284 ms 9056 KB Output is correct
47 Correct 1758 ms 44120 KB Output is correct
48 Runtime error 732 ms 217140 KB Execution killed with signal 11
49 Halted 0 ms 0 KB -