oj.uz

답안 #752583

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
752583 2023-06-03T09:08:57 Z 이동현(#9968) Newspapers (CEOI21_newspapers) C++17
4 / 100
 1 ms 340 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#define int long long
#define mi(x, y) (x = min(x, y))
#define ma(x, y) (x = max(x, y))
using namespace std;

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);

    int n, m;
    cin >> n >> m;
    vector<vector<int>> way(n);
    vector<int> deg(n);
    for(int i = 0; i < m; ++i){
        int x, y;
        cin >> x >> y;
        --x, --y;
        way[x].push_back(y);
        way[y].push_back(x);
        ++deg[x], ++deg[y];
    }
    if(m != n - 1){
        cout << "NO\n";
        return 0;
    }
    int can = 1;
    int rt = -1, mx = -1;
    for(int i = 0; i < n; ++i){
        if(deg[i] > mx){
            mx = deg[i];
            rt = i;
        }
    }

    int cnt = 0;
    for(auto&nxt:way[rt]){
        cnt += (deg[nxt] > 1);
    }
    if(cnt > 1) can = 0;
    for(int i = 0; i < n; ++i){
        if(i != rt && deg[i] > 2){
            can = 0;
        }
    }

    if(can || (*max_element(deg.begin(), deg.end())) == 2){
        cout << "YES\n1\n1\n";
    }
    else{
        cout << "NO\n";
    }
    
    return 0;
}

Subtask #1
0.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Partially correct 0 ms 212 KB Failed to provide a successful strategy.
3 Partially correct 0 ms 212 KB Failed to provide a successful strategy.
4 Partially correct 0 ms 212 KB Failed to provide a successful strategy.
5 Partially correct 0 ms 212 KB Failed to provide a successful strategy.
6 Incorrect 0 ms 212 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #2
4.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Partially correct 0 ms 212 KB Failed to provide a successful strategy.
3 Partially correct 0 ms 212 KB Failed to provide a successful strategy.
4 Partially correct 0 ms 212 KB Failed to provide a successful strategy.
5 Partially correct 0 ms 212 KB Failed to provide a successful strategy.
6 Partially correct 1 ms 212 KB Failed to provide a successful strategy.
7 Partially correct 0 ms 212 KB Failed to provide a successful strategy.
8 Partially correct 0 ms 212 KB Failed to provide a successful strategy.
9 Partially correct 0 ms 212 KB Failed to provide a successful strategy.
10 Partially correct 0 ms 212 KB Failed to provide a successful strategy.
11 Partially correct 1 ms 340 KB Failed to provide a successful strategy.
12 Partially correct 0 ms 340 KB Failed to provide a successful strategy.
13 Partially correct 1 ms 340 KB Failed to provide a successful strategy.
14 Partially correct 0 ms 340 KB Failed to provide a successful strategy.
15 Partially correct 1 ms 340 KB Failed to provide a successful strategy.
16 Partially correct 1 ms 340 KB Failed to provide a successful strategy.
17 Partially correct 1 ms 340 KB Failed to provide a successful strategy.
18 Partially correct 1 ms 340 KB Failed to provide a successful strategy.
19 Partially correct 1 ms 340 KB Failed to provide a successful strategy.
20 Partially correct 0 ms 340 KB Failed to provide a successful strategy.

Subtask #3
0.0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Partially correct 0 ms 212 KB Failed to provide a successful strategy.
3 Partially correct 0 ms 212 KB Failed to provide a successful strategy.
4 Partially correct 0 ms 212 KB Failed to provide a successful strategy.
5 Partially correct 0 ms 212 KB Failed to provide a successful strategy.
6 Incorrect 0 ms 212 KB Output isn't correct
7 Halted 0 ms 0 KB -