# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1047259 | 2024-08-07T11:28:58 Z | sleepntsheep | Newspapers (CEOI21_newspapers) | C | 1 ms | 348 KB |
#include <stdio.h> #include <stdlib.h> #define N 1005 int eo[N], *eh[N]; void pus(int i, int j) { int o = eo[i]++; if (!o) eh[i] = (int*)malloc(2 * sizeof **eh); else if (0 == (o & o - 1)) eh[i] = (int*)realloc(eh[i], 2 * o * sizeof **eh); eh[i][o] = j; } int n, m, col[N]; int dfs(int u, int p) { col[u] = 1; for (int v, j = 0; j < eo[u]; ++j) if ((v = eh[u][j]) != p) { if (col[v]) return 1; if (dfs(v, u)) return 1; } return 0; } int main() { scanf("%d%d", &n, &m); for (int u, v, i = 0; i < m; ++i) scanf("%d%d", &u, &v), pus(u, v), pus(v, u); if (dfs(1, 1)) { //puts("NO"); return 0; } puts("YES"); puts("1\n1"); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 344 KB | Output is correct |
2 | Partially correct | 0 ms | 348 KB | Failed to provide a successful strategy. |
3 | Partially correct | 0 ms | 348 KB | Failed to provide a successful strategy. |
4 | Partially correct | 0 ms | 348 KB | Failed to provide a successful strategy. |
5 | Partially correct | 0 ms | 348 KB | Failed to provide a successful strategy. |
6 | Partially correct | 0 ms | 348 KB | Failed to provide a successful strategy. |
7 | Incorrect | 0 ms | 348 KB | Unexpected end of file - token expected |
8 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Partially correct | 0 ms | 348 KB | Failed to provide a successful strategy. |
3 | Partially correct | 0 ms | 348 KB | Failed to provide a successful strategy. |
4 | Partially correct | 0 ms | 348 KB | Failed to provide a successful strategy. |
5 | Partially correct | 0 ms | 348 KB | Failed to provide a successful strategy. |
6 | Partially correct | 0 ms | 348 KB | Failed to provide a successful strategy. |
7 | Partially correct | 0 ms | 344 KB | Failed to provide a successful strategy. |
8 | Partially correct | 0 ms | 348 KB | Failed to provide a successful strategy. |
9 | Partially correct | 0 ms | 348 KB | Failed to provide a successful strategy. |
10 | Partially correct | 0 ms | 348 KB | Failed to provide a successful strategy. |
11 | Partially correct | 0 ms | 348 KB | Failed to provide a successful strategy. |
12 | Partially correct | 0 ms | 348 KB | Failed to provide a successful strategy. |
13 | Partially correct | 0 ms | 348 KB | Failed to provide a successful strategy. |
14 | Partially correct | 0 ms | 344 KB | Failed to provide a successful strategy. |
15 | Partially correct | 1 ms | 344 KB | Failed to provide a successful strategy. |
16 | Partially correct | 0 ms | 348 KB | Failed to provide a successful strategy. |
17 | Partially correct | 0 ms | 348 KB | Failed to provide a successful strategy. |
18 | Partially correct | 0 ms | 344 KB | Failed to provide a successful strategy. |
19 | Partially correct | 0 ms | 348 KB | Failed to provide a successful strategy. |
20 | Partially correct | 0 ms | 348 KB | Failed to provide a successful strategy. |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 344 KB | Output is correct |
2 | Partially correct | 0 ms | 348 KB | Failed to provide a successful strategy. |
3 | Partially correct | 0 ms | 348 KB | Failed to provide a successful strategy. |
4 | Partially correct | 0 ms | 348 KB | Failed to provide a successful strategy. |
5 | Partially correct | 0 ms | 348 KB | Failed to provide a successful strategy. |
6 | Partially correct | 0 ms | 348 KB | Failed to provide a successful strategy. |
7 | Incorrect | 0 ms | 348 KB | Unexpected end of file - token expected |
8 | Halted | 0 ms | 0 KB | - |