답안 #993488

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
993488	2024-06-05T19:34:48 Z	yoav_s	Newspapers (CEOI21_newspapers)	C++17	4 / 100	1 ms	456 KB

newspapers

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef vector<ll> v;
typedef vector<v> vv;
typedef vector<vv> vvv;
typedef pair<ll,ll> p;
typedef vector<p> vp;
typedef vector<vp> vvp;
typedef vector<vvp> vvvp;
typedef pair<ll, p> tri;
typedef vector<tri> vtri;
typedef vector<vtri> vvtri;
typedef vector<vvtri> vvvtri;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<vvb> vvvb;

#define f first
#define s second
#define pb push_back
#define eb emplace_back
#define all(v) (v).begin(),(v).end()

const ll INF = 1e18;
const ll mod = 1e9 + 7;

int main()
{
    ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
    ll N, M;
    cin >> N >> M;
    vv graph(N);
    for (ll i = 0; i < N - 1; i++)
    {
        ll a, b;
        cin >> a >> b; a--; b--;
        graph[a].pb(b); graph[b].pb(a);
    }
    if (M == N - 1) cout << "YES\n1\n1\n";
    else cout << "NO\n";
    return 0;
}

Subtask #1

0.0 / 12.0

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

Subtask #3

0.0 / 80.0

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