oj.uz

답안 #1047264

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1047264 2024-08-07T11:30:02 Z sleepntsheep Newspapers (CEOI21_newspapers) C
4 / 100
 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 (m > n - 1) {
    puts("NO");
    return 0;
  }

  if (dfs(1, 1)) {
    //puts("NO");
    return 0;
  }

  puts("YES");
  puts("1\n1");
}

Compilation message

newspapers.c: In function 'pus':
newspapers.c:12:24: warning: suggest parentheses around '-' in operand of '&' [-Wparentheses]
   12 |   else if (0 == (o & o - 1)) eh[i] = (int*)realloc(eh[i], 2 * o * sizeof **eh);
      |                      ~~^~~
newspapers.c: In function 'main':
newspapers.c:30:3: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   30 |   scanf("%d%d", &n, &m);
      |   ^~~~~~~~~~~~~~~~~~~~~
newspapers.c:32:5: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   32 |     scanf("%d%d", &u, &v), pus(u, v), pus(v, u);
      |     ^~~~~~~~~~~~~~~~~~~~~

Subtask #1
0.0 / 12.0

# 결과 실행 시간 메모리 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 Correct 0 ms 348 KB Output is correct
8 Partially correct 0 ms 348 KB Failed to provide a successful strategy.
9 Incorrect 0 ms 344 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #2
4.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Partially correct 1 ms 344 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 348 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 1 ms 344 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 348 KB Failed to provide a successful strategy.
15 Partially correct 1 ms 348 KB Failed to provide a successful strategy.
16 Partially correct 1 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 348 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.

Subtask #3
0.0 / 80.0

# 결과 실행 시간 메모리 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 Correct 0 ms 348 KB Output is correct
8 Partially correct 0 ms 348 KB Failed to provide a successful strategy.
9 Incorrect 0 ms 344 KB Output isn't correct
10 Halted 0 ms 0 KB -