oj.uz

답안 #258092

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
258092 2020-08-05T10:48:50 Z mohammad 무지개나라 (APIO17_rainbow) C++14
11 / 100
 226 ms 55472 KB 
#include "rainbow.h"
#include<bits/stdc++.h>
using namespace std;
 
#define endl "\n"
#define OR |
typedef long long ll ;
const ll ooo = 1e14 ;
const ll oo = 2e9 ;
const double PI = acos(-1) ;
const ll M = 1e9 + 7  ;
const int N = 10000010  ;

int r[4] = {1 , -1 , 0 , 0} ,
	c[4] = {0 , 0 , 1 , -1} ;
map<char,int> mp;
bool vis[52][52];
int ln , lm , rn , rm;
string g[52];

void init(int R, int C, int sr, int sc, int M, char *S) {
	mp['N'] = 1;
	mp['S'] = 0;
	mp['E'] = 2;
	mp['W'] = 3;
	for(int i = 1 ; i <= R ; ++i)
		for(int j = 0 ; j <= C ; ++j) g[i] += '.';
	g[sr][sc] = '#';
	for(int i = 0 ; i < M ; ++i){
		sr += r[mp[S[i]]];
		sc += c[mp[S[i]]];
		g[sr][sc] = '#';
	}
}

void dfs(int i , int j){
	if(i == ln - 1 or j == lm - 1 or i == rn + 1 or j == rm + 1) return;
	if(g[i][j] == '#' or vis[i][j])return;
	vis[i][j] = 1;
	for(int k = 0 ; k < 4; ++k){
		dfs(i + r[k] , j + c[k]);
	}
}

// 	g++ -Wall -lm -static -DEVAL -o rainbow -O2 rainbow.cpp grader.cpp -std=c++14
int colour(int ar, int ac, int br, int bc) {
	int ans = 0 ;
	ln = ar;
	lm = ac;
	rn = br;
	rm = bc;
	for(int i = ar ; i <= br ; ++i)
    	for(int j = ac ; j <= bc ; ++j) vis[i][j] = 0;
    for(int i = ar ; i <= br ; ++i)
    	for(int j = ac ; j <= bc ; ++j){
    		if(g[i][j] == '#' or vis[i][j]) continue;
    		ans++;
    		dfs(i , j);
    	}
    return ans ;
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 7 ms 384 KB Output is correct
3 Correct 18 ms 384 KB Output is correct
4 Correct 18 ms 384 KB Output is correct
5 Correct 6 ms 384 KB Output is correct
6 Correct 0 ms 256 KB Output is correct
7 Correct 0 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 0 ms 256 KB Output is correct
11 Correct 15 ms 384 KB Output is correct
12 Correct 13 ms 384 KB Output is correct
13 Correct 9 ms 384 KB Output is correct
14 Correct 6 ms 384 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 1 ms 256 KB Output is correct
17 Correct 1 ms 256 KB Output is correct

Subtask #2
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Runtime error 5 ms 1696 KB Execution killed with signal 11 (could be triggered by violating memory limits)
4 Halted 0 ms 0 KB -

Subtask #3
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 256 KB Output is correct
2 Runtime error 226 ms 55472 KB Execution killed with signal 11 (could be triggered by violating memory limits)
3 Halted 0 ms 0 KB -

Subtask #4
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 7 ms 384 KB Output is correct
3 Correct 18 ms 384 KB Output is correct
4 Correct 18 ms 384 KB Output is correct
5 Correct 6 ms 384 KB Output is correct
6 Correct 0 ms 256 KB Output is correct
7 Correct 0 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 0 ms 256 KB Output is correct
11 Correct 15 ms 384 KB Output is correct
12 Correct 13 ms 384 KB Output is correct
13 Correct 9 ms 384 KB Output is correct
14 Correct 6 ms 384 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 1 ms 256 KB Output is correct
17 Correct 1 ms 256 KB Output is correct
18 Runtime error 2 ms 1280 KB Execution killed with signal 11 (could be triggered by violating memory limits)
19 Halted 0 ms 0 KB -

Subtask #5
0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 7 ms 384 KB Output is correct
3 Correct 18 ms 384 KB Output is correct
4 Correct 18 ms 384 KB Output is correct
5 Correct 6 ms 384 KB Output is correct
6 Correct 0 ms 256 KB Output is correct
7 Correct 0 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 0 ms 256 KB Output is correct
11 Correct 15 ms 384 KB Output is correct
12 Correct 13 ms 384 KB Output is correct
13 Correct 9 ms 384 KB Output is correct
14 Correct 6 ms 384 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 1 ms 256 KB Output is correct
17 Correct 1 ms 256 KB Output is correct
18 Runtime error 2 ms 1280 KB Execution killed with signal 11 (could be triggered by violating memory limits)
19 Halted 0 ms 0 KB -