# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
781231 |
2023-07-13T00:17:26 Z |
NK_ |
Pipes (CEOI15_pipes) |
C++17 |
|
681 ms |
65536 KB |
// Success consists of going from failure to failure without loss of enthusiasm
#include <bits/stdc++.h>
using namespace std;
#define nl '\n'
#define f first
#define s second
#define mp make_pair
#define pb push_back
using pi = pair<int, int>;
template<class T> using V = vector<T>;
const int eax = 6e6+5;
const int nax = 1e5+5;
pi adj[eax];
int L[nax], R[nax];
// void dfs(int u, int x) {
// disc[u] = ++ti;
// for(auto e : adj[u]) {
// int v, i; tie(v, i) = e;
// if (i == x) continue;
// if (disc[v] == -1) {
// stk[cur++] = mp(u, i);
// dfs(v, i);
// } else {
// int up = disc[v];
// crit[i] = 0;
// // cout << v << " " << up << endl;
// while(cur > 0 && disc[stk[cur - 1].f] >= up) crit[stk[--cur].s] = 0;
// }
// }
// }
int main() {
cin.tie(0)->sync_with_stdio(0);
int N, M; cin >> N >> M;
for(int e = 0; e < M; e++) {
int u, v; cin >> u >> v; --u, --v;
adj[e] = mp(u, v);
}
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
212 KB |
Wrong number of edges |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
340 KB |
Wrong number of edges |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
61 ms |
4960 KB |
Output is correct |
2 |
Incorrect |
61 ms |
4784 KB |
Wrong number of edges |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
104 ms |
8116 KB |
Output is correct |
2 |
Incorrect |
122 ms |
9560 KB |
Wrong number of edges |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
171 ms |
11916 KB |
Output is correct |
2 |
Runtime error |
150 ms |
23948 KB |
Memory limit exceeded |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
214 ms |
14448 KB |
Output is correct |
2 |
Runtime error |
180 ms |
30920 KB |
Memory limit exceeded |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
329 ms |
36332 KB |
Memory limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
436 ms |
65536 KB |
Memory limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
551 ms |
65536 KB |
Memory limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
681 ms |
65536 KB |
Memory limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |