oj.uz

Submission #605601

# Submission time Handle Problem Language Result Execution time Memory
605601 2022-07-25T19:29:37 Z Itamar Newspapers (CEOI21_newspapers) C++14
0 / 100
 1 ms 340 KB 
#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 < n; 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";
    else
        cout << "NO";
}

Subtask #1
0.0 / 12.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 340 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #2
0.0 / 8.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 340 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #3
0.0 / 80.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 340 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -