oj.uz

답안 #57355

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
57355 2018-07-14T15:46:20 Z joaogui1 무지개나라 (APIO17_rainbow) C++14
11 / 100
 19 ms 992 KB 
#include <bits/stdc++.h>
#define ff first
#define ss second

using namespace std;
typedef pair<int, int> pii;

int g[64][64], c[64][64], cnt = 1;

void init(int r, int c, int sr, int sc, int m, char* s){
  for(int i = 1; i <= r; ++i)
    for(int j = 1; j <= c; ++j)
      g[i][j] = 1;
  g[sr][sc] = 0;
  for(int i = 0; i < m; ++i){
    if(s[i] == 'N') --sr;
    if(s[i] == 'S') ++sr;
    if(s[i] == 'E') ++sc;
    if(s[i] == 'W') --sc;
    g[sr][sc] = 0;
  }

}

int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};

void dfs(pii u, int co){
  pii v;
  c[u.ff][u.ss] = co;
  for(int i = 0; i < 4; ++i){
    v.ff = u.ff + dx[i], v.ss = u.ss + dy[i];
    if(c[v.ff][v.ss] != co && g[v.ff][v.ss])  dfs(v, co);
  }
}

int colour(int ar, int ac, int br, int bc){
  int ans = 0;
  for(int i = ar; i <= br; ++i)  c[i][ac - 1] = c[i][bc + 1] = cnt;
  for(int i = ac; i <= bc; ++i)  c[ar - 1][i] = c[br + 1][i] = cnt;

  for(int i = ar; i <= br; ++i)
    for(int j = ac; j <= bc; ++j)
      if(c[i][j] != cnt && g[i][j])
        dfs(pii(i, j), cnt), ++ans;
  ++cnt;
  return ans;
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 9 ms 488 KB Output is correct
3 Correct 19 ms 556 KB Output is correct
4 Correct 16 ms 752 KB Output is correct
5 Correct 10 ms 752 KB Output is correct
6 Correct 2 ms 752 KB Output is correct
7 Correct 3 ms 752 KB Output is correct
8 Correct 3 ms 752 KB Output is correct
9 Correct 2 ms 752 KB Output is correct
10 Correct 3 ms 752 KB Output is correct
11 Correct 15 ms 752 KB Output is correct
12 Correct 19 ms 776 KB Output is correct
13 Correct 11 ms 776 KB Output is correct
14 Correct 9 ms 776 KB Output is correct
15 Correct 3 ms 776 KB Output is correct
16 Correct 2 ms 776 KB Output is correct
17 Correct 3 ms 776 KB Output is correct

Subtask #2
0 / 12.0

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