oj.uz

답안 #264850

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
264850 2020-08-14T10:33:33 Z _7_7_ 무지개나라 (APIO17_rainbow) C++14
0 / 100
 841 ms 58716 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;

	for (auto x : q)
		Add(x.f, x.s);


	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 - 1; i <= Br + 1; ++i) {
			Add(i, Ac - 1); 
			Add(i, Bc + 1); 	
		}
	
		for (int j = Ac - 1; j <= Bc + 1; ++j) {
			Add(Ar - 1, j); 
			Add(Br + 1, j); 	
		}
	}

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

    return ans;
}

Subtask #1
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 42 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 256 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 841 ms 58404 KB Output is correct
3 Correct 813 ms 58716 KB Output is correct
4 Correct 831 ms 58488 KB Output is correct
5 Correct 364 ms 28408 KB Output is correct
6 Incorrect 13 ms 1664 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #4
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 42 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 42 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -