# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
85957 | 2018-11-23T10:56:47 Z | tjdgus4384 | None (KOI17_civilization) | C++14 | 1000 ms | 23008 KB |
#include<cstdio> #include<vector> #include<string.h> using namespace std; int world[2001][2001]; int chk[2001][2001]; int dx[4] = {0, 0, 1, -1}; int dy[4] = {1, -1, 0, 0}; vector<pair<int, int> > v; void dfs(int x, int y) { chk[x][y] = 1; for(int i = 0;i < 4;i++) { int nx = x + dx[i]; int ny = y + dy[i]; if(!chk[nx][ny] && world[nx][ny]) dfs(nx, ny); } } int main() { int n, k, x, y; scanf("%d %d", &n, &k); for(int i = 0;i < k;i++) { scanf("%d %d", &x, &y); v.push_back({x, y}); world[x][y] = 1; } int ans = 0; while(1) { memset(chk, 0, sizeof(chk)); dfs(v[0].first, v[0].second); bool all = false; for(int i = 1;i < v.size();i++) { if(chk[v[i].first][v[i].second] == 0) {all = true;break;} } if(!all) { printf("%d", ans); return 0; } memset(chk, 0, sizeof(chk)); for(int i = 1;i <= n;i++) { for(int j = 1;j <= n;j++) { if(world[i][j] == 1 && !chk[i][j]) { for(int l = 0;l < 4;l++) { if(!world[i + dx[l]][j + dy[l]]) { world[i + dx[l]][j + dy[l]] = 1; chk[i + dx[l]][j + dy[l]] = 1; } } } } } ans++; } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 98 ms | 16532 KB | Output is correct |
2 | Correct | 71 ms | 16532 KB | Output is correct |
3 | Correct | 115 ms | 16676 KB | Output is correct |
4 | Correct | 91 ms | 16792 KB | Output is correct |
5 | Correct | 36 ms | 16792 KB | Output is correct |
6 | Correct | 34 ms | 16792 KB | Output is correct |
7 | Correct | 39 ms | 16904 KB | Output is correct |
8 | Correct | 37 ms | 16944 KB | Output is correct |
9 | Correct | 37 ms | 16944 KB | Output is correct |
10 | Correct | 17 ms | 16944 KB | Output is correct |
11 | Correct | 122 ms | 17196 KB | Output is correct |
12 | Correct | 123 ms | 17196 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 98 ms | 16532 KB | Output is correct |
2 | Correct | 71 ms | 16532 KB | Output is correct |
3 | Correct | 115 ms | 16676 KB | Output is correct |
4 | Correct | 91 ms | 16792 KB | Output is correct |
5 | Correct | 36 ms | 16792 KB | Output is correct |
6 | Correct | 34 ms | 16792 KB | Output is correct |
7 | Correct | 39 ms | 16904 KB | Output is correct |
8 | Correct | 37 ms | 16944 KB | Output is correct |
9 | Correct | 37 ms | 16944 KB | Output is correct |
10 | Correct | 17 ms | 16944 KB | Output is correct |
11 | Correct | 122 ms | 17196 KB | Output is correct |
12 | Execution timed out | 1069 ms | 23008 KB | Time limit exceeded |
13 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 98 ms | 16532 KB | Output is correct |
2 | Correct | 71 ms | 16532 KB | Output is correct |
3 | Correct | 115 ms | 16676 KB | Output is correct |
4 | Correct | 91 ms | 16792 KB | Output is correct |
5 | Correct | 36 ms | 16792 KB | Output is correct |
6 | Correct | 34 ms | 16792 KB | Output is correct |
7 | Correct | 39 ms | 16904 KB | Output is correct |
8 | Correct | 37 ms | 16944 KB | Output is correct |
9 | Correct | 37 ms | 16944 KB | Output is correct |
10 | Correct | 17 ms | 16944 KB | Output is correct |
11 | Correct | 122 ms | 17196 KB | Output is correct |
12 | Execution timed out | 1069 ms | 23008 KB | Time limit exceeded |
13 | Halted | 0 ms | 0 KB | - |