#include "simurgh.h"
#include "bits/stdc++.h"
using namespace std;
#define fi first
#define se second
#define ll long long
#define dbg(v) cerr<<#v<<" = "<<v<<'\n'
#define vi vector<int>
#define vl vector <ll>
#define pii pair<int,int>
#define mp make_pair
#define db long double
#define pb push_back
#define all(s) s.begin(),s.end()
template < class T > T smin(T &a,T b) {if (a > b) a = b;return a;}
template < class T > T smax(T &a,T b) {if (a < b) a = b;return a;}
const int N = 512;
int was[N * N];
int w[N][N];
int f[N];
vi g[N];
pii dfs(int node) {
for (auto it : g[node])
if (f[it] == -1 && !was[w[node][it]]) {
f[it] = node;
auto cnt = dfs(it);
if (cnt != mp(-1,-1))
return cnt;
}
else
if (f[node] != it && f[it] != -1 && !was[w[node][it]])
return mp(node,it);
return mp(-1,-1);
}
int p[N];
int W[N];
int get(int k) {
return k == p[k] ? k : p[k] = get(p[k]);
}
vi find_roads(int n,vi u,vi v) {
int m = u.size();
for (int i = 0;i < m;++i)
w[u[i]][v[i]] = w[v[i]][u[i]] = i,g[u[i]].pb(v[i]),g[v[i]].pb(u[i]);
vi answer;
for (int i = 0;i < n;++i)
p[i] = i;
vi ee;
for (int i = 0;i < m;++i)
if (get(u[i]) != get(v[i])) {
ee.pb(i);
p[get(u[i])] = get(v[i]);
}
do {
vi cycle;
for (int i = 0;i < n;++i) {
for (int j = 0;j < n;++j)
f[j] = -1;
f[i] = i;
auto cnt = dfs(i);
if (cnt != mp(-1,-1)) {
cycle.pb(w[cnt.fi][cnt.se]);
for (int i = cnt.fi;i != cnt.se;i = f[i])
cycle.pb(w[i][f[i]]);
break;
}
}
if (cycle.empty()) {
break;
} else {
for (auto it : cycle)
was[it] = 1;
vi rs;
for (int i = 0;i < cycle.size();++i) {
for (int j = 0;j < n;++j)
p[j] = j;
vi e;
for (int j = 0;j < cycle.size();++j)
if (i != j) {
p[get(u[cycle[j]])] = get(v[cycle[j]]);
e.pb(cycle[j]);
}
for (auto it : ee)
if (get(u[it]) != get(v[it])) {
e.pb(it);
p[get(u[it])] = get(v[it]);
}
rs.pb(count_common_roads(e));
}
int mn = *min_element(all(rs));
int mx = *max_element(all(rs));
if (mn != mx) {
for (int i = 0;i < cycle.size();++i)
if (rs[i] == mn)
W[cycle[i]] = 1,was[cycle[i]] = 0;
}
}
} while (1);
for (int i = 0;i < m;++i)
if (W[i])
answer.pb(i);
return answer;
}
Compilation message
simurgh.cpp: In function 'std::vector<int> find_roads(int, std::vector<int>, std::vector<int>)':
simurgh.cpp:73:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (int i = 0;i < cycle.size();++i) {
~~^~~~~~~~~~~~~~
simurgh.cpp:77:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (int j = 0;j < cycle.size();++j)
~~^~~~~~~~~~~~~~
simurgh.cpp:92:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (int i = 0;i < cycle.size();++i)
~~^~~~~~~~~~~~~~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
2 ms |
380 KB |
correct |
| 2 |
Correct |
3 ms |
380 KB |
correct |
| 3 |
Correct |
3 ms |
436 KB |
correct |
| 4 |
Incorrect |
3 ms |
568 KB |
WA in grader: NO |
| 5 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
2 ms |
380 KB |
correct |
| 2 |
Correct |
3 ms |
380 KB |
correct |
| 3 |
Correct |
3 ms |
436 KB |
correct |
| 4 |
Incorrect |
3 ms |
568 KB |
WA in grader: NO |
| 5 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
2 ms |
380 KB |
correct |
| 2 |
Correct |
3 ms |
380 KB |
correct |
| 3 |
Correct |
3 ms |
436 KB |
correct |
| 4 |
Incorrect |
3 ms |
568 KB |
WA in grader: NO |
| 5 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
3 ms |
568 KB |
WA in grader: NO |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
2 ms |
380 KB |
correct |
| 2 |
Correct |
3 ms |
380 KB |
correct |
| 3 |
Correct |
3 ms |
436 KB |
correct |
| 4 |
Incorrect |
3 ms |
568 KB |
WA in grader: NO |
| 5 |
Halted |
0 ms |
0 KB |
- |
