oj.uz

답안 #263645

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
263645 2020-08-13T23:42:59 Z amoo_safar 무지개나라 (APIO17_rainbow) C++17
100 / 100
 719 ms 69404 KB 
// Zende bad Shoma nasime faghat !
#include <bits/stdc++.h>

#pragma GCC target ("avx2")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")

#define all(x) x.begin(), x.end()
#define F first
#define S second
#define pb push_back

#ifndef safar
#include "rainbow.h"
#endif

using namespace std;

const int N = 2e5 + 10;

typedef pair<int, int> pii;

template<typename T>
void Unique(vector<T> &V){
	sort(all(V));
	V.resize(unique(all(V)) - V.begin());
}


int R, C;
vector<pii> Riv, P;

pii corner[] = {{0, 0}, {0, -1}, {-1, -1}, {-1, 0}};

bool Exist(pii X){
	return X == *lower_bound(all(Riv), X);
}

vector<int> RE[N], CE[N];

vector<pii> Fen[N];
vector<int> PS[N];

void Add(pii P, int d){
	//cerr << "# " << P.F << " " << P.S << " : " << d << '\n';
	for(int idx = P.F; idx < N; idx += idx & (-idx))
		Fen[idx].pb({P.S, d});
}
////////////////
int com;
const int N2 = 3*N;
vector<pii> Fr;
int mark[N2];

int ID(pii X){
	int x = lower_bound(all(Fr), X) - Fr.begin();
	if(x == (int)Fr.size()) return -1;
	if(Fr[x] != X) return -1;
	return x;
}

pii side[] = {{0, 1}, {0, -1}, {1, 0}, {-1, 0}};

void DFS(int u){
	int X = Fr[u].F;
	int Y = Fr[u].S;
	mark[u] = 1;
	int adj;
	for(auto [x, y] : side){
		adj = ID({X + x, Y + y});
		if(adj == -1 || mark[adj]) continue;
		DFS(adj);
	}

}

////////////////
int mxx = -1, mxy = -1, mnx = 1e9, mny = 1e9;

void init(int Ri, int Ci, int sr, int sc, int m, char *s){
	R = Ri; C = Ci;

	Riv.resize(m + 1);
	Riv[0] = {sr, sc};
	for(int i = 1; i <= m; i++){
		if(s[i - 1] == 'N') sr --;
		if(s[i - 1] == 'S') sr ++;
		if(s[i - 1] == 'W') sc --;
		if(s[i - 1] == 'E') sc ++;
		Riv[i] = {sr, sc};
	}
	Unique(Riv);
	
	for(auto &X : Riv)
		for(auto &del : corner)
			if(min(X.F + del.F, X.S + del.S) > 0)
				P.pb({X.F + del.F, X.S + del.S});
	
	for(auto &X : Riv)
		for(int x = X.F - 1; x <= X.F + 1; x++)
			for(int y = X.S - 1; y <= X.S + 1; y++)
				if(!Exist({x, y}))
					Fr.pb({x, y});

	Unique(P);
	//for(auto X : Riv) cerr << X.F << ' ' << X.S << '\n';
	Riv.pb({R + R, C + 2});

	for(auto &X : Riv){
		if(X.F == R + R) break;
		
		for(int x = X.F - 1; x <= X.F + 1; x++)
			for(int y = X.S - 1; y <= X.S + 1; y++)
				if(!Exist({x, y}))
					Fr.pb({x, y});		

		mxx = max(mxx, X.F);
		mnx = min(mnx, X.F);
		mxy = max(mxy, X.S);
		mny = min(mny, X.S);

		if(!Exist({X.F, X.S - 1}))
			RE[X.F].pb(X.S - 1);
		
		if(!Exist({X.F, X.S + 1}))
			RE[X.F].pb(X.S);
		
		if(!Exist({X.F - 1, X.S}))
			CE[X.S].pb(X.F - 1);
		
		if(!Exist({X.F + 1, X.S}))
			CE[X.S].pb(X.F);
	}

	Unique(Fr);

	for(int i = 0; i < (int) Fr.size(); i++){
		if(!mark[i]){
			DFS(i);
			com ++;
		}
	}
	//cerr << "## " << com << '\n';



	int cnt;
	vector<int> ex;
	for(auto X : P){
		cnt = 0;
		int po = 0;
		ex.clear();
		for(auto &del : corner){
			if(Exist({X.F - del.F, X.S - del.S})){
				cnt ++;
				ex.pb(po);
			}
			po ++;
		}

		if(cnt & 1)
			Add(X, cnt == 1 ? -1 : 1);
		if(cnt == 2){
			if(ex[1] - ex[0] == 2){
				Add(X, 2);
			}
		}
	}

	for(int i = 1; i < N; i++){
		sort(all(Fen[i]));
		PS[i].resize(Fen[i].size() + 1, 0);
		for(int j = 1; j <= (int) Fen[i].size(); j++){
			PS[i][j] = PS[i][j - 1] + Fen[i][j - 1].S;
		}
	}
}

int Get(int x, int y){
	int res = 0;
	for(; x; x -= x & (-x)){
		res += PS[x][upper_bound(all(Fen[x]), pii(y, 5)) - Fen[x].begin()];
	}
	return res;
}

int colour(int ar, int ac, int br, int bc){
	if((ar < mnx) && (ac < mny) && (mxx < br) && (mxy < bc)){
		//assert(false);
		return com;
	}
	int sum = 0;
	if(!Exist({ar, ac})) sum ++;
	if(!Exist({ar, bc})) sum ++;
	if(!Exist({br, ac})) sum ++;
	if(!Exist({br, bc})) sum ++;

	//cerr << "1 " << sum << '\n';

	if(ar < br && ac < bc){
		sum += Get(br - 1, bc - 1);
		//cerr << "1.1 " << sum << '\n';
		sum -= Get(ar - 1, bc - 1);
		sum -= Get(br - 1, ac - 1);
		sum += Get(ar - 1, ac - 1);
	}
	//cerr << "2 " << sum << '\n';

	sum += lower_bound(all(RE[ar]), bc) - upper_bound(all(RE[ar]), ac - 1);
	sum += lower_bound(all(RE[br]), bc) - upper_bound(all(RE[br]), ac - 1);
	
	sum += lower_bound(all(CE[ac]), br) - upper_bound(all(CE[ac]), ar - 1);
	sum += lower_bound(all(CE[bc]), br) - upper_bound(all(CE[bc]), ar - 1);
	//cerr << "! " << sum << '\n';
	assert(sum % 4 == 0);
	return sum / 4;
}


#ifdef safar
int main(){
	ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	init(6, 6, 2, 2, 8, "ESNW");
	//cerr << "# " << Get(6, 4) << '\n';
	//cerr << Get(3, 2) << '\n';
	
	cout << colour(1, 1, 6, 6) << '\n';
	//cout << colour(3, 2, 4, 4) << '\n';
	//cout << colour(5, 3, 6, 4) << '\n';
	//cout << colour(1, 2, 5, 3) << '\n';
	//cout << colour(1, 1, 6, 4) << '\n';
	return 0;
}
#endif

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 26 ms 25472 KB Output is correct
2 Correct 28 ms 25540 KB Output is correct
3 Correct 26 ms 25464 KB Output is correct
4 Correct 26 ms 25464 KB Output is correct
5 Correct 31 ms 25472 KB Output is correct
6 Correct 24 ms 25344 KB Output is correct
7 Correct 24 ms 25344 KB Output is correct
8 Correct 24 ms 25340 KB Output is correct
9 Correct 24 ms 25336 KB Output is correct
10 Correct 30 ms 25336 KB Output is correct
11 Correct 28 ms 25464 KB Output is correct
12 Correct 29 ms 25472 KB Output is correct
13 Correct 31 ms 25600 KB Output is correct
14 Correct 35 ms 26104 KB Output is correct
15 Correct 24 ms 25344 KB Output is correct
16 Correct 24 ms 25344 KB Output is correct
17 Correct 26 ms 25344 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 24 ms 25344 KB Output is correct
2 Correct 26 ms 25344 KB Output is correct
3 Correct 317 ms 39788 KB Output is correct
4 Correct 533 ms 50108 KB Output is correct
5 Correct 577 ms 53436 KB Output is correct
6 Correct 445 ms 46172 KB Output is correct
7 Correct 584 ms 61908 KB Output is correct
8 Correct 103 ms 27004 KB Output is correct
9 Correct 508 ms 50096 KB Output is correct
10 Correct 573 ms 53308 KB Output is correct
11 Correct 462 ms 46036 KB Output is correct
12 Correct 398 ms 47472 KB Output is correct
13 Correct 440 ms 49952 KB Output is correct
14 Correct 500 ms 53300 KB Output is correct
15 Correct 401 ms 46036 KB Output is correct
16 Correct 340 ms 42076 KB Output is correct

Subtask #3
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 24 ms 25344 KB Output is correct
2 Correct 319 ms 48936 KB Output is correct
3 Correct 457 ms 45896 KB Output is correct
4 Correct 471 ms 68668 KB Output is correct
5 Correct 299 ms 41680 KB Output is correct
6 Correct 113 ms 29008 KB Output is correct
7 Correct 168 ms 31080 KB Output is correct
8 Correct 336 ms 44140 KB Output is correct
9 Correct 324 ms 42324 KB Output is correct
10 Correct 103 ms 28532 KB Output is correct
11 Correct 226 ms 35796 KB Output is correct
12 Correct 314 ms 49064 KB Output is correct
13 Correct 440 ms 45916 KB Output is correct
14 Correct 469 ms 68792 KB Output is correct
15 Correct 311 ms 41680 KB Output is correct
16 Correct 88 ms 28268 KB Output is correct
17 Correct 170 ms 31848 KB Output is correct
18 Correct 390 ms 42792 KB Output is correct
19 Correct 382 ms 46968 KB Output is correct
20 Correct 372 ms 46652 KB Output is correct
21 Correct 341 ms 44268 KB Output is correct
22 Correct 315 ms 42324 KB Output is correct
23 Correct 103 ms 28536 KB Output is correct
24 Correct 228 ms 35880 KB Output is correct
25 Correct 349 ms 48936 KB Output is correct
26 Correct 503 ms 45868 KB Output is correct
27 Correct 489 ms 68668 KB Output is correct
28 Correct 298 ms 41680 KB Output is correct
29 Correct 89 ms 28140 KB Output is correct
30 Correct 167 ms 31848 KB Output is correct
31 Correct 382 ms 42716 KB Output is correct
32 Correct 377 ms 46780 KB Output is correct
33 Correct 366 ms 46652 KB Output is correct

Subtask #4
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 26 ms 25472 KB Output is correct
2 Correct 28 ms 25540 KB Output is correct
3 Correct 26 ms 25464 KB Output is correct
4 Correct 26 ms 25464 KB Output is correct
5 Correct 31 ms 25472 KB Output is correct
6 Correct 24 ms 25344 KB Output is correct
7 Correct 24 ms 25344 KB Output is correct
8 Correct 24 ms 25340 KB Output is correct
9 Correct 24 ms 25336 KB Output is correct
10 Correct 30 ms 25336 KB Output is correct
11 Correct 28 ms 25464 KB Output is correct
12 Correct 29 ms 25472 KB Output is correct
13 Correct 31 ms 25600 KB Output is correct
14 Correct 35 ms 26104 KB Output is correct
15 Correct 24 ms 25344 KB Output is correct
16 Correct 24 ms 25344 KB Output is correct
17 Correct 26 ms 25344 KB Output is correct
18 Correct 439 ms 34388 KB Output is correct
19 Correct 137 ms 26496 KB Output is correct
20 Correct 116 ms 26104 KB Output is correct
21 Correct 124 ms 26232 KB Output is correct
22 Correct 131 ms 26360 KB Output is correct
23 Correct 128 ms 26492 KB Output is correct
24 Correct 151 ms 26360 KB Output is correct
25 Correct 147 ms 26360 KB Output is correct
26 Correct 143 ms 26360 KB Output is correct
27 Correct 342 ms 31456 KB Output is correct
28 Correct 257 ms 30528 KB Output is correct
29 Correct 333 ms 32848 KB Output is correct
30 Correct 609 ms 43576 KB Output is correct
31 Correct 27 ms 25472 KB Output is correct
32 Correct 507 ms 42760 KB Output is correct

Subtask #5
26.0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 26 ms 25472 KB Output is correct
2 Correct 28 ms 25540 KB Output is correct
3 Correct 26 ms 25464 KB Output is correct
4 Correct 26 ms 25464 KB Output is correct
5 Correct 31 ms 25472 KB Output is correct
6 Correct 24 ms 25344 KB Output is correct
7 Correct 24 ms 25344 KB Output is correct
8 Correct 24 ms 25340 KB Output is correct
9 Correct 24 ms 25336 KB Output is correct
10 Correct 30 ms 25336 KB Output is correct
11 Correct 28 ms 25464 KB Output is correct
12 Correct 29 ms 25472 KB Output is correct
13 Correct 31 ms 25600 KB Output is correct
14 Correct 35 ms 26104 KB Output is correct
15 Correct 24 ms 25344 KB Output is correct
16 Correct 24 ms 25344 KB Output is correct
17 Correct 26 ms 25344 KB Output is correct
18 Correct 439 ms 34388 KB Output is correct
19 Correct 137 ms 26496 KB Output is correct
20 Correct 116 ms 26104 KB Output is correct
21 Correct 124 ms 26232 KB Output is correct
22 Correct 131 ms 26360 KB Output is correct
23 Correct 128 ms 26492 KB Output is correct
24 Correct 151 ms 26360 KB Output is correct
25 Correct 147 ms 26360 KB Output is correct
26 Correct 143 ms 26360 KB Output is correct
27 Correct 342 ms 31456 KB Output is correct
28 Correct 257 ms 30528 KB Output is correct
29 Correct 333 ms 32848 KB Output is correct
30 Correct 609 ms 43576 KB Output is correct
31 Correct 27 ms 25472 KB Output is correct
32 Correct 507 ms 42760 KB Output is correct
33 Correct 319 ms 48936 KB Output is correct
34 Correct 457 ms 45896 KB Output is correct
35 Correct 471 ms 68668 KB Output is correct
36 Correct 299 ms 41680 KB Output is correct
37 Correct 113 ms 29008 KB Output is correct
38 Correct 168 ms 31080 KB Output is correct
39 Correct 336 ms 44140 KB Output is correct
40 Correct 324 ms 42324 KB Output is correct
41 Correct 103 ms 28532 KB Output is correct
42 Correct 226 ms 35796 KB Output is correct
43 Correct 314 ms 49064 KB Output is correct
44 Correct 440 ms 45916 KB Output is correct
45 Correct 469 ms 68792 KB Output is correct
46 Correct 311 ms 41680 KB Output is correct
47 Correct 88 ms 28268 KB Output is correct
48 Correct 170 ms 31848 KB Output is correct
49 Correct 390 ms 42792 KB Output is correct
50 Correct 382 ms 46968 KB Output is correct
51 Correct 372 ms 46652 KB Output is correct
52 Correct 341 ms 44268 KB Output is correct
53 Correct 315 ms 42324 KB Output is correct
54 Correct 103 ms 28536 KB Output is correct
55 Correct 228 ms 35880 KB Output is correct
56 Correct 349 ms 48936 KB Output is correct
57 Correct 503 ms 45868 KB Output is correct
58 Correct 489 ms 68668 KB Output is correct
59 Correct 298 ms 41680 KB Output is correct
60 Correct 89 ms 28140 KB Output is correct
61 Correct 167 ms 31848 KB Output is correct
62 Correct 382 ms 42716 KB Output is correct
63 Correct 377 ms 46780 KB Output is correct
64 Correct 366 ms 46652 KB Output is correct
65 Correct 562 ms 44948 KB Output is correct
66 Correct 564 ms 43220 KB Output is correct
67 Correct 280 ms 29172 KB Output is correct
68 Correct 383 ms 36764 KB Output is correct
69 Correct 476 ms 49704 KB Output is correct
70 Correct 639 ms 46716 KB Output is correct
71 Correct 719 ms 69404 KB Output is correct
72 Correct 478 ms 42320 KB Output is correct
73 Correct 229 ms 28908 KB Output is correct
74 Correct 334 ms 32616 KB Output is correct
75 Correct 547 ms 43724 KB Output is correct
76 Correct 563 ms 47424 KB Output is correct
77 Correct 548 ms 47292 KB Output is correct
78 Correct 317 ms 39788 KB Output is correct
79 Correct 533 ms 50108 KB Output is correct
80 Correct 577 ms 53436 KB Output is correct
81 Correct 445 ms 46172 KB Output is correct
82 Correct 584 ms 61908 KB Output is correct
83 Correct 103 ms 27004 KB Output is correct
84 Correct 508 ms 50096 KB Output is correct
85 Correct 573 ms 53308 KB Output is correct
86 Correct 462 ms 46036 KB Output is correct
87 Correct 398 ms 47472 KB Output is correct
88 Correct 440 ms 49952 KB Output is correct
89 Correct 500 ms 53300 KB Output is correct
90 Correct 401 ms 46036 KB Output is correct
91 Correct 340 ms 42076 KB Output is correct