# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
46928 | alex99 | Potemkin cycle (CEOI15_indcyc) | C++14 | 296 ms | 5664 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <iostream>
#include <vector>
#include <queue>
using namespace std;
int N, M;
vector <int> G[1005];
bool X[1005][1005];
pair <int, int> E[100005];
bool Blocked[1005];
vector <int> V;
bool Use[1005];
int TT[1005];
void Read()
{
cin >> N >> M;
for(int i = 1; i <= M; i++)
{
int x, y;
cin >> x >> y;
G[x].push_back(y);
G[y].push_back(x);
//E[i] = make_pair(x, y);
X[x][y] = X[y][x] = 1;
}
for(int i = 1; i <= N; i++)
X[i][i] = 1;
}
void DFS(int node, int org)
{
Use[node] = 1;
if(X[node][org] == 1)
{
V.push_back(node);
return;
}
for(int i = 0; i < G[node].size(); i++)
{
int neighb = G[node][i];
if(Use[neighb] == 0)
{
DFS(neighb, org);
}
}
}
void BFS(int x, int y, int v)
{
queue <int> Q;
for(int i = 1; i <= N; i++)
Use[i] = 0;
Q.push(x);
Use[x] = 1;
while(!Q.empty())
{
int node = Q.front();
Q.pop();
for(int i = 0; i < G[node].size(); i++)
{
int neighb = G[node][i];
if(Use[neighb] == 0 && (neighb == y || X[neighb][v] == 0))
{
TT[neighb] = node;
Use[neighb] = 1;
Q.push(neighb);
}
}
}
int node = y;
while(node != 0)
{
cout << node << " ";
node = TT[node];
}
cout << v << "\n";
}
void Solve()
{
for(int i = 1; i <= N; i++)
{
for(int j = 1; j <= N; j++)
Use[j] = 0;
for(int j = 1; j <= N; j++)
{
if(X[i][j] == 0 && Use[j] == 0 && i != j)
{
V.clear();
DFS(j, i);
for(int k = 0; k < V.size(); k++)
for(int p = k + 1; p < V.size(); p++)
if(X[V[k]][V[p]] == 0)
{
BFS(V[k], V[p], i);
return;
}
for(int k = 0; k < V.size(); k++)
Use[V[k]] = 0;
}
}
}
cout << "no\n";
}
int main()
{
Read();
Solve();
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |