oj.uz

답안 #264781

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
264781 2020-08-14T09:32:14 Z _7_7_ 무지개나라 (APIO17_rainbow) C++14
11 / 100
 3000 ms 11648 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 = 1e5 + 512;
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;
bool was[60][60];
set < pii > q;

	
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;
}

int ans;

void dfs (int x, int y) {
	was[x][y] = 1;
	for (int i = 0; i < 4; ++i) {
		int tox = x + dx[i], toy = y + dy[i];
		if (in(tox, toy) && !was[tox][toy] && !q.count(mp(tox, toy))) 
			dfs(tox, toy);		
	}
}

int colour(int Ar, int Ac, int Br, int Bc) {
	ar = Ar, ac = Ac, br = Br, bc = Bc;
	memset(was, 0, sizeof(was));
	ans = 0;
/*	for (auto x : q)
		cerr << x.f << ' ' << x.s << endl;
	cerr << endl;*/
	for (int i = Ar; i <= Br; ++i)
		for (int j = Ac; j <= Bc; ++j)
			if (!was[i][j] && !q.count(mp(i, j))) {
				++ans;
				dfs(i, j);
			}
				
    return ans;
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 384 KB Output is correct
2 Correct 31 ms 384 KB Output is correct
3 Correct 33 ms 512 KB Output is correct
4 Correct 36 ms 384 KB Output is correct
5 Correct 34 ms 384 KB Output is correct
6 Correct 1 ms 256 KB Output is correct
7 Correct 1 ms 256 KB Output is correct
8 Correct 0 ms 256 KB Output is correct
9 Correct 0 ms 256 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 41 ms 512 KB Output is correct
12 Correct 46 ms 504 KB Output is correct
13 Correct 80 ms 516 KB Output is correct
14 Correct 75 ms 384 KB Output is correct
15 Correct 1 ms 256 KB Output is correct
16 Correct 0 ms 256 KB Output is correct
17 Correct 1 ms 256 KB Output is correct

Subtask #2
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Runtime error 25 ms 11648 KB Execution killed with signal 11
4 Halted 0 ms 0 KB -

Subtask #3
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Runtime error 27 ms 10104 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #4
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 384 KB Output is correct
2 Correct 31 ms 384 KB Output is correct
3 Correct 33 ms 512 KB Output is correct
4 Correct 36 ms 384 KB Output is correct
5 Correct 34 ms 384 KB Output is correct
6 Correct 1 ms 256 KB Output is correct
7 Correct 1 ms 256 KB Output is correct
8 Correct 0 ms 256 KB Output is correct
9 Correct 0 ms 256 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 41 ms 512 KB Output is correct
12 Correct 46 ms 504 KB Output is correct
13 Correct 80 ms 516 KB Output is correct
14 Correct 75 ms 384 KB Output is correct
15 Correct 1 ms 256 KB Output is correct
16 Correct 0 ms 256 KB Output is correct
17 Correct 1 ms 256 KB Output is correct
18 Execution timed out 3056 ms 4964 KB Time limit exceeded
19 Halted 0 ms 0 KB -

Subtask #5
0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 384 KB Output is correct
2 Correct 31 ms 384 KB Output is correct
3 Correct 33 ms 512 KB Output is correct
4 Correct 36 ms 384 KB Output is correct
5 Correct 34 ms 384 KB Output is correct
6 Correct 1 ms 256 KB Output is correct
7 Correct 1 ms 256 KB Output is correct
8 Correct 0 ms 256 KB Output is correct
9 Correct 0 ms 256 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 41 ms 512 KB Output is correct
12 Correct 46 ms 504 KB Output is correct
13 Correct 80 ms 516 KB Output is correct
14 Correct 75 ms 384 KB Output is correct
15 Correct 1 ms 256 KB Output is correct
16 Correct 0 ms 256 KB Output is correct
17 Correct 1 ms 256 KB Output is correct
18 Execution timed out 3056 ms 4964 KB Time limit exceeded
19 Halted 0 ms 0 KB -