oj.uz

Submission #264899

# Submission time Handle Problem Language Result Execution time Memory
264899 2020-08-14T10:58:15 Z _7_7_ Land of the Rainbow Gold (APIO17_rainbow) C++14
35 / 100
 3000 ms 177656 KB 
#include "rainbow.h"
#include <bits/stdc++.h>                                           
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
 
using namespace std;
using namespace __gnu_pbds;
 
//#define int long long
//#pragma GCC optimize("Ofast")
//#pragma comment(linker, "/stack:200000000")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4")
 
 
#define file(s) freopen(s".in","r",stdin); freopen(s".out","w",stdout);
#define fastio ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#define all(x) x.begin(), x.end()
#define sz(s) (int)s.size()
#define pb push_back
#define ppb pop_back
#define mp make_pair
#define s second
#define f first
 
 
 
 
typedef pair < long long, long long > pll;    
typedef pair < int, int > pii;  
typedef unsigned long long ull;         
typedef vector < pii > vpii;                                   	
typedef vector < int > vi;
typedef long double ldb;  
typedef long long ll;  
typedef double db;
 
typedef tree < int, null_type, less < int >, rb_tree_tag, tree_order_statistics_node_update > ordered_set;
 
const int inf = 1e9, maxn = 2e5 + 48, mod = 998244353, N = 2e5 + 12;
const int dx[] = {1, -1, 0, 0}, dy[] = {0, 0, 1, -1}, block = 300;
const pii base = mp(1171, 3307), Mod = mp(1e9 + 7, 1e9 + 9);
const db eps = 1e-12, pi = acos(-1);
const ll INF = 1e18;


int ar, ac, br, bc, ans;
set < pii > q, qq, was;

	
void init(int R, int C, int sr, int sc, int M, char *S) {
	q.insert(mp(sr, sc));

	for (int i = 0; i < M; ++i) {
		if (S[i] == 'N')
			--sr;
		else if (S[i] == 'S')	
			++sr;
		else if (S[i] == 'W')	
			--sc;
		else 
			++sc;	 			
		q.insert(mp(sr, sc));		
	}
}

bool in (int x, int y) {
	return ar <= x && x <= br && ac <= y && y <= bc;
}


void dfs (pii x) {
	was.insert(x);
	for (int i = 0; i < 4; ++i) {
		int tox = x.f + dx[i], toy = x.s + dy[i];
		if (in(tox, toy) && !was.count(mp(tox, toy)) && qq.count(mp(tox, toy)))
			dfs(mp(tox, toy));
	}
}

void Add (int x, int y) {
	for (int i = -1; i <= 1; ++i)
		for (int j = -1; j <= 1; ++j) {
			int tox = x + i, toy = y + j;
			if (in(tox, toy) && !q.count(mp(tox, toy)))
				qq.insert(mp(tox, toy));
		}
}

int colour(int Ar, int Ac, int Br, int Bc) {
	ar = Ar, ac = Ac, br = Br, bc = Bc;

	qq.clear();
	was.clear();
	bool ok1 = 0;
	for (auto x : q)
		if (in(x.f, x.s)) {
			Add(x.f, x.s); 
			ok1 = 1;
		}

	if (!ok1)
		return 1;


	bool ok = 0;
	for (auto x : qq)
		if (x.f == Ar || x.f == Br || x.s == Ac || x.s == Bc) {
			ok = 1; 
			break;
		}

	if (ok) {
		for (int i = Ar; i <= Br; ++i){
		    if (!q.count(mp(i, Ac)))
				qq.insert(mp(i, Ac));
			if (!q.count(mp(i, Bc)))
				qq.insert(mp(i, Bc));
		}

		for (int j = Ac; j <= Bc; ++j) {
			if (!q.count(mp(Ar, j)))
				qq.insert(mp(Ar, j));
			if (!q.count(mp(Br, j)))
				qq.insert(mp(Br, j));
		}			
	}

 
	ans = 0;
	for (auto x : qq)
		if (!was.count(x)) {
			dfs(x);
			++ans;
		}
 

    return ans;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 384 KB Output is correct
2 Correct 212 ms 520 KB Output is correct
3 Correct 70 ms 384 KB Output is correct
4 Correct 96 ms 384 KB Output is correct
5 Correct 231 ms 632 KB Output is correct
6 Correct 1 ms 256 KB Output is correct
7 Correct 0 ms 256 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 0 ms 256 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 180 ms 632 KB Output is correct
12 Correct 250 ms 504 KB Output is correct
13 Correct 533 ms 632 KB Output is correct
14 Correct 468 ms 632 KB Output is correct
15 Correct 1 ms 256 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 0 ms 256 KB Output is correct

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Execution timed out 3060 ms 50852 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 679 ms 58396 KB Output is correct
3 Correct 661 ms 58492 KB Output is correct
4 Correct 709 ms 58488 KB Output is correct
5 Correct 318 ms 28408 KB Output is correct
6 Correct 13 ms 1664 KB Output is correct
7 Correct 72 ms 4728 KB Output is correct
8 Correct 52 ms 6904 KB Output is correct
9 Correct 38 ms 5368 KB Output is correct
10 Correct 29 ms 2808 KB Output is correct
11 Correct 21 ms 2816 KB Output is correct
12 Correct 23 ms 5248 KB Output is correct
13 Correct 24 ms 5248 KB Output is correct
14 Correct 25 ms 5248 KB Output is correct
15 Correct 19 ms 3968 KB Output is correct
16 Correct 13 ms 1408 KB Output is correct
17 Correct 18 ms 2816 KB Output is correct
18 Correct 24 ms 5248 KB Output is correct
19 Correct 840 ms 97144 KB Output is correct
20 Correct 720 ms 73976 KB Output is correct
21 Correct 225 ms 12924 KB Output is correct
22 Correct 201 ms 12284 KB Output is correct
23 Correct 322 ms 38648 KB Output is correct
24 Correct 519 ms 58104 KB Output is correct
25 Correct 469 ms 39672 KB Output is correct
26 Correct 445 ms 39744 KB Output is correct
27 Correct 1694 ms 177656 KB Output is correct
28 Correct 352 ms 29816 KB Output is correct
29 Correct 34 ms 2304 KB Output is correct
30 Correct 71 ms 4856 KB Output is correct
31 Correct 1490 ms 152416 KB Output is correct
32 Correct 1605 ms 160224 KB Output is correct
33 Correct 1620 ms 160164 KB Output is correct

Subtask #4
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 384 KB Output is correct
2 Correct 212 ms 520 KB Output is correct
3 Correct 70 ms 384 KB Output is correct
4 Correct 96 ms 384 KB Output is correct
5 Correct 231 ms 632 KB Output is correct
6 Correct 1 ms 256 KB Output is correct
7 Correct 0 ms 256 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 0 ms 256 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 180 ms 632 KB Output is correct
12 Correct 250 ms 504 KB Output is correct
13 Correct 533 ms 632 KB Output is correct
14 Correct 468 ms 632 KB Output is correct
15 Correct 1 ms 256 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 0 ms 256 KB Output is correct
18 Execution timed out 3062 ms 9104 KB Time limit exceeded
19 Halted 0 ms 0 KB -

Subtask #5
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 384 KB Output is correct
2 Correct 212 ms 520 KB Output is correct
3 Correct 70 ms 384 KB Output is correct
4 Correct 96 ms 384 KB Output is correct
5 Correct 231 ms 632 KB Output is correct
6 Correct 1 ms 256 KB Output is correct
7 Correct 0 ms 256 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 0 ms 256 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 180 ms 632 KB Output is correct
12 Correct 250 ms 504 KB Output is correct
13 Correct 533 ms 632 KB Output is correct
14 Correct 468 ms 632 KB Output is correct
15 Correct 1 ms 256 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 0 ms 256 KB Output is correct
18 Execution timed out 3062 ms 9104 KB Time limit exceeded
19 Halted 0 ms 0 KB -