oj.uz

답안 #368046

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
368046 2021-02-19T11:05:26 Z dennisstar 자리 배치 (IOI18_seats) C++17
100 / 100
 1689 ms 135804 KB 
#include "seats.h"
#include <bits/stdc++.h>

using namespace std;
using pii = pair<int, int>;

const int xx[] = {0, -1, -1, -1, 0, 1, 1, 1, 0};
const int yy[] = {-1, -1, 0, 1, 1, 1, 0, -1, -1};

int H, W;
vector<int> R, C;
vector<vector<int>> S;

pii s1[1<<21], s2[1<<21];
int ss[1<<21];
void upd(int i, int s, int e, int t, pii p) {
	if (s==e) {
		s1[i]=s2[i]=p;
		ss[i]=1;
		return ;
	}

	int m=(s+e)/2;
	if (t<=m) upd(i*2, s, m, t, p);
	else upd(i*2+1, m+1, e, t, p);

	s1[i]=pii(s1[i*2].first+s1[i*2+1].first, s1[i*2].second+s1[i*2+1].second);
	pii pp(s1[i*2].first+s2[i*2+1].first, s1[i*2].second+s2[i*2+1].second);
	tie(s2[i], ss[i])=min(tie(s2[i*2], ss[i*2]), tie(pp, ss[i*2+1]));
	if (s2[i*2]==pp) ss[i]+=max(ss[i*2], ss[i*2+1]);
}

bool av(int x, int y) { return 0<=x&&x<=H-1&&0<=y&&y<=W-1; }

void upd(int x, int y) {
	int c=0, d=0;
	for (int i=1; i<=7; i+=2) {
		int cc=0;
		for (int j=-1; j<=1; j++)
			if (av(x+xx[i+j], y+yy[i+j])
				&&S[x+xx[i+j]][y+yy[i+j]]<S[x][y]) cc++;
		if (cc==0) c++;
		if (cc==1) {
			if (av(x+xx[i], y+yy[i])
				&&S[x+xx[i]][y+yy[i]]<S[x][y]) c++;
			else c--;
		}
		if (cc==2) {
			if (S[x+xx[i]][y+yy[i]]>S[x][y]) c-=2;
			d++;
		}
		if (cc==3) d--;
	}
	upd(1, 0, H*W-1, S[x][y], pii(c, d));
}

void give_initial_chart(int H, int W, vector<int> R, vector<int> C) {
	::H=H;
	::W=W;
	::R=R;
	::C=C;
	S.resize(H, vector<int>(W, 1e9));
	for (int i=0; i<H*W; i++) {
		S[R[i]][C[i]]=i;
		upd(R[i], C[i]);
	}
}

int swap_seats(int a, int b) {
	swap(R[a], R[b]);
	swap(C[a], C[b]);
	swap(S[R[a]][C[a]], S[R[b]][C[b]]);

	vector<pii> U;
	U.emplace_back(R[a], C[a]);
	U.emplace_back(R[b], C[b]);
	for (int i=0; i<=7; i++) {
		if (av(R[a]+xx[i], C[a]+yy[i])) U.emplace_back(R[a]+xx[i], C[a]+yy[i]);
		if (av(R[b]+xx[i], C[b]+yy[i])) U.emplace_back(R[b]+xx[i], C[b]+yy[i]);
	}
	sort(U.begin(), U.end(), [&](pii &p1, pii &p2) {
		return S[p1.first][p1.second]<S[p2.first][p2.second];
	});
	U.resize(unique(U.begin(), U.end())-U.begin());

	for (auto &i:U) upd(i.first, i.second);
	return ss[1];
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 492 KB Output is correct
2 Correct 15 ms 492 KB Output is correct
3 Correct 21 ms 492 KB Output is correct
4 Correct 8 ms 492 KB Output is correct
5 Correct 8 ms 492 KB Output is correct
6 Correct 16 ms 492 KB Output is correct
7 Correct 19 ms 492 KB Output is correct
8 Correct 19 ms 492 KB Output is correct
9 Correct 20 ms 492 KB Output is correct
10 Correct 19 ms 492 KB Output is correct
11 Correct 16 ms 492 KB Output is correct
12 Correct 8 ms 492 KB Output is correct

Subtask #2
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 492 KB Output is correct
2 Correct 15 ms 492 KB Output is correct
3 Correct 21 ms 492 KB Output is correct
4 Correct 8 ms 492 KB Output is correct
5 Correct 8 ms 492 KB Output is correct
6 Correct 16 ms 492 KB Output is correct
7 Correct 19 ms 492 KB Output is correct
8 Correct 19 ms 492 KB Output is correct
9 Correct 20 ms 492 KB Output is correct
10 Correct 19 ms 492 KB Output is correct
11 Correct 16 ms 492 KB Output is correct
12 Correct 8 ms 492 KB Output is correct
13 Correct 46 ms 1516 KB Output is correct
14 Correct 44 ms 1516 KB Output is correct
15 Correct 19 ms 1516 KB Output is correct
16 Correct 19 ms 2028 KB Output is correct
17 Correct 31 ms 1516 KB Output is correct
18 Correct 41 ms 1516 KB Output is correct
19 Correct 36 ms 1516 KB Output is correct
20 Correct 29 ms 1772 KB Output is correct
21 Correct 18 ms 1516 KB Output is correct
22 Correct 19 ms 2028 KB Output is correct

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 914 ms 69664 KB Output is correct
2 Correct 762 ms 69612 KB Output is correct
3 Correct 765 ms 85100 KB Output is correct
4 Correct 770 ms 84844 KB Output is correct
5 Correct 770 ms 84844 KB Output is correct
6 Correct 760 ms 84844 KB Output is correct
7 Correct 764 ms 84972 KB Output is correct
8 Correct 773 ms 85100 KB Output is correct
9 Correct 760 ms 84812 KB Output is correct
10 Correct 770 ms 84800 KB Output is correct

Subtask #4
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 45 ms 1516 KB Output is correct
2 Correct 105 ms 9324 KB Output is correct
3 Correct 782 ms 84768 KB Output is correct
4 Correct 907 ms 84816 KB Output is correct
5 Correct 721 ms 84932 KB Output is correct
6 Correct 1053 ms 135804 KB Output is correct
7 Correct 755 ms 84844 KB Output is correct
8 Correct 747 ms 84972 KB Output is correct
9 Correct 777 ms 85136 KB Output is correct
10 Correct 787 ms 87980 KB Output is correct
11 Correct 773 ms 108260 KB Output is correct

Subtask #5
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 46 ms 2024 KB Output is correct
2 Correct 55 ms 2024 KB Output is correct
3 Correct 73 ms 2024 KB Output is correct
4 Correct 96 ms 2152 KB Output is correct
5 Correct 130 ms 3116 KB Output is correct
6 Correct 916 ms 85796 KB Output is correct
7 Correct 906 ms 85808 KB Output is correct
8 Correct 929 ms 85792 KB Output is correct
9 Correct 1016 ms 85908 KB Output is correct
10 Correct 871 ms 85984 KB Output is correct
11 Correct 883 ms 85684 KB Output is correct
12 Correct 891 ms 85868 KB Output is correct

Subtask #6
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 492 KB Output is correct
2 Correct 15 ms 492 KB Output is correct
3 Correct 21 ms 492 KB Output is correct
4 Correct 8 ms 492 KB Output is correct
5 Correct 8 ms 492 KB Output is correct
6 Correct 16 ms 492 KB Output is correct
7 Correct 19 ms 492 KB Output is correct
8 Correct 19 ms 492 KB Output is correct
9 Correct 20 ms 492 KB Output is correct
10 Correct 19 ms 492 KB Output is correct
11 Correct 16 ms 492 KB Output is correct
12 Correct 8 ms 492 KB Output is correct
13 Correct 46 ms 1516 KB Output is correct
14 Correct 44 ms 1516 KB Output is correct
15 Correct 19 ms 1516 KB Output is correct
16 Correct 19 ms 2028 KB Output is correct
17 Correct 31 ms 1516 KB Output is correct
18 Correct 41 ms 1516 KB Output is correct
19 Correct 36 ms 1516 KB Output is correct
20 Correct 29 ms 1772 KB Output is correct
21 Correct 18 ms 1516 KB Output is correct
22 Correct 19 ms 2028 KB Output is correct
23 Correct 914 ms 69664 KB Output is correct
24 Correct 762 ms 69612 KB Output is correct
25 Correct 765 ms 85100 KB Output is correct
26 Correct 770 ms 84844 KB Output is correct
27 Correct 770 ms 84844 KB Output is correct
28 Correct 760 ms 84844 KB Output is correct
29 Correct 764 ms 84972 KB Output is correct
30 Correct 773 ms 85100 KB Output is correct
31 Correct 760 ms 84812 KB Output is correct
32 Correct 770 ms 84800 KB Output is correct
33 Correct 45 ms 1516 KB Output is correct
34 Correct 105 ms 9324 KB Output is correct
35 Correct 782 ms 84768 KB Output is correct
36 Correct 907 ms 84816 KB Output is correct
37 Correct 721 ms 84932 KB Output is correct
38 Correct 1053 ms 135804 KB Output is correct
39 Correct 755 ms 84844 KB Output is correct
40 Correct 747 ms 84972 KB Output is correct
41 Correct 777 ms 85136 KB Output is correct
42 Correct 787 ms 87980 KB Output is correct
43 Correct 773 ms 108260 KB Output is correct
44 Correct 46 ms 2024 KB Output is correct
45 Correct 55 ms 2024 KB Output is correct
46 Correct 73 ms 2024 KB Output is correct
47 Correct 96 ms 2152 KB Output is correct
48 Correct 130 ms 3116 KB Output is correct
49 Correct 916 ms 85796 KB Output is correct
50 Correct 906 ms 85808 KB Output is correct
51 Correct 929 ms 85792 KB Output is correct
52 Correct 1016 ms 85908 KB Output is correct
53 Correct 871 ms 85984 KB Output is correct
54 Correct 883 ms 85684 KB Output is correct
55 Correct 891 ms 85868 KB Output is correct
56 Correct 99 ms 2024 KB Output is correct
57 Correct 212 ms 2140 KB Output is correct
58 Correct 405 ms 3176 KB Output is correct
59 Correct 1322 ms 86060 KB Output is correct
60 Correct 1689 ms 85888 KB Output is correct
61 Correct 1224 ms 85948 KB Output is correct
62 Correct 1050 ms 85772 KB Output is correct
63 Correct 1456 ms 85848 KB Output is correct
64 Correct 1299 ms 85868 KB Output is correct
65 Correct 1198 ms 85708 KB Output is correct
66 Correct 1349 ms 86104 KB Output is correct
67 Correct 1264 ms 88924 KB Output is correct
68 Correct 1143 ms 100152 KB Output is correct
69 Correct 1495 ms 109308 KB Output is correct