oj.uz

답안 #999114

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
999114 2024-06-15T06:51:03 Z crafticat Newspapers (CEOI21_newspapers) C++17
4 / 100
 1 ms 348 KB 
#include <bits/stdc++.h>

using namespace std;

int main() {
    ios_base::sync_with_stdio(false); cin.tie(nullptr);

    int n, m; cin >> n >> m;

    vector<vector<int>> g(n + 1);
    for (int i = 0; i < m; ++i) {
        int a, b; cin >> a >> b;
        g[a].push_back(b);
        g[b].push_back(a);
    }
    bool binary = true;
    int spec = 1;
    for (int i = 1; i <= n; ++i) {
        if (g[i].size() == 3) spec++;
        if (g[i].size() > 3) binary = false;
    }
    if (spec > 1) binary = false;

    if (m != n - 1) {
        cout << "NO\n";
    } else {
        cout << "YES\n";
        cout << "1\n";
        cout << "1\n";
    }

    return 0;
}

Compilation message

newspapers.cpp: In function 'int main()':
newspapers.cpp:16:10: warning: variable 'binary' set but not used [-Wunused-but-set-variable]
   16 |     bool binary = true;
      |          ^~~~~~

Subtask #1
0.0 / 12.0

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

Subtask #2
4.0 / 8.0

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