답안 #75253 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
75253	2018-09-09T02:59:45 Z	jangwonyoung	자리 배치 (IOI18_seats)	C++14	100 / 100	3606 ms	61084 KB

seats

#include "seats.h"
#include<iostream>
#include<algorithm>
using namespace std;
int n,m,k;
int posx[1000001],posy[1000001];
int num[4000001];
int minv[2097152],minc[2097152];
int lazy[2097152];
int a[5];
inline void build(int id,int l,int r){
	minc[id]=r-l+1;
	if(l==r) return;
	int mid=(l+r)/2;
	build(id*2,l,mid);
	build(id*2+1,mid+1,r);
}
inline void supd(int id,int l,int r,int ll,int rr,int v){
	if(l>rr || r<ll) return;
	if(ll<=l && r<=rr){
		lazy[id]+=v;
		minv[id]+=v;
		return;
	}
	int mid=(l+r)/2;
	supd(id*2,l,mid,ll,rr,v);
	supd(id*2+1,mid+1,r,ll,rr,v);
	if(minv[id*2]<minv[id*2+1]) minv[id]=minv[id*2],minc[id]=minc[id*2];
	else if(minv[id*2]>minv[id*2+1]) minv[id]=minv[id*2+1],minc[id]=minc[id*2+1];
	else minv[id]=minv[id*2],minc[id]=minc[id*2]+minc[id*2+1];
	minv[id]+=lazy[id];
}
int get(int x,int y){
	if(x<0 || x>=n || y<0 || y>=m) return n*m;
	else return num[x*m+y];
}
inline void upd(int x,int y,int v){
	a[0]=num[x*m+y];
	a[1]=num[x*m+y-1];
	a[2]=num[x*m+y-m];
	a[3]=num[x*m+y-m-1];
	sort(a,a+4);
	//cout << "UPD " << x << ' ' << y << ' ' << a[1] << ' ' << a[2] << ' ' << a[3] << ' ' << a[4] << ' ' << v << endl;;
	if(a[0]<a[1]) supd(1,0,k-1,a[0],a[1]-1,v);
	if(a[2]<a[3]) supd(1,0,k-1,a[2],a[3]-1,v);
}
inline void change(int x,int y,int v){
 	upd(x,y,-1);
 	upd(x+1,y,-1);
 	upd(x,y+1,-1);
 	upd(x+1,y+1,-1);
	num[x*m+y]=v;
	upd(x,y,1);
 	upd(x+1,y,1);
 	upd(x,y+1,1);
 	upd(x+1,y+1,1);
}
void give_initial_chart(int H, int W, std::vector<int> R, std::vector<int> C) {
	n=H;
	m=W;
	k=n*m;
	n+=2;
	m+=2;
	for(int i=0; i<n ;i++)
		for(int j=0; j<m ;j++)
			num[i*m+j]=k;
	build(1,0,k-1);
	for(int i=0; i<k ;i++){
		R[i]++;
		C[i]++;
		posx[i]=R[i];
		posy[i]=C[i];
		num[posx[i]*m+posy[i]]=i;
	}
	for(int i=1; i<n ;i++)
		for(int j=1; j<m ;j++)
			upd(i,j,1);
}

int swap_seats(int a, int b) {
	change(posx[a],posy[a],b);
	change(posx[b],posy[b],a);
	swap(posx[a],posx[b]);
	swap(posy[a],posy[b]);
	return minc[1];//minv must be 4
}

Subtask #1
5.0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	15 ms	504 KB	Output is correct
2	Correct	21 ms	508 KB	Output is correct
3	Correct	31 ms	696 KB	Output is correct
4	Correct	18 ms	696 KB	Output is correct
5	Correct	17 ms	832 KB	Output is correct
6	Correct	26 ms	832 KB	Output is correct
7	Correct	29 ms	832 KB	Output is correct
8	Correct	27 ms	832 KB	Output is correct
9	Correct	28 ms	832 KB	Output is correct
10	Correct	35 ms	832 KB	Output is correct
11	Correct	26 ms	832 KB	Output is correct
12	Correct	18 ms	832 KB	Output is correct

Subtask #2
6.0 / 6.0

#	결과	실행 시간	메모리	Grader output
1	Correct	15 ms	504 KB	Output is correct
2	Correct	21 ms	508 KB	Output is correct
3	Correct	31 ms	696 KB	Output is correct
4	Correct	18 ms	696 KB	Output is correct
5	Correct	17 ms	832 KB	Output is correct
6	Correct	26 ms	832 KB	Output is correct
7	Correct	29 ms	832 KB	Output is correct
8	Correct	27 ms	832 KB	Output is correct
9	Correct	28 ms	832 KB	Output is correct
10	Correct	35 ms	832 KB	Output is correct
11	Correct	26 ms	832 KB	Output is correct
12	Correct	18 ms	832 KB	Output is correct
13	Correct	71 ms	1392 KB	Output is correct
14	Correct	81 ms	1404 KB	Output is correct
15	Correct	47 ms	1564 KB	Output is correct
16	Correct	35 ms	1564 KB	Output is correct
17	Correct	60 ms	1564 KB	Output is correct
18	Correct	56 ms	1564 KB	Output is correct
19	Correct	55 ms	1564 KB	Output is correct
20	Correct	48 ms	1564 KB	Output is correct
21	Correct	35 ms	1596 KB	Output is correct
22	Correct	35 ms	1596 KB	Output is correct

Subtask #3
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2603 ms	52688 KB	Output is correct
2	Correct	1267 ms	52776 KB	Output is correct
3	Correct	1260 ms	52836 KB	Output is correct
4	Correct	984 ms	52924 KB	Output is correct
5	Correct	1068 ms	52924 KB	Output is correct
6	Correct	956 ms	52924 KB	Output is correct
7	Correct	1092 ms	52924 KB	Output is correct
8	Correct	1148 ms	52924 KB	Output is correct
9	Correct	1166 ms	52924 KB	Output is correct
10	Correct	1121 ms	52924 KB	Output is correct

Subtask #4
6.0 / 6.0

#	결과	실행 시간	메모리	Grader output
1	Correct	66 ms	52924 KB	Output is correct
2	Correct	170 ms	52924 KB	Output is correct
3	Correct	1032 ms	52924 KB	Output is correct
4	Correct	2382 ms	52924 KB	Output is correct
5	Correct	880 ms	58556 KB	Output is correct
6	Correct	2067 ms	60604 KB	Output is correct
7	Correct	1020 ms	60604 KB	Output is correct
8	Correct	1211 ms	60604 KB	Output is correct
9	Correct	1161 ms	60604 KB	Output is correct
10	Correct	1069 ms	60604 KB	Output is correct
11	Correct	945 ms	60604 KB	Output is correct

Subtask #5
33.0 / 33.0

#	결과	실행 시간	메모리	Grader output
1	Correct	45 ms	60604 KB	Output is correct
2	Correct	92 ms	60604 KB	Output is correct
3	Correct	151 ms	60604 KB	Output is correct
4	Correct	243 ms	60604 KB	Output is correct
5	Correct	340 ms	60604 KB	Output is correct
6	Correct	1397 ms	60604 KB	Output is correct
7	Correct	1664 ms	60880 KB	Output is correct
8	Correct	1330 ms	60880 KB	Output is correct
9	Correct	3090 ms	61084 KB	Output is correct
10	Correct	1363 ms	61084 KB	Output is correct
11	Correct	1327 ms	61084 KB	Output is correct
12	Correct	1246 ms	61084 KB	Output is correct

Subtask #6
30.0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	15 ms	504 KB	Output is correct
2	Correct	21 ms	508 KB	Output is correct
3	Correct	31 ms	696 KB	Output is correct
4	Correct	18 ms	696 KB	Output is correct
5	Correct	17 ms	832 KB	Output is correct
6	Correct	26 ms	832 KB	Output is correct
7	Correct	29 ms	832 KB	Output is correct
8	Correct	27 ms	832 KB	Output is correct
9	Correct	28 ms	832 KB	Output is correct
10	Correct	35 ms	832 KB	Output is correct
11	Correct	26 ms	832 KB	Output is correct
12	Correct	18 ms	832 KB	Output is correct
13	Correct	71 ms	1392 KB	Output is correct
14	Correct	81 ms	1404 KB	Output is correct
15	Correct	47 ms	1564 KB	Output is correct
16	Correct	35 ms	1564 KB	Output is correct
17	Correct	60 ms	1564 KB	Output is correct
18	Correct	56 ms	1564 KB	Output is correct
19	Correct	55 ms	1564 KB	Output is correct
20	Correct	48 ms	1564 KB	Output is correct
21	Correct	35 ms	1596 KB	Output is correct
22	Correct	35 ms	1596 KB	Output is correct
23	Correct	2603 ms	52688 KB	Output is correct
24	Correct	1267 ms	52776 KB	Output is correct
25	Correct	1260 ms	52836 KB	Output is correct
26	Correct	984 ms	52924 KB	Output is correct
27	Correct	1068 ms	52924 KB	Output is correct
28	Correct	956 ms	52924 KB	Output is correct
29	Correct	1092 ms	52924 KB	Output is correct
30	Correct	1148 ms	52924 KB	Output is correct
31	Correct	1166 ms	52924 KB	Output is correct
32	Correct	1121 ms	52924 KB	Output is correct
33	Correct	66 ms	52924 KB	Output is correct
34	Correct	170 ms	52924 KB	Output is correct
35	Correct	1032 ms	52924 KB	Output is correct
36	Correct	2382 ms	52924 KB	Output is correct
37	Correct	880 ms	58556 KB	Output is correct
38	Correct	2067 ms	60604 KB	Output is correct
39	Correct	1020 ms	60604 KB	Output is correct
40	Correct	1211 ms	60604 KB	Output is correct
41	Correct	1161 ms	60604 KB	Output is correct
42	Correct	1069 ms	60604 KB	Output is correct
43	Correct	945 ms	60604 KB	Output is correct
44	Correct	45 ms	60604 KB	Output is correct
45	Correct	92 ms	60604 KB	Output is correct
46	Correct	151 ms	60604 KB	Output is correct
47	Correct	243 ms	60604 KB	Output is correct
48	Correct	340 ms	60604 KB	Output is correct
49	Correct	1397 ms	60604 KB	Output is correct
50	Correct	1664 ms	60880 KB	Output is correct
51	Correct	1330 ms	60880 KB	Output is correct
52	Correct	3090 ms	61084 KB	Output is correct
53	Correct	1363 ms	61084 KB	Output is correct
54	Correct	1327 ms	61084 KB	Output is correct
55	Correct	1246 ms	61084 KB	Output is correct
56	Correct	115 ms	61084 KB	Output is correct
57	Correct	292 ms	61084 KB	Output is correct
58	Correct	534 ms	61084 KB	Output is correct
59	Correct	1888 ms	61084 KB	Output is correct
60	Correct	3606 ms	61084 KB	Output is correct
61	Correct	1899 ms	61084 KB	Output is correct
62	Correct	1452 ms	61084 KB	Output is correct
63	Correct	3359 ms	61084 KB	Output is correct
64	Correct	2194 ms	61084 KB	Output is correct
65	Correct	2160 ms	61084 KB	Output is correct
66	Correct	2092 ms	61084 KB	Output is correct
67	Correct	2067 ms	61084 KB	Output is correct
68	Correct	1661 ms	61084 KB	Output is correct
69	Correct	3073 ms	61084 KB	Output is correct

답안 #75253

Compilation message

Subtask #1 5.0 / 5.0

Subtask #2 6.0 / 6.0

Subtask #3 20.0 / 20.0

Subtask #4 6.0 / 6.0

Subtask #5 33.0 / 33.0

Subtask #6 30.0 / 30.0

Subtask #1
5.0 / 5.0

Subtask #2
6.0 / 6.0

Subtask #3
20.0 / 20.0

Subtask #4
6.0 / 6.0

Subtask #5
33.0 / 33.0

Subtask #6
30.0 / 30.0