Submission #847092

#	Time	Username	Problem	Language	Result	Execution time	Memory
847092		Pacybwoah	Naboj (COCI22_naboj)	C++17	0 / 110	156 ms	15288 KiB

naboj

#include<iostream>
#include<vector>
#include<queue>
#include<utility>
#include<algorithm>
using namespace std;
int main(){
    int n,m;
    cin>>n>>m;
    vector<int> deg(n+1);
    vector<vector<int> > graph(n+1);
    int a,b;
    for(int i=0;i<m;i++){
        cin>>a>>b;
        deg[b]++;
        graph[a].push_back(b);
    }
    vector<int> topo;
    queue<int> q;
    for(int i=1;i<=n;i++) if(deg[i]==0) q.push(i);
    while(!q.empty()){
        int node=q.front();
        q.pop();
        topo.push_back(node);
        for(auto x:graph[node]){
            deg[x]--;
            if(deg[x]==0) q.push(x);
        }
    }
    if(topo.size()!=n) cout<<-1;
    else for(auto x:topo) cout<<x<<' '<<0<<"\n";
}

Compilation message (stderr)

naboj.cpp: In function 'int main()':
naboj.cpp:30:19: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   30 |     if(topo.size()!=n) cout<<-1;
      |        ~~~~~~~~~~~^~~

• Subtask 1: 0 / 15
• Subtask 2: 0 / 25
• Subtask 3: 0 / 70