oj.uz

Submission #531253

# Submission time Handle Problem Language Result Execution time Memory
531253 2022-02-28T09:16:23 Z 79brue Newspapers (CEOI21_newspapers) C++14
4 / 100
 82 ms 492 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

int n, m;
vector<int> link[1002];

int dfs(int x, int par = -1){
    vector<int> vec (1, 0);
    for(auto y: link[x]){
        if(y==par) continue;
        int tmp = dfs(y, x);
        vec.push_back(tmp+1);
    }

    sort(vec.rbegin(), vec.rend());
    if(par == -1){
        if(vec.size() >= 3 && vec[2] >= 2){
            puts("NO");
            exit(0);
        }
    }
    return vec[0];
}

int main(){
    scanf("%d %d", &n, &m);
    if(m!=n-1){
        puts("NO");
        return 0;
    }

    for(int i=1; i<n; i++){
        int x, y;
        scanf("%d %d", &x, &y);
        link[x].push_back(y), link[y].push_back(x);
    }

    for(int i=1; i<=n; i++){
        dfs(i);
    }

    printf("YES\n2\n1 1");
}

Compilation message

newspapers.cpp: In function 'int main()':
newspapers.cpp:29:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   29 |     scanf("%d %d", &n, &m);
      |     ~~~~~^~~~~~~~~~~~~~~~~
newspapers.cpp:37:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   37 |         scanf("%d %d", &x, &y);
      |         ~~~~~^~~~~~~~~~~~~~~~~

Subtask #1
0.0 / 12.0

# Verdict Execution time Memory Grader output
1 Partially correct 0 ms 204 KB Provide a successful but not optimal strategy.
2 Correct 1 ms 316 KB Output is correct
3 Partially correct 0 ms 204 KB Failed to provide a successful strategy.
4 Partially correct 0 ms 204 KB Failed to provide a successful strategy.
5 Correct 0 ms 312 KB Output is correct
6 Partially correct 0 ms 312 KB Failed to provide a successful strategy.
7 Correct 0 ms 204 KB Output is correct
8 Incorrect 0 ms 204 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #2
4.0 / 8.0

# Verdict Execution time Memory Grader output
1 Partially correct 1 ms 204 KB Provide a successful but not optimal strategy.
2 Correct 0 ms 204 KB Output is correct
3 Partially correct 0 ms 204 KB Failed to provide a successful strategy.
4 Partially correct 0 ms 204 KB Failed to provide a successful strategy.
5 Partially correct 0 ms 312 KB Failed to provide a successful strategy.
6 Partially correct 1 ms 204 KB Failed to provide a successful strategy.
7 Partially correct 1 ms 204 KB Failed to provide a successful strategy.
8 Partially correct 0 ms 204 KB Failed to provide a successful strategy.
9 Partially correct 1 ms 312 KB Failed to provide a successful strategy.
10 Partially correct 1 ms 316 KB Failed to provide a successful strategy.
11 Partially correct 53 ms 460 KB Failed to provide a successful strategy.
12 Partially correct 19 ms 460 KB Failed to provide a successful strategy.
13 Partially correct 22 ms 416 KB Failed to provide a successful strategy.
14 Partially correct 25 ms 428 KB Failed to provide a successful strategy.
15 Partially correct 29 ms 332 KB Failed to provide a successful strategy.
16 Partially correct 82 ms 460 KB Failed to provide a successful strategy.
17 Partially correct 58 ms 460 KB Failed to provide a successful strategy.
18 Partially correct 60 ms 492 KB Failed to provide a successful strategy.
19 Partially correct 61 ms 472 KB Failed to provide a successful strategy.
20 Partially correct 62 ms 468 KB Failed to provide a successful strategy.

Subtask #3
0.0 / 80.0

# Verdict Execution time Memory Grader output
1 Partially correct 0 ms 204 KB Provide a successful but not optimal strategy.
2 Correct 1 ms 316 KB Output is correct
3 Partially correct 0 ms 204 KB Failed to provide a successful strategy.
4 Partially correct 0 ms 204 KB Failed to provide a successful strategy.
5 Correct 0 ms 312 KB Output is correct
6 Partially correct 0 ms 312 KB Failed to provide a successful strategy.
7 Correct 0 ms 204 KB Output is correct
8 Incorrect 0 ms 204 KB Output isn't correct
9 Halted 0 ms 0 KB -