| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 86623 |
2018-11-27T04:04:40 Z |
Pancake |
Pipes (CEOI15_pipes) |
C++14 |
|
5000 ms |
65536 KB |
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,sse3,sse4,popcnt,abm,mmx")
#include <bits/stdc++.h>
#include <stdio.h>
using namespace std;
#define F first
#define S second
#define lb lower_bound
#define ub upper_bound
#define pb push_back
#define pf push_front
#define ppb pop_back
#define mp make_pair
#define bpp __builtin_popcount
#define sqr(x) ((x) * (x))
#define al 0x3F3F3F3F
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define in insert
#define ppf pop_front
#define endl '\n'
//#define int long long
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
typedef pair <int, int> pii;
const int mod = (int)1e9 + 7;
const int N = (int)2e5 + 123;
const ll inf = (ll)3e18 + 1;
const double pi = acos(-1.0);
const double eps = 1e-7;
const int dx[] = {0, 0, 1, 0, -1};
const int dy[] = {0, 1, 0, -1, 0};
int n, m, tin[N], fup[N], timer;
bool used[N];
set <pii> ans;
vector <int> g[N];
void dfs (int v, int p = 0) {
used[v] = 1;
tin[v] = fup[v] = ++ timer;
for (auto to : g[v]) {
if (to == p) continue;
if (used[to]) fup[v] = min (fup[v], tin[to]);
else {
dfs (to, v);
fup[v] = min (fup[v], fup[to]);
if (fup[to] > tin[v]) ans.in ({min (v, to), max (v, to)});
}
}
}
inline void boost () {
ios_base :: sync_with_stdio (NULL);
cin.tie (NULL), cout.tie (NULL);
}
inline void Solve () {
cin >> n >> m;
while (m --) {
int x, y;
cin >> x >> y;
g[x].pb (y);
g[y].pb (x);
}
for (int i = 1; i <= n; i ++)
if (!used[i])
dfs (i);
for (auto to : ans)
cout << to.F << ' ' << to.S << endl;
}
main () {
// freopen ("gcm.in", "r", stdin);
// freopen ("gcm.out", "w", stdout);
// boost ();
int tt = 1;
// cin >> tt;
while (tt --) {
Solve ();
}
return 0;
}
Compilation message
pipes.cpp:80:7: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
main () {
^
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
6 ms |
4992 KB |
Output is correct |
| 2 |
Incorrect |
6 ms |
4964 KB |
Wrong number of edges |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
13 ms |
5632 KB |
Output is correct |
| 2 |
Incorrect |
15 ms |
5376 KB |
Wrong number of edges |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
356 ms |
13268 KB |
Output is correct |
| 2 |
Correct |
314 ms |
12512 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
639 ms |
16812 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 |
1173 ms |
27972 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 |
1769 ms |
34852 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 |
2946 ms |
56984 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 |
3732 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 |
4869 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 |
Execution timed out |
5097 ms |
60312 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
