답안 #75248

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
75248 2018-09-09T02:34:53 Z jangwonyoung 자리 배치 (IOI18_seats) C++14
100 / 100
3641 ms 53308 KB
#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);
	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];
	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+i+j]=get(x-i,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
}
# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 508 KB Output is correct
2 Correct 23 ms 580 KB Output is correct
3 Correct 33 ms 580 KB Output is correct
4 Correct 20 ms 788 KB Output is correct
5 Correct 23 ms 788 KB Output is correct
6 Correct 30 ms 900 KB Output is correct
7 Correct 32 ms 900 KB Output is correct
8 Correct 32 ms 900 KB Output is correct
9 Correct 30 ms 900 KB Output is correct
10 Correct 31 ms 900 KB Output is correct
11 Correct 28 ms 900 KB Output is correct
12 Correct 18 ms 900 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 508 KB Output is correct
2 Correct 23 ms 580 KB Output is correct
3 Correct 33 ms 580 KB Output is correct
4 Correct 20 ms 788 KB Output is correct
5 Correct 23 ms 788 KB Output is correct
6 Correct 30 ms 900 KB Output is correct
7 Correct 32 ms 900 KB Output is correct
8 Correct 32 ms 900 KB Output is correct
9 Correct 30 ms 900 KB Output is correct
10 Correct 31 ms 900 KB Output is correct
11 Correct 28 ms 900 KB Output is correct
12 Correct 18 ms 900 KB Output is correct
13 Correct 77 ms 1304 KB Output is correct
14 Correct 90 ms 1304 KB Output is correct
15 Correct 49 ms 1432 KB Output is correct
16 Correct 38 ms 1432 KB Output is correct
17 Correct 60 ms 1468 KB Output is correct
18 Correct 60 ms 1468 KB Output is correct
19 Correct 54 ms 1468 KB Output is correct
20 Correct 46 ms 1468 KB Output is correct
21 Correct 36 ms 1468 KB Output is correct
22 Correct 40 ms 1468 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 2331 ms 52796 KB Output is correct
2 Correct 1235 ms 52796 KB Output is correct
3 Correct 1203 ms 52796 KB Output is correct
4 Correct 1004 ms 52796 KB Output is correct
5 Correct 1041 ms 52796 KB Output is correct
6 Correct 942 ms 52820 KB Output is correct
7 Correct 1125 ms 52968 KB Output is correct
8 Correct 1164 ms 52968 KB Output is correct
9 Correct 1183 ms 52968 KB Output is correct
10 Correct 1123 ms 52968 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 86 ms 52968 KB Output is correct
2 Correct 175 ms 52968 KB Output is correct
3 Correct 1032 ms 52968 KB Output is correct
4 Correct 2330 ms 52968 KB Output is correct
5 Correct 875 ms 52968 KB Output is correct
6 Correct 1992 ms 52968 KB Output is correct
7 Correct 968 ms 52968 KB Output is correct
8 Correct 1190 ms 52968 KB Output is correct
9 Correct 1260 ms 52968 KB Output is correct
10 Correct 1157 ms 52968 KB Output is correct
11 Correct 1044 ms 52968 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 53 ms 52968 KB Output is correct
2 Correct 104 ms 52968 KB Output is correct
3 Correct 166 ms 52968 KB Output is correct
4 Correct 224 ms 52968 KB Output is correct
5 Correct 350 ms 52968 KB Output is correct
6 Correct 1407 ms 52968 KB Output is correct
7 Correct 1680 ms 53180 KB Output is correct
8 Correct 1462 ms 53180 KB Output is correct
9 Correct 3144 ms 53308 KB Output is correct
10 Correct 1332 ms 53308 KB Output is correct
11 Correct 1322 ms 53308 KB Output is correct
12 Correct 1357 ms 53308 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 508 KB Output is correct
2 Correct 23 ms 580 KB Output is correct
3 Correct 33 ms 580 KB Output is correct
4 Correct 20 ms 788 KB Output is correct
5 Correct 23 ms 788 KB Output is correct
6 Correct 30 ms 900 KB Output is correct
7 Correct 32 ms 900 KB Output is correct
8 Correct 32 ms 900 KB Output is correct
9 Correct 30 ms 900 KB Output is correct
10 Correct 31 ms 900 KB Output is correct
11 Correct 28 ms 900 KB Output is correct
12 Correct 18 ms 900 KB Output is correct
13 Correct 77 ms 1304 KB Output is correct
14 Correct 90 ms 1304 KB Output is correct
15 Correct 49 ms 1432 KB Output is correct
16 Correct 38 ms 1432 KB Output is correct
17 Correct 60 ms 1468 KB Output is correct
18 Correct 60 ms 1468 KB Output is correct
19 Correct 54 ms 1468 KB Output is correct
20 Correct 46 ms 1468 KB Output is correct
21 Correct 36 ms 1468 KB Output is correct
22 Correct 40 ms 1468 KB Output is correct
23 Correct 2331 ms 52796 KB Output is correct
24 Correct 1235 ms 52796 KB Output is correct
25 Correct 1203 ms 52796 KB Output is correct
26 Correct 1004 ms 52796 KB Output is correct
27 Correct 1041 ms 52796 KB Output is correct
28 Correct 942 ms 52820 KB Output is correct
29 Correct 1125 ms 52968 KB Output is correct
30 Correct 1164 ms 52968 KB Output is correct
31 Correct 1183 ms 52968 KB Output is correct
32 Correct 1123 ms 52968 KB Output is correct
33 Correct 86 ms 52968 KB Output is correct
34 Correct 175 ms 52968 KB Output is correct
35 Correct 1032 ms 52968 KB Output is correct
36 Correct 2330 ms 52968 KB Output is correct
37 Correct 875 ms 52968 KB Output is correct
38 Correct 1992 ms 52968 KB Output is correct
39 Correct 968 ms 52968 KB Output is correct
40 Correct 1190 ms 52968 KB Output is correct
41 Correct 1260 ms 52968 KB Output is correct
42 Correct 1157 ms 52968 KB Output is correct
43 Correct 1044 ms 52968 KB Output is correct
44 Correct 53 ms 52968 KB Output is correct
45 Correct 104 ms 52968 KB Output is correct
46 Correct 166 ms 52968 KB Output is correct
47 Correct 224 ms 52968 KB Output is correct
48 Correct 350 ms 52968 KB Output is correct
49 Correct 1407 ms 52968 KB Output is correct
50 Correct 1680 ms 53180 KB Output is correct
51 Correct 1462 ms 53180 KB Output is correct
52 Correct 3144 ms 53308 KB Output is correct
53 Correct 1332 ms 53308 KB Output is correct
54 Correct 1322 ms 53308 KB Output is correct
55 Correct 1357 ms 53308 KB Output is correct
56 Correct 156 ms 53308 KB Output is correct
57 Correct 316 ms 53308 KB Output is correct
58 Correct 569 ms 53308 KB Output is correct
59 Correct 1925 ms 53308 KB Output is correct
60 Correct 3641 ms 53308 KB Output is correct
61 Correct 1862 ms 53308 KB Output is correct
62 Correct 1438 ms 53308 KB Output is correct
63 Correct 3417 ms 53308 KB Output is correct
64 Correct 2100 ms 53308 KB Output is correct
65 Correct 1904 ms 53308 KB Output is correct
66 Correct 2195 ms 53308 KB Output is correct
67 Correct 2051 ms 53308 KB Output is correct
68 Correct 1589 ms 53308 KB Output is correct
69 Correct 2971 ms 53308 KB Output is correct