# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
875281 |
2023-11-18T23:11:16 Z |
Cyber_Wolf |
Naboj (COCI22_naboj) |
C++17 |
|
85 ms |
18656 KB |
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
#define lg long long
#define fastio ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
const lg N = 2e5+5;
vector<lg> adj[N];
lg in[N], state[N];
int main()
{
fastio;
lg n, m;
cin >> n >> m;
for(int i = 0; i < m; i++)
{
lg u, v;
cin >> u >> v;
adj[u].push_back(v);
in[v]++;
}
queue<lg> q;
lg z = 0;
for(int i = 1; i <= n; i++)
{
if(in[i]) continue;
z++;
q.push(i);
}
cout << n << '\n';
vector<lg> a;
while(q.size())
{
lg u = q.front();
q.pop();
lg x = 0;
for(auto it : adj[u])
{
a.push_back(u*2+1);
x++;
in[it]--;
if(!in[it])
{
q.push(it);
z++;
}
}
if(adj[u].empty())
{
a.push_back(u*2);
}
}
if(z < n)
{
cout << "-1\n";
return 0;
}
reverse(a.begin(), a.end());
for(auto it : a) cout << it/2 << ' ' << it%2 << '\n';
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
2 ms |
8028 KB |
Integer parameter [name=c] equals to -1, violates the range [1, 9] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
85 ms |
18656 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
2 ms |
8028 KB |
Integer parameter [name=c] equals to -1, violates the range [1, 9] |
2 |
Halted |
0 ms |
0 KB |
- |