Submission #603763

#	Time	Username	Problem	Language	Result	Execution time	Memory
603763		Theo830	Newspapers (CEOI21_newspapers)	C++17	0 / 100	0 ms	212 KiB

newspapers

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1e9+7;
const ll MOD = 998244353;
typedef pair<ll,ll> ii;
#define iii pair<ll,ii>
#define f(i,a,b) for(ll i = a;i < b;i++)
#define pb push_back
#define vll vector<ll>
#define F first
#define S second
#define all(x) (x).begin(), (x).end()
///I hope I will get uprating and don't make mistakes
///I will never stop programming
///sqrt(-1) Love C++
///Please don't hack me
///@TheofanisOrfanou Theo830
///Think different approaches (bs,dp,greedy,graphs,shortest paths,mst)
///Stay Calm
///Look for special cases
///Beware of overflow and array bounds
///Think the problem backwards
///Training
int main(void){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    ll n,m;
    cin>>n>>m;
    ll maxi = 2;
    ll deg[n+1] = {0};
    f(i,0,m){
        ll a,b;
        cin>>a>>b;
        deg[a]++;
        deg[b]++;
        maxi = max(maxi,deg[a]);
        maxi = max(maxi,deg[b]);
    }
    if(m == n-1 && maxi == 2){
        cout<<"YES\n";
        cout<<"0\n";
    }
    else{
        cout<<"NO\n";
    }
}

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