# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
785728 | 2023-07-17T13:48:15 Z | gagik_2007 | Newspapers (CEOI21_newspapers) | C++17 | 4 ms | 7412 KB |
#include <bits/stdc++.h> using namespace std; typedef long long ll; typedef long double ld; typedef pair<int, int> pii; typedef pair<ll, ll> pll; #define ff first #define ss second ll ttt; const ll INF=1e18; const ll MOD=1e9+7; const ll N=300007; ll n,m,k; vector<ll>g[N]; ll sz[N]; void dfs(int v, int par=-1){ // cout<<"YOO"<<endl; sz[v]=1; for(int to:g[v]){ if(to!=par){ dfs(to,v); sz[v]+=sz[to]; } } } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); freopen("output.txt","w",stdout); freopen("input.txt","r",stdin); cin>>n>>m; if(m!=n-1)cout<<"NO\n"; for(int i=0;i<m;i++){ int x,y; cin>>x>>y; g[x].push_back(y); g[y].push_back(x); } for(int v=1;v<=n;v++){ dfs(v); int cnt=0; for(int to:g[v]){ cnt+=(sz[to]>1); } if(cnt>2){ cout<<"NO\n"; return 0; } } cout<<"YES 1 1\n"; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 4 ms | 7380 KB | Unexpected end of file - token expected |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 4 ms | 7412 KB | Unexpected end of file - token expected |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 4 ms | 7380 KB | Unexpected end of file - token expected |
2 | Halted | 0 ms | 0 KB | - |