Submission #1067551

#	Time	Username	Problem	Language	Result	Execution time	Memory
1067551		mispertion	Newspapers (CEOI21_newspapers)	C++17	0 / 100	1 ms	348 KiB

newspapers

#include <bits/stdc++.h>

using namespace std;
#pragma GCC optimize("Ofast")

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
typedef long long ll;
#define int ll
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

#define pb push_back
#define all(x) x.begin(), x.end()
#define sz(x) (int)x.size()
#define mispertion ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define F first
#define S second
#define getlast(s) (*s.rbegin())
#define debg cout << "OK\n"

const ld PI = 3.1415926535;
const int N = 500 + 10;
const int M = 1e5 + 10;
int mod = 998244353;
const int infi = INT_MAX;
const ll infl = 1e16;
const int P = 2;

int mult(int a, int b){
    return a * 1LL * b % mod;
}

int sum(int a, int b){
    if(a + b >= mod)
        return a + b - mod;
    if(a + b < 0)
        return a + b + mod;
    return a + b;
}

int binpow(int a, int n){
    if (n == 0)
        return 1;
    if (n % 2 == 1){
        return mult(binpow(a, n - 1), a);
    }
    else{
        auto b = binpow(a, n / 2);
        return mult(b, b);
    }
}

int n, m;

void solve(){
    cin >> n >> m;
    for(int i = 1; i <= m; i++){
        int y, x;
        cin >> x >> y;
    }
    if(m == n - 1){
        cout << "YES\n";
        cout << 1 << '\n' << 0 << '\n';
    }else{
        cout << "NO\n";
    }
}

signed main(){
    mispertion;
    int t = 1;
    cin >> t;
    while (t--){
        solve();
    }
    return 0;
}

• Subtask 1: 0 / 12
• Subtask 2: 0 / 8
• Subtask 3: 0 / 80