Submission #981732

#	Time	Username	Problem	Language	Result	Execution time	Memory
981732		De3b0o	Newspapers (CEOI21_newspapers)	C++14	4 / 100	1 ms	468 KiB

newspapers

#pragma GCC optimize("Ofast")
#pragma GCC target("avx2")
#include<bits/stdc++.h>
#define ll long long
#define F first
#define S second
#define in insert
#define pb push_back
#define ppb pop_back()
#define d3 ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define cans cout << ans << "\n";
#define yes cout << "Yes" << "\n";
#define no cout << "No" << "\n";
#define pll pair<ll,ll>
#define lin cout << "\n";
#define sqr 340
#define mod 1000000007
#define mid ((l+r)/2)
#define lc (2*n)
#define rc (2*n+1)

using namespace std;

ll fp(ll x , ll y)
{
    if(y==0)
        return 1;
    ll z = fp(x,y/2);
    if(y&1)
        return z*z%mod*x%mod;
    else
        return z*z%mod;
}

int sqrot(ll x)
{
    int l = 0 , r = INT_MAX;
    while(l<=r)
    {
        if(mid*mid>=x)
            r=mid-1;
        else
            l=mid+1;
    }
    return r+1;
}

ll cel(ll x , ll y)
{
    return x/y + bool(x%y);
}

ll n , m ;
pll ed[1000009];

int main()
{
    d3
    cin >> n >> m;
    for(int i = 0 ; m>i ; i++)
        cin >> ed[i].F >> ed[i].S;
    if(m==n-1)
    {
        cout << "YES\n";
        cout << 1 << "\n";
        cout << 1 << "\n";
    }
    else
        cout << "NO\n";
}

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