답안 #605605

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
605605	2022-07-25T19:31:44 Z	Itamar	Newspapers (CEOI21_newspapers)	C++14	4 / 100	1 ms	340 KB

newspapers

#include <map>
#include <iostream>
#include <random>
using namespace std;
#include <vector>
#include <queue>
#include <set>
#include <algorithm>
#define ll long long
#define vi vector<int> 
#define vll vector<ll>
#define pi pair<int,int> 
#define pll pair<ll,ll>
#include <string>
#include <cassert>

int main()
{
    int n, m;
    cin >> n >> m;
    vector<vi> fr(n);
    for (int i = 0; i < m; i++) {
        int a, b;
        cin >> a >> b;
        a--, b--;
        fr[a].push_back(b);
        fr[b].push_back(a);
    }
    if (m == n - 1) {
        cout << "YES";
        cout << "\n" << 1 << "\n" << 1;
    }
    else
        cout << "NO";
}

Subtask #1

0.0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Partially correct	1 ms	212 KB	Failed to provide a successful strategy.
3	Partially correct	1 ms	212 KB	Failed to provide a successful strategy.
4	Partially correct	1 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	Correct	0 ms	212 KB	Output is correct
8	Partially correct	0 ms	212 KB	Failed to provide a successful strategy.
9	Incorrect	1 ms	212 KB	Output isn't correct
10	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	1 ms	304 KB	Failed to provide a successful strategy.
4	Partially correct	1 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	1 ms	212 KB	Failed to provide a successful strategy.
10	Partially correct	1 ms	300 KB	Failed to provide a successful strategy.
11	Partially correct	1 ms	340 KB	Failed to provide a successful strategy.
12	Partially correct	1 ms	300 KB	Failed to provide a successful strategy.
13	Partially correct	1 ms	212 KB	Failed to provide a successful strategy.
14	Partially correct	1 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	300 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	304 KB	Failed to provide a successful strategy.
20	Partially correct	1 ms	304 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	1 ms	212 KB	Failed to provide a successful strategy.
3	Partially correct	1 ms	212 KB	Failed to provide a successful strategy.
4	Partially correct	1 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	Correct	0 ms	212 KB	Output is correct
8	Partially correct	0 ms	212 KB	Failed to provide a successful strategy.
9	Incorrect	1 ms	212 KB	Output isn't correct
10	Halted	0 ms	0 KB	-