#include "simurgh.h"
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
#define query count_common_roads
const int maxN = 500;
struct Jmp
{
int to, ind;
operator int&() { return to; }
operator const int&() const { return to; }
};
int in[maxN], out[maxN];
Jmp par[maxN];
int gold[maxN * maxN];
vector<int> dfsq;
vector<Jmp> nei[maxN];
vector<int> same[maxN * maxN];
Jmp fup[maxN];
inline bool Upper(int u, int v) { return in[u] <= in[v] && out[u] >= out[v]; }
bool used[maxN];
void DFS(int v, Jmp p)
{
cerr << "v: " << v << '\n';
static int time = 0;
used[v] = true;
in[v] = ++time;
par[v] = p;
fup[v] = {-1, -1};
for (Jmp to: nei[v])
if (!used[to])
{
dfsq.push_back(to.ind);
DFS(to, {v, to.ind});
if (p != -1)
if (fup[v] == -1 || (fup[to] != -1 && in[fup[to]] <= in[fup[v]]))
fup[v] = fup[to];
}
else if (to != p && p != -1)
if (fup[v] == -1 || in[to] <= in[fup[v]])
fup[v] = to;
out[v] = time;
}
void DFS1(int v)
{
for (int to: same[v])
if (gold[to] == -1)
{
gold[to] = gold[v];
DFS1(to);
}
}
vector<int> find_roads(int n, vector<int> us, vector<int> vs)
{
int m = us.size();
fill(gold, gold + m, -1);
for (int i = 0; i < m; ++i)
{
nei[us[i]].push_back({vs[i], i});
nei[vs[i]].push_back({us[i], i});
}
DFS(0, {-1, -1});
for (int i = 0; i < n; ++i)
cerr << "fup[" << i << "] = " << fup[i].to << '\n';
int dfsans = query(dfsq);
for (int i = 0; i < m; ++i)
if (in[us[i]] > in[vs[i]])
swap(us[i], vs[i]);
for (int i = 0; i < m; ++i)
{
if (i == 16)
cerr << "";
int u = us[i], v = vs[i];
if (fup[v] == -1 || in[fup[v]] > in[u]) // Is a birdge.
{
gold[i] = 1;
continue;
}
int dfse, backe;
if (par[v] == u)
dfse = i, backe = fup[v].ind;
else
backe = i, dfse = par[v].ind;
int j = find(dfsq.begin(), dfsq.end(), dfse) - dfsq.begin();
dfsq[j] = backe;
int curans = query(dfsq);
if (curans == dfsans)
{
same[backe].push_back(dfse);
same[dfse].push_back(backe);
}
else if (curans > dfsans)
gold[backe] = 1, gold[dfse] = 0;
else
gold[backe] = 0, gold[dfse] = 1;
dfsq[j] = dfse;
}
for (int i = 0; i < m; ++i)
if (gold[i] != -1)
DFS1(i);
vector<int> ans;
for (int i = 0; i < m; ++i)
if (gold[i] == 1)
ans.push_back(i);
return ans;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
8 ms |
6272 KB |
correct |
| 2 |
Correct |
8 ms |
6272 KB |
correct |
| 3 |
Correct |
8 ms |
6272 KB |
correct |
| 4 |
Correct |
8 ms |
6272 KB |
correct |
| 5 |
Correct |
8 ms |
6272 KB |
correct |
| 6 |
Correct |
8 ms |
6272 KB |
correct |
| 7 |
Correct |
8 ms |
6272 KB |
correct |
| 8 |
Correct |
8 ms |
6272 KB |
correct |
| 9 |
Correct |
8 ms |
6272 KB |
correct |
| 10 |
Correct |
8 ms |
6272 KB |
correct |
| 11 |
Correct |
8 ms |
6272 KB |
correct |
| 12 |
Incorrect |
8 ms |
6272 KB |
WA in grader: NO |
| 13 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
8 ms |
6272 KB |
correct |
| 2 |
Correct |
8 ms |
6272 KB |
correct |
| 3 |
Correct |
8 ms |
6272 KB |
correct |
| 4 |
Correct |
8 ms |
6272 KB |
correct |
| 5 |
Correct |
8 ms |
6272 KB |
correct |
| 6 |
Correct |
8 ms |
6272 KB |
correct |
| 7 |
Correct |
8 ms |
6272 KB |
correct |
| 8 |
Correct |
8 ms |
6272 KB |
correct |
| 9 |
Correct |
8 ms |
6272 KB |
correct |
| 10 |
Correct |
8 ms |
6272 KB |
correct |
| 11 |
Correct |
8 ms |
6272 KB |
correct |
| 12 |
Incorrect |
8 ms |
6272 KB |
WA in grader: NO |
| 13 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
8 ms |
6272 KB |
correct |
| 2 |
Correct |
8 ms |
6272 KB |
correct |
| 3 |
Correct |
8 ms |
6272 KB |
correct |
| 4 |
Correct |
8 ms |
6272 KB |
correct |
| 5 |
Correct |
8 ms |
6272 KB |
correct |
| 6 |
Correct |
8 ms |
6272 KB |
correct |
| 7 |
Correct |
8 ms |
6272 KB |
correct |
| 8 |
Correct |
8 ms |
6272 KB |
correct |
| 9 |
Correct |
8 ms |
6272 KB |
correct |
| 10 |
Correct |
8 ms |
6272 KB |
correct |
| 11 |
Correct |
8 ms |
6272 KB |
correct |
| 12 |
Incorrect |
8 ms |
6272 KB |
WA in grader: NO |
| 13 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
7 ms |
6272 KB |
correct |
| 2 |
Correct |
8 ms |
6272 KB |
correct |
| 3 |
Incorrect |
143 ms |
10360 KB |
WA in grader: NO |
| 4 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
8 ms |
6272 KB |
correct |
| 2 |
Correct |
8 ms |
6272 KB |
correct |
| 3 |
Correct |
8 ms |
6272 KB |
correct |
| 4 |
Correct |
8 ms |
6272 KB |
correct |
| 5 |
Correct |
8 ms |
6272 KB |
correct |
| 6 |
Correct |
8 ms |
6272 KB |
correct |
| 7 |
Correct |
8 ms |
6272 KB |
correct |
| 8 |
Correct |
8 ms |
6272 KB |
correct |
| 9 |
Correct |
8 ms |
6272 KB |
correct |
| 10 |
Correct |
8 ms |
6272 KB |
correct |
| 11 |
Correct |
8 ms |
6272 KB |
correct |
| 12 |
Incorrect |
8 ms |
6272 KB |
WA in grader: NO |
| 13 |
Halted |
0 ms |
0 KB |
- |
