# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
959988 | 2024-04-09T11:52:54 Z | pcc | Povjerenstvo (COI22_povjerenstvo) | C++17 | 117 ms | 39880 KB |
#include <bits/stdc++.h> using namespace std; #pragma GCC optimize("O3,unroll-loops") #pragma GCC target("avx2,popcnt,sse4") #define pii pair<int,int> #define fs first #define sc second #define ll long long const int mxn = 5e5+10; int N,M; vector<int> paths[mxn]; int deg[mxn]; queue<int> q; int ans[mxn]; int main(){ ios::sync_with_stdio(0);cin.tie(0);cout.tie(0); cin>>N>>M; memset(ans,-1,sizeof(ans)); for(int i = 1;i<=M;i++){ int a,b; cin>>a>>b; deg[a]++; paths[b].push_back(a); } for(int i = 1;i<=N;i++)if(!deg[i])q.push(i); while(!q.empty()){ auto now = q.front(); q.pop(); if(ans[now] == -1)ans[now] = 1; for(auto nxt:paths[now]){ deg[nxt]--; if(!deg[nxt])q.push(nxt); if(ans[now]){ if(ans[nxt] == -1)ans[nxt] = 0; else{ cout<<-1; return 0; } } } } vector<int> v; for(int i = 1;i<=N;i++){ if(ans[i] == 1)v.push_back(i); } cout<<v.size()<<'\n'; for(auto &i:v)cout<<i<<' ';cout<<'\n'; return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 102 ms | 39880 KB | Output is correct |
2 | Correct | 117 ms | 39880 KB | Output is correct |
3 | Correct | 4 ms | 15944 KB | Output is correct |
4 | Correct | 39 ms | 23116 KB | Output is correct |
5 | Correct | 62 ms | 30872 KB | Output is correct |
6 | Incorrect | 74 ms | 36176 KB | Output isn't correct |
7 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 98 ms | 39868 KB | Output is correct |
2 | Incorrect | 70 ms | 36688 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 5 ms | 16216 KB | Output is correct |
2 | Incorrect | 5 ms | 16220 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 102 ms | 39880 KB | Output is correct |
2 | Correct | 117 ms | 39880 KB | Output is correct |
3 | Correct | 4 ms | 15944 KB | Output is correct |
4 | Correct | 39 ms | 23116 KB | Output is correct |
5 | Correct | 62 ms | 30872 KB | Output is correct |
6 | Incorrect | 74 ms | 36176 KB | Output isn't correct |
7 | Halted | 0 ms | 0 KB | - |