# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
152689 |
2019-09-09T07:35:11 Z |
toloraia |
Pipes (CEOI15_pipes) |
C++17 |
|
2418 ms |
65540 KB |
#include <bits/stdc++.h>
#define F first
#define S second
#define mp make_pair
#define pb push_back
#define ll long long
#define LEFT(a) ((a)<<1)
#define RIGHT(a) (LEFT(a) + 1)
#define MID(a,b) ((a+b)>>1)
#define MAX(a,b) ((a)>(b)?(a):(b))
#define MIN(a,b) ((a)<(b)?(a):(b))
//#pragma comment(linker, "/STACK: 20000000005")
#pragma GCC optimize("Ofast")
#pragma GCC target("avx2,fma")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
using namespace std;
const int N = 1e5 + 5, M = 6e6 + 5;
int n, m;
int nn, u[N], v[N];
vector < int > g[N];
int T;
int in[N], up[N];
void dfs (int k, int p){
in[k] = ++T;
up[k] = in[k];
for (int to : g[k]){
if (to == p)
continue;
if (in[to]){
up[k] = min (up[k], in[to]);
continue;
}
dfs (to, k);
if (up[to] > in[k]){
nn++;
u[nn] = k;
v[nn] = to;
}
up[k] = min (up[k], up[to]);
}
}
pair < int, int > P[M];
main()
{
//freopen ("in.in", "r", stdin);freopen ("out.out", "w", stdout);
ios_base::sync_with_stdio(false);
cin >> n >> m;
for (int i = 1; i <= m; i++){
cin >> P[i].F >> P[i].S;
}
sort (P + 1, P + m + 1);
for (int i = 1; i <= m; i++){
if (P[i] == P[i - 1])
continue;
g[P[i].F].pb (P[i].S);
g[P[i].S].pb (P[i].F);
}
for (int i = 1; i <= n; i++)
if (in[i] == 0)
dfs (i, 0);
for (int i = 1; i <= nn; i++)
cout << u[i] << " " << v[i] << endl;
return 0;
}
Compilation message
pipes.cpp:17:0: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
#pragma GCC optimization ("O3")
pipes.cpp:18:0: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
#pragma GCC optimization ("unroll-loops")
pipes.cpp:53:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
main()
^
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
4 ms |
2680 KB |
Output is correct |
2 |
Incorrect |
4 ms |
2680 KB |
Wrong number of edges |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
10 ms |
3192 KB |
Output is correct |
2 |
Incorrect |
10 ms |
3192 KB |
Wrong number of edges |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
238 ms |
15736 KB |
Output is correct |
2 |
Correct |
226 ms |
15220 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
400 ms |
21580 KB |
Memory limit exceeded (if you are sure your verdict is not MLE, please contact us) |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
666 ms |
35396 KB |
Memory limit exceeded (if you are sure your verdict is not MLE, please contact us) |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
917 ms |
41024 KB |
Memory limit exceeded (if you are sure your verdict is not MLE, please contact us) |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
1401 ms |
65536 KB |
Execution killed with signal 9 (could be triggered by violating memory limits) |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
1786 ms |
65540 KB |
Execution killed with signal 9 (could be triggered by violating memory limits) |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
2029 ms |
65536 KB |
Execution killed with signal 9 (could be triggered by violating memory limits) |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
2418 ms |
65540 KB |
Execution killed with signal 9 (could be triggered by violating memory limits) |
2 |
Halted |
0 ms |
0 KB |
- |