답안 #58928 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
58928	2018-07-19T20:31:10 Z	khohko	Bubble Sort 2 (JOI18_bubblesort2)	C++17	100 / 100	6615 ms	204384 KB

bubblesort2

#include<bits/stdc++.h>
#include "bubblesort2.h"
using namespace std;
#define ll int
#define fr first
#define sc second
#define pb push_back
#define ARRS ((ll)(1e6+100))
#define MAX ((ll)(1e9+100))

ll fw[ARRS+100];

void add(ll i,ll x){
	i=ARRS-i;
	while(i<=ARRS+10){
		fw[i]+=x;
		i+=i&-i;
	}
}

ll quer(ll i){
	i=ARRS-i;
	ll p=0;
	while(i>0){
		p+=fw[i];
		i-=i&-i;
	}
	return p;
}

ll wl,wr,wx,wi;

struct node{
	node *L,*R;
	int x,s;
	node(){
		L=R=NULL;
		s=0;
		x=-MAX;
	}
	void updt(){
		x=-MAX;
		if(L)x=max(x,L->x);
		if(R)x=max(x,R->x);
	}
	void shep(ll y){
		s+=y;
		x+=y;
	}
	void shplit(){
		if(!L)L=new node();
		if(!R)R=new node();
		L->shep(s);
		R->shep(s);
		s=0;
	}
};

void updt(ll l,ll r,node *& x){
	if(wr<l||r-1<wl)return;
	if(!x)x=new node();
	if(wl<=l&&r-1<=wr){
		x->shep(wx);
		return;
	}
	x->shplit();
	updt(l,l+r>>1,x->L);
	updt(l+r>>1,r,x->R);
	x->updt();
}

void updt1(ll l,ll r,node *& x){
	if(wr<l||r-1<wl)return;
	if(!x)x=new node();
	if(wl<=l&&r-1<=wr){
		x->x=wx;
		x->s=0;
		return;
	}
	x->shplit();
	updt1(l,l+r>>1,x->L);
	updt1(l+r>>1,r,x->R);
	x->updt();
}

set<ll> mp[ARRS];

node *rt=NULL;

void up(ll x){
	if(mp[x].size()){
		wl=wr=x;
		wx=-(*mp[x].begin())+quer(x+1);
//		cout<<wl<<" "<<wx<<" "<<x<<" "<<(-*mp[x].begin())<<endl;
		updt1(-MAX,MAX,rt);
	}
	else {
		wl=wr=x;
		wx=-MAX;
		updt1(-MAX,MAX,rt);
	}
}

ll a[ARRS],n;
map<ll,ll> em;

void quer(ll i,ll x){

	mp[a[i]].erase(n-i-1);
	mp[x].insert(n-i-1);

	add(a[i],-1);
	add(x,1);

	up(x);
	up(a[i]);
	if(a[i]<=x){
		wl=a[i]+1;
		wr=x-1;
		wx=1;
	}
	else {
		wl=x+1;
		wr=a[i]-1;
		wx=-1;
	}
	updt(-MAX,MAX,rt);
	a[i]=x;
}


vector<int> countScans(vector<int> A,vector<int> X,vector<int> V){
	n=A.size();
	ll q=X.size();
	vector<int> PAS;
	vector<int> b;
	for(auto x:A)
		b.pb(x);
	for(auto x:V)
		b.pb(x);
	sort(b.begin(),b.end());
	ll C=1;
	for(int i=0; i<b.size(); i++){
		if(b[i]!=b[i-1]||!i)
			em[b[i]]=C++;
	}
	for(auto &x:A)
		x=em[x];
	for(auto &x:V)
		x=em[x];

	for(int i=0; i<n; i++){
		a[i]=A[i];
//		cout<<a[i]<<" ";

		add(a[i],1);
	}
	for(int i=0; i<n; i++){
		mp[a[i]].insert(n-i-1);
		up(a[i]);
	}
	//cout<<" ----> "<<rt->x<<endl;

	for(int i=0; i<q; i++){
		ll k=X[i];
		ll p=V[i];
		quer(k,p);
		PAS.pb(rt->x);
	}

	return PAS;
}

Compilation message

bubblesort2.cpp: In function 'void updt(int, int, node*&)':
bubblesort2.cpp:67:10: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  updt(l,l+r>>1,x->L);
         ~^~
bubblesort2.cpp:68:8: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  updt(l+r>>1,r,x->R);
       ~^~
bubblesort2.cpp: In function 'void updt1(int, int, node*&)':
bubblesort2.cpp:81:11: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  updt1(l,l+r>>1,x->L);
          ~^~
bubblesort2.cpp:82:9: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  updt1(l+r>>1,r,x->R);
        ~^~
bubblesort2.cpp: In function 'std::vector<int> countScans(std::vector<int>, std::vector<int>, std::vector<int>)':
bubblesort2.cpp:143:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0; i<b.size(); i++){
               ~^~~~~~~~~

Subtask #1
17.0 / 17.0

#	결과	실행 시간	메모리	Grader output
1	Correct	47 ms	47480 KB	Output is correct
2	Correct	54 ms	47648 KB	Output is correct
3	Correct	57 ms	48052 KB	Output is correct
4	Correct	50 ms	48128 KB	Output is correct
5	Correct	50 ms	48144 KB	Output is correct
6	Correct	55 ms	48216 KB	Output is correct
7	Correct	47 ms	48216 KB	Output is correct
8	Correct	51 ms	48216 KB	Output is correct
9	Correct	51 ms	48232 KB	Output is correct
10	Correct	49 ms	48232 KB	Output is correct
11	Correct	56 ms	48232 KB	Output is correct
12	Correct	49 ms	48232 KB	Output is correct
13	Correct	50 ms	48232 KB	Output is correct
14	Correct	48 ms	48232 KB	Output is correct
15	Correct	57 ms	48232 KB	Output is correct
16	Correct	48 ms	48232 KB	Output is correct
17	Correct	49 ms	48232 KB	Output is correct
18	Correct	49 ms	48232 KB	Output is correct

Subtask #2
21.0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	47 ms	47480 KB	Output is correct
2	Correct	54 ms	47648 KB	Output is correct
3	Correct	57 ms	48052 KB	Output is correct
4	Correct	50 ms	48128 KB	Output is correct
5	Correct	50 ms	48144 KB	Output is correct
6	Correct	55 ms	48216 KB	Output is correct
7	Correct	47 ms	48216 KB	Output is correct
8	Correct	51 ms	48216 KB	Output is correct
9	Correct	51 ms	48232 KB	Output is correct
10	Correct	49 ms	48232 KB	Output is correct
11	Correct	56 ms	48232 KB	Output is correct
12	Correct	49 ms	48232 KB	Output is correct
13	Correct	50 ms	48232 KB	Output is correct
14	Correct	48 ms	48232 KB	Output is correct
15	Correct	57 ms	48232 KB	Output is correct
16	Correct	48 ms	48232 KB	Output is correct
17	Correct	49 ms	48232 KB	Output is correct
18	Correct	49 ms	48232 KB	Output is correct
19	Correct	97 ms	49932 KB	Output is correct
20	Correct	101 ms	50104 KB	Output is correct
21	Correct	79 ms	50104 KB	Output is correct
22	Correct	79 ms	50104 KB	Output is correct
23	Correct	73 ms	50104 KB	Output is correct
24	Correct	88 ms	50104 KB	Output is correct
25	Correct	107 ms	50104 KB	Output is correct
26	Correct	92 ms	50104 KB	Output is correct
27	Correct	87 ms	50104 KB	Output is correct
28	Correct	108 ms	50104 KB	Output is correct

Subtask #3
22.0 / 22.0

#	결과	실행 시간	메모리	Grader output
1	Correct	105 ms	50104 KB	Output is correct
2	Correct	174 ms	50872 KB	Output is correct
3	Correct	300 ms	52348 KB	Output is correct
4	Correct	302 ms	52348 KB	Output is correct
5	Correct	309 ms	52348 KB	Output is correct
6	Correct	317 ms	52380 KB	Output is correct
7	Correct	369 ms	52380 KB	Output is correct
8	Correct	274 ms	52380 KB	Output is correct
9	Correct	287 ms	52380 KB	Output is correct
10	Correct	234 ms	52380 KB	Output is correct
11	Correct	231 ms	52380 KB	Output is correct
12	Correct	227 ms	52380 KB	Output is correct
13	Correct	224 ms	52380 KB	Output is correct
14	Correct	227 ms	52380 KB	Output is correct
15	Correct	207 ms	52380 KB	Output is correct
16	Correct	192 ms	52380 KB	Output is correct
17	Correct	207 ms	52380 KB	Output is correct
18	Correct	198 ms	52380 KB	Output is correct

Subtask #4
40.0 / 40.0

#	결과	실행 시간	메모리	Grader output
1	Correct	47 ms	47480 KB	Output is correct
2	Correct	54 ms	47648 KB	Output is correct
3	Correct	57 ms	48052 KB	Output is correct
4	Correct	50 ms	48128 KB	Output is correct
5	Correct	50 ms	48144 KB	Output is correct
6	Correct	55 ms	48216 KB	Output is correct
7	Correct	47 ms	48216 KB	Output is correct
8	Correct	51 ms	48216 KB	Output is correct
9	Correct	51 ms	48232 KB	Output is correct
10	Correct	49 ms	48232 KB	Output is correct
11	Correct	56 ms	48232 KB	Output is correct
12	Correct	49 ms	48232 KB	Output is correct
13	Correct	50 ms	48232 KB	Output is correct
14	Correct	48 ms	48232 KB	Output is correct
15	Correct	57 ms	48232 KB	Output is correct
16	Correct	48 ms	48232 KB	Output is correct
17	Correct	49 ms	48232 KB	Output is correct
18	Correct	49 ms	48232 KB	Output is correct
19	Correct	97 ms	49932 KB	Output is correct
20	Correct	101 ms	50104 KB	Output is correct
21	Correct	79 ms	50104 KB	Output is correct
22	Correct	79 ms	50104 KB	Output is correct
23	Correct	73 ms	50104 KB	Output is correct
24	Correct	88 ms	50104 KB	Output is correct
25	Correct	107 ms	50104 KB	Output is correct
26	Correct	92 ms	50104 KB	Output is correct
27	Correct	87 ms	50104 KB	Output is correct
28	Correct	108 ms	50104 KB	Output is correct
29	Correct	105 ms	50104 KB	Output is correct
30	Correct	174 ms	50872 KB	Output is correct
31	Correct	300 ms	52348 KB	Output is correct
32	Correct	302 ms	52348 KB	Output is correct
33	Correct	309 ms	52348 KB	Output is correct
34	Correct	317 ms	52380 KB	Output is correct
35	Correct	369 ms	52380 KB	Output is correct
36	Correct	274 ms	52380 KB	Output is correct
37	Correct	287 ms	52380 KB	Output is correct
38	Correct	234 ms	52380 KB	Output is correct
39	Correct	231 ms	52380 KB	Output is correct
40	Correct	227 ms	52380 KB	Output is correct
41	Correct	224 ms	52380 KB	Output is correct
42	Correct	227 ms	52380 KB	Output is correct
43	Correct	207 ms	52380 KB	Output is correct
44	Correct	192 ms	52380 KB	Output is correct
45	Correct	207 ms	52380 KB	Output is correct
46	Correct	198 ms	52380 KB	Output is correct
47	Correct	1570 ms	95160 KB	Output is correct
48	Correct	5770 ms	189520 KB	Output is correct
49	Correct	6492 ms	204384 KB	Output is correct
50	Correct	5849 ms	204384 KB	Output is correct
51	Correct	5894 ms	204384 KB	Output is correct
52	Correct	6195 ms	204384 KB	Output is correct
53	Correct	6047 ms	204384 KB	Output is correct
54	Correct	5661 ms	204384 KB	Output is correct
55	Correct	6615 ms	204384 KB	Output is correct
56	Correct	5832 ms	204384 KB	Output is correct
57	Correct	5221 ms	204384 KB	Output is correct
58	Correct	4781 ms	204384 KB	Output is correct
59	Correct	4845 ms	204384 KB	Output is correct
60	Correct	4481 ms	204384 KB	Output is correct
61	Correct	4683 ms	204384 KB	Output is correct
62	Correct	4397 ms	204384 KB	Output is correct
63	Correct	4784 ms	204384 KB	Output is correct
64	Correct	4430 ms	204384 KB	Output is correct
65	Correct	4005 ms	204384 KB	Output is correct
66	Correct	4407 ms	204384 KB	Output is correct
67	Correct	4127 ms	204384 KB	Output is correct

답안 #58928

Compilation message

Subtask #1 17.0 / 17.0

Subtask #2 21.0 / 21.0

Subtask #3 22.0 / 22.0

Subtask #4 40.0 / 40.0

Subtask #1
17.0 / 17.0

Subtask #2
21.0 / 21.0

Subtask #3
22.0 / 22.0

Subtask #4
40.0 / 40.0