# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
959990 | pcc | Povjerenstvo (COI22_povjerenstvo) | C++17 | 219 ms | 39628 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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] == 1){
if(ans[nxt] == -1)ans[nxt] = 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 (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |