# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
782464 | 2023-07-14T02:41:09 Z | andecaandeci | Naboj (COCI22_naboj) | C++17 | 75 ms | 13072 KB |
#include <bits/stdc++.h> using namespace std; typedef long long ll; const ll MAXN = 2e5 + 5; const ll MAXM = 5e5 + 5; ll n, m; vector<ll> adjl[MAXN], ans; bool visited[MAXN], flag = false; void dfs(ll now) { if (visited[now]) { flag = true; return ; } visited[now] = true; vector<ll> adjn = adjl[now]; for (int i = 0; i < adjn.size(); ++i) { ll nxt = adjn[i]; if (visited[nxt]) { continue ; } dfs(nxt); if (flag) { return ; } } ans.push_back(now); } int main(){ ios_base::sync_with_stdio(false); cin.tie(0); cin >> n >> m; for (int i = 0; i < m; ++i) { ll tmpa, tmpb; cin >> tmpa >> tmpb; adjl[tmpb].push_back(tmpa); } for (int i = 1; i <= n; ++i) { if (visited[i]) { continue ; } dfs(i); } if (flag) { cout << "-1\n"; return 0; } cout << ans.size() << "\n"; for (int i = ans.size()-1; i >= 0 ; --i) { cout << ans[i] << " 1\n"; } return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 4948 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 75 ms | 12964 KB | Output is correct |
2 | Correct | 64 ms | 12996 KB | Output is correct |
3 | Correct | 32 ms | 9280 KB | Output is correct |
4 | Correct | 63 ms | 13000 KB | Output is correct |
5 | Correct | 65 ms | 13048 KB | Output is correct |
6 | Correct | 67 ms | 13028 KB | Output is correct |
7 | Correct | 64 ms | 12944 KB | Output is correct |
8 | Correct | 51 ms | 11248 KB | Output is correct |
9 | Correct | 63 ms | 12944 KB | Output is correct |
10 | Correct | 67 ms | 13072 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 4948 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |