답안 #75250 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
75250	2018-09-09T02:41:04 Z	jangwonyoung	자리 배치 (IOI18_seats)	C++14	100 / 100	3966 ms	53308 KB

seats

#include "seats.h"
#include<iostream>
#include<algorithm>
using namespace std;
int n,m,k;
int posx[1000001],posy[1000001];
int num[1000001];
int minv[2097152],minc[2097152];
int lazy[2097152];
int a[5];
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);
}
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);
	minv[id]=min(minv[id*2],minv[id*2+1]);
	minc[id]=0;
	if(minv[id]==minv[id*2]) minc[id]+=minc[id*2];
	if(minv[id]==minv[id*2+1]) minc[id]+=minc[id*2+1];
	minv[id]+=lazy[id];
	return;
}
int get(int x,int y){
	if(x<0 || x>=n || y<0 || y>=m) return n*m;
	else return num[x*m+y];
}
void upd(int x,int y,int v){
	for(int i=0; i<2 ;i++)
		for(int j=0; j<2 ;j++)
			if(x-i<0 || x-i>=n || y-j<0 || y-j>=m) a[i+i+j]=k;
			else a[i+i+j]=num[(x-i)*m+y-j];
	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);
}
void change(int x,int y,int v){
 	for(int i=0; i<2 ;i++)
		for(int j=0; j<2 ;j++)
			upd(x+i,y+j,-1);
	num[x*m+y]=v;
	for(int i=0; i<2 ;i++)
		for(int j=0; j<2 ;j++)
			upd(x+i,y+j,1);
}
void give_initial_chart(int H, int W, std::vector<int> R, std::vector<int> C) {
	n=H;
	m=W;
	k=n*m;
	build(1,0,k-1);
	for(int i=0; i<k ;i++){
		posx[i]=R[i];
		posy[i]=C[i];
		num[posx[i]*m+posy[i]]=i;
	}
	for(int i=0; i<=n ;i++)
		for(int j=0; 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	18 ms	504 KB	Output is correct
2	Correct	32 ms	636 KB	Output is correct
3	Correct	35 ms	636 KB	Output is correct
4	Correct	22 ms	680 KB	Output is correct
5	Correct	19 ms	716 KB	Output is correct
6	Correct	31 ms	772 KB	Output is correct
7	Correct	34 ms	772 KB	Output is correct
8	Correct	33 ms	784 KB	Output is correct
9	Correct	32 ms	912 KB	Output is correct
10	Correct	36 ms	912 KB	Output is correct
11	Correct	29 ms	912 KB	Output is correct
12	Correct	19 ms	912 KB	Output is correct

Subtask #2
6.0 / 6.0

#	결과	실행 시간	메모리	Grader output
1	Correct	18 ms	504 KB	Output is correct
2	Correct	32 ms	636 KB	Output is correct
3	Correct	35 ms	636 KB	Output is correct
4	Correct	22 ms	680 KB	Output is correct
5	Correct	19 ms	716 KB	Output is correct
6	Correct	31 ms	772 KB	Output is correct
7	Correct	34 ms	772 KB	Output is correct
8	Correct	33 ms	784 KB	Output is correct
9	Correct	32 ms	912 KB	Output is correct
10	Correct	36 ms	912 KB	Output is correct
11	Correct	29 ms	912 KB	Output is correct
12	Correct	19 ms	912 KB	Output is correct
13	Correct	80 ms	1312 KB	Output is correct
14	Correct	92 ms	1440 KB	Output is correct
15	Correct	54 ms	1440 KB	Output is correct
16	Correct	41 ms	1440 KB	Output is correct
17	Correct	73 ms	1440 KB	Output is correct
18	Correct	65 ms	1440 KB	Output is correct
19	Correct	67 ms	1440 KB	Output is correct
20	Correct	48 ms	1528 KB	Output is correct
21	Correct	41 ms	1528 KB	Output is correct
22	Correct	41 ms	1528 KB	Output is correct

Subtask #3
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2539 ms	52780 KB	Output is correct
2	Correct	1332 ms	52780 KB	Output is correct
3	Correct	1336 ms	52904 KB	Output is correct
4	Correct	1091 ms	52904 KB	Output is correct
5	Correct	1179 ms	52904 KB	Output is correct
6	Correct	1202 ms	52904 KB	Output is correct
7	Correct	1240 ms	52904 KB	Output is correct
8	Correct	1321 ms	52904 KB	Output is correct
9	Correct	1284 ms	52904 KB	Output is correct
10	Correct	1277 ms	52924 KB	Output is correct

Subtask #4
6.0 / 6.0

#	결과	실행 시간	메모리	Grader output
1	Correct	82 ms	52924 KB	Output is correct
2	Correct	194 ms	52924 KB	Output is correct
3	Correct	1162 ms	52924 KB	Output is correct
4	Correct	2865 ms	52924 KB	Output is correct
5	Correct	1053 ms	52924 KB	Output is correct
6	Correct	2274 ms	52924 KB	Output is correct
7	Correct	1094 ms	52924 KB	Output is correct
8	Correct	1296 ms	52924 KB	Output is correct
9	Correct	1316 ms	52924 KB	Output is correct
10	Correct	1204 ms	52924 KB	Output is correct
11	Correct	1103 ms	52924 KB	Output is correct

Subtask #5
33.0 / 33.0

#	결과	실행 시간	메모리	Grader output
1	Correct	54 ms	52924 KB	Output is correct
2	Correct	112 ms	52924 KB	Output is correct
3	Correct	182 ms	52924 KB	Output is correct
4	Correct	252 ms	52924 KB	Output is correct
5	Correct	382 ms	52924 KB	Output is correct
6	Correct	1522 ms	52924 KB	Output is correct
7	Correct	1861 ms	53076 KB	Output is correct
8	Correct	1544 ms	53076 KB	Output is correct
9	Correct	3131 ms	53308 KB	Output is correct
10	Correct	1514 ms	53308 KB	Output is correct
11	Correct	1558 ms	53308 KB	Output is correct
12	Correct	1431 ms	53308 KB	Output is correct

Subtask #6
30.0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	18 ms	504 KB	Output is correct
2	Correct	32 ms	636 KB	Output is correct
3	Correct	35 ms	636 KB	Output is correct
4	Correct	22 ms	680 KB	Output is correct
5	Correct	19 ms	716 KB	Output is correct
6	Correct	31 ms	772 KB	Output is correct
7	Correct	34 ms	772 KB	Output is correct
8	Correct	33 ms	784 KB	Output is correct
9	Correct	32 ms	912 KB	Output is correct
10	Correct	36 ms	912 KB	Output is correct
11	Correct	29 ms	912 KB	Output is correct
12	Correct	19 ms	912 KB	Output is correct
13	Correct	80 ms	1312 KB	Output is correct
14	Correct	92 ms	1440 KB	Output is correct
15	Correct	54 ms	1440 KB	Output is correct
16	Correct	41 ms	1440 KB	Output is correct
17	Correct	73 ms	1440 KB	Output is correct
18	Correct	65 ms	1440 KB	Output is correct
19	Correct	67 ms	1440 KB	Output is correct
20	Correct	48 ms	1528 KB	Output is correct
21	Correct	41 ms	1528 KB	Output is correct
22	Correct	41 ms	1528 KB	Output is correct
23	Correct	2539 ms	52780 KB	Output is correct
24	Correct	1332 ms	52780 KB	Output is correct
25	Correct	1336 ms	52904 KB	Output is correct
26	Correct	1091 ms	52904 KB	Output is correct
27	Correct	1179 ms	52904 KB	Output is correct
28	Correct	1202 ms	52904 KB	Output is correct
29	Correct	1240 ms	52904 KB	Output is correct
30	Correct	1321 ms	52904 KB	Output is correct
31	Correct	1284 ms	52904 KB	Output is correct
32	Correct	1277 ms	52924 KB	Output is correct
33	Correct	82 ms	52924 KB	Output is correct
34	Correct	194 ms	52924 KB	Output is correct
35	Correct	1162 ms	52924 KB	Output is correct
36	Correct	2865 ms	52924 KB	Output is correct
37	Correct	1053 ms	52924 KB	Output is correct
38	Correct	2274 ms	52924 KB	Output is correct
39	Correct	1094 ms	52924 KB	Output is correct
40	Correct	1296 ms	52924 KB	Output is correct
41	Correct	1316 ms	52924 KB	Output is correct
42	Correct	1204 ms	52924 KB	Output is correct
43	Correct	1103 ms	52924 KB	Output is correct
44	Correct	54 ms	52924 KB	Output is correct
45	Correct	112 ms	52924 KB	Output is correct
46	Correct	182 ms	52924 KB	Output is correct
47	Correct	252 ms	52924 KB	Output is correct
48	Correct	382 ms	52924 KB	Output is correct
49	Correct	1522 ms	52924 KB	Output is correct
50	Correct	1861 ms	53076 KB	Output is correct
51	Correct	1544 ms	53076 KB	Output is correct
52	Correct	3131 ms	53308 KB	Output is correct
53	Correct	1514 ms	53308 KB	Output is correct
54	Correct	1558 ms	53308 KB	Output is correct
55	Correct	1431 ms	53308 KB	Output is correct
56	Correct	141 ms	53308 KB	Output is correct
57	Correct	347 ms	53308 KB	Output is correct
58	Correct	621 ms	53308 KB	Output is correct
59	Correct	2186 ms	53308 KB	Output is correct
60	Correct	3966 ms	53308 KB	Output is correct
61	Correct	2066 ms	53308 KB	Output is correct
62	Correct	1660 ms	53308 KB	Output is correct
63	Correct	3748 ms	53308 KB	Output is correct
64	Correct	2300 ms	53308 KB	Output is correct
65	Correct	2128 ms	53308 KB	Output is correct
66	Correct	2389 ms	53308 KB	Output is correct
67	Correct	2282 ms	53308 KB	Output is correct
68	Correct	1791 ms	53308 KB	Output is correct
69	Correct	3257 ms	53308 KB	Output is correct

답안 #75250

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