# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1036202 | vjudge1 | Naboj (COCI22_naboj) | C++17 | 442 ms | 20164 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;
int main()
{
int n, m;
cin >> n >> m;
vector<int> G[n + 1];
for(int i = 0; i < m; i++)
{
int u, v;
cin >> u >> v;
G[u].push_back(v);
}
vector<int> topo, zero;
int in[n + 1] = {};
for(int i = 1; i <= n; i ++)
for(int j : G[i])
in[j]++;
for(int i = 1; i <= n; i ++)
if(in[i] == 0)
zero.push_back(i);
while(zero.size())
{
int u = zero.back();
topo.push_back(u);
zero.pop_back();
for(int v : G[u])
{
in[v]--;
if(in[v] == 0)
zero.push_back(v);
}
}
if(topo.size() != n)
cout << -1 << endl;
else
{
cout << n << endl;
for(int i : topo)
cout << i << ' ' << 0 << endl;
}
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... |