답안 #75247 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
75247	2018-09-09T02:23:29 Z	jangwonyoung	자리 배치 (IOI18_seats)	C++14	70 / 100	4000 ms	53180 KB

seats

#include "seats.h"
#include<iostream>
#include<algorithm>
using namespace std;
int n,m;
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;
	}
	lazy[id*2]+=lazy[id];
	lazy[id*2+1]+=lazy[id];
	minv[id*2]+=lazy[id];
	minv[id*2+1]+=lazy[id];
	lazy[id]=0;
	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];
	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++)
			a[i*2+j+1]=get(x-i,y-j);
	sort(a+1,a+5);
	//cout << "UPD " << x << ' ' << y << ' ' << a[1] << ' ' << a[2] << ' ' << a[3] << ' ' << a[4] << ' ' << v << endl;;
	if(a[1]<a[2]) supd(1,0,n*m-1,a[1],a[2]-1,v);
	if(a[3]<a[4]) supd(1,0,n*m-1,a[3],a[4]-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;
	build(1,0,n*m-1);
	for(int i=0; i<n*m ;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	30 ms	628 KB	Output is correct
3	Correct	41 ms	628 KB	Output is correct
4	Correct	23 ms	636 KB	Output is correct
5	Correct	22 ms	652 KB	Output is correct
6	Correct	35 ms	908 KB	Output is correct
7	Correct	37 ms	908 KB	Output is correct
8	Correct	36 ms	908 KB	Output is correct
9	Correct	37 ms	908 KB	Output is correct
10	Correct	38 ms	908 KB	Output is correct
11	Correct	33 ms	908 KB	Output is correct
12	Correct	21 ms	908 KB	Output is correct

Subtask #2
6.0 / 6.0

#	결과	실행 시간	메모리	Grader output
1	Correct	18 ms	504 KB	Output is correct
2	Correct	30 ms	628 KB	Output is correct
3	Correct	41 ms	628 KB	Output is correct
4	Correct	23 ms	636 KB	Output is correct
5	Correct	22 ms	652 KB	Output is correct
6	Correct	35 ms	908 KB	Output is correct
7	Correct	37 ms	908 KB	Output is correct
8	Correct	36 ms	908 KB	Output is correct
9	Correct	37 ms	908 KB	Output is correct
10	Correct	38 ms	908 KB	Output is correct
11	Correct	33 ms	908 KB	Output is correct
12	Correct	21 ms	908 KB	Output is correct
13	Correct	105 ms	1404 KB	Output is correct
14	Correct	100 ms	1408 KB	Output is correct
15	Correct	55 ms	1408 KB	Output is correct
16	Correct	42 ms	1408 KB	Output is correct
17	Correct	74 ms	1408 KB	Output is correct
18	Correct	69 ms	1440 KB	Output is correct
19	Correct	69 ms	1440 KB	Output is correct
20	Correct	61 ms	1440 KB	Output is correct
21	Correct	44 ms	1440 KB	Output is correct
22	Correct	47 ms	1440 KB	Output is correct

Subtask #3
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2781 ms	52796 KB	Output is correct
2	Correct	1436 ms	52796 KB	Output is correct
3	Correct	1351 ms	52796 KB	Output is correct
4	Correct	1181 ms	52816 KB	Output is correct
5	Correct	1256 ms	52840 KB	Output is correct
6	Correct	1137 ms	52876 KB	Output is correct
7	Correct	1290 ms	52876 KB	Output is correct
8	Correct	1368 ms	52876 KB	Output is correct
9	Correct	1378 ms	52876 KB	Output is correct
10	Correct	1350 ms	52876 KB	Output is correct

Subtask #4
6.0 / 6.0

#	결과	실행 시간	메모리	Grader output
1	Correct	85 ms	52876 KB	Output is correct
2	Correct	219 ms	52876 KB	Output is correct
3	Correct	1208 ms	52876 KB	Output is correct
4	Correct	2722 ms	52876 KB	Output is correct
5	Correct	1183 ms	52876 KB	Output is correct
6	Correct	2288 ms	52876 KB	Output is correct
7	Correct	1226 ms	52932 KB	Output is correct
8	Correct	1416 ms	52956 KB	Output is correct
9	Correct	1429 ms	52956 KB	Output is correct
10	Correct	1306 ms	52956 KB	Output is correct
11	Correct	1133 ms	52956 KB	Output is correct

Subtask #5
33.0 / 33.0

#	결과	실행 시간	메모리	Grader output
1	Correct	60 ms	52956 KB	Output is correct
2	Correct	116 ms	52956 KB	Output is correct
3	Correct	202 ms	52956 KB	Output is correct
4	Correct	272 ms	52956 KB	Output is correct
5	Correct	429 ms	52956 KB	Output is correct
6	Correct	1706 ms	53180 KB	Output is correct
7	Correct	2005 ms	53180 KB	Output is correct
8	Correct	1722 ms	53180 KB	Output is correct
9	Correct	3532 ms	53180 KB	Output is correct
10	Correct	1574 ms	53180 KB	Output is correct
11	Correct	1711 ms	53180 KB	Output is correct
12	Correct	1533 ms	53180 KB	Output is correct

Subtask #6
0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	18 ms	504 KB	Output is correct
2	Correct	30 ms	628 KB	Output is correct
3	Correct	41 ms	628 KB	Output is correct
4	Correct	23 ms	636 KB	Output is correct
5	Correct	22 ms	652 KB	Output is correct
6	Correct	35 ms	908 KB	Output is correct
7	Correct	37 ms	908 KB	Output is correct
8	Correct	36 ms	908 KB	Output is correct
9	Correct	37 ms	908 KB	Output is correct
10	Correct	38 ms	908 KB	Output is correct
11	Correct	33 ms	908 KB	Output is correct
12	Correct	21 ms	908 KB	Output is correct
13	Correct	105 ms	1404 KB	Output is correct
14	Correct	100 ms	1408 KB	Output is correct
15	Correct	55 ms	1408 KB	Output is correct
16	Correct	42 ms	1408 KB	Output is correct
17	Correct	74 ms	1408 KB	Output is correct
18	Correct	69 ms	1440 KB	Output is correct
19	Correct	69 ms	1440 KB	Output is correct
20	Correct	61 ms	1440 KB	Output is correct
21	Correct	44 ms	1440 KB	Output is correct
22	Correct	47 ms	1440 KB	Output is correct
23	Correct	2781 ms	52796 KB	Output is correct
24	Correct	1436 ms	52796 KB	Output is correct
25	Correct	1351 ms	52796 KB	Output is correct
26	Correct	1181 ms	52816 KB	Output is correct
27	Correct	1256 ms	52840 KB	Output is correct
28	Correct	1137 ms	52876 KB	Output is correct
29	Correct	1290 ms	52876 KB	Output is correct
30	Correct	1368 ms	52876 KB	Output is correct
31	Correct	1378 ms	52876 KB	Output is correct
32	Correct	1350 ms	52876 KB	Output is correct
33	Correct	85 ms	52876 KB	Output is correct
34	Correct	219 ms	52876 KB	Output is correct
35	Correct	1208 ms	52876 KB	Output is correct
36	Correct	2722 ms	52876 KB	Output is correct
37	Correct	1183 ms	52876 KB	Output is correct
38	Correct	2288 ms	52876 KB	Output is correct
39	Correct	1226 ms	52932 KB	Output is correct
40	Correct	1416 ms	52956 KB	Output is correct
41	Correct	1429 ms	52956 KB	Output is correct
42	Correct	1306 ms	52956 KB	Output is correct
43	Correct	1133 ms	52956 KB	Output is correct
44	Correct	60 ms	52956 KB	Output is correct
45	Correct	116 ms	52956 KB	Output is correct
46	Correct	202 ms	52956 KB	Output is correct
47	Correct	272 ms	52956 KB	Output is correct
48	Correct	429 ms	52956 KB	Output is correct
49	Correct	1706 ms	53180 KB	Output is correct
50	Correct	2005 ms	53180 KB	Output is correct
51	Correct	1722 ms	53180 KB	Output is correct
52	Correct	3532 ms	53180 KB	Output is correct
53	Correct	1574 ms	53180 KB	Output is correct
54	Correct	1711 ms	53180 KB	Output is correct
55	Correct	1533 ms	53180 KB	Output is correct
56	Correct	152 ms	53180 KB	Output is correct
57	Correct	385 ms	53180 KB	Output is correct
58	Correct	651 ms	53180 KB	Output is correct
59	Correct	2303 ms	53180 KB	Output is correct
60	Execution timed out	4045 ms	53180 KB	Time limit exceeded
61	Halted	0 ms	0 KB	-

답안 #75247

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 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
0 / 30.0