oj.uz

Submission #386547

# Submission time Handle Problem Language Result Execution time Memory
386547 2021-04-06T19:19:58 Z FatihSolak Potemkin cycle (CEOI15_indcyc) C++17
90 / 100
 1000 ms 3300 KB 
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
const int N=1005;
const int inf=1e9+7;
vector<int> E[N];
int n,m,par[N];
bool has[N][N];
int dist[N],ban[N];
void Solve(int u, int v)
{
	queue<int> q;
	for(int i=1;i<=n;i++) dist[i]=inf,ban[i]=0;
	for(int i=1;i<=n;i++) if(has[u][i] && has[v][i]) ban[i]=1;
	dist[u]=par[u]=0;
	for(int i=1;i<=n;i++) if(has[u][i] && !ban[i] && i!=v) dist[i]=1,par[i]=u,q.push(i);
	while(q.size())
	{
		int x=q.front();
		q.pop();
		for(int y:E[x]) if(dist[y]>dist[x]+1 && !ban[y])
		{
			dist[y]=dist[x]+1;
			par[y]=x;
			q.push(y);
		}
	}
	if(dist[v]!=inf)
	{
		for(int i=v;i;i=par[i]) printf("%i ",i);
		exit(0);
	}
}
vector<pair<int,int>> edges;
int main()
{
	scanf("%i %i",&n,&m);
	for(int u,v;m--;) scanf("%i %i",&u,&v),E[u].pb(v),E[v].pb(u),has[u][v]=has[v][u]=1,edges.pb({u,v});
	mt19937 rng(time(0));
	shuffle(edges.begin(),edges.end(),rng);
	for(int i=0;i<edges.size() && i<=6000;i++) Solve(edges[i].first,edges[i].second);
	printf("no\n");
	return 0;
}

Compilation message

indcyc.cpp: In function 'int main()':
indcyc.cpp:41:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   41 |  for(int i=0;i<edges.size() && i<=6000;i++) Solve(edges[i].first,edges[i].second);
      |              ~^~~~~~~~~~~~~
indcyc.cpp:37:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   37 |  scanf("%i %i",&n,&m);
      |  ~~~~~^~~~~~~~~~~~~~~
indcyc.cpp:38:25: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   38 |  for(int u,v;m--;) scanf("%i %i",&u,&v),E[u].pb(v),E[v].pb(u),has[u][v]=has[v][u]=1,edges.pb({u,v});
      |                    ~~~~~^~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 492 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 492 KB Output is correct
2 Correct 10 ms 492 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 35 ms 748 KB Output is correct
2 Correct 2 ms 748 KB Output is correct
3 Correct 6 ms 748 KB Output is correct
4 Correct 82 ms 748 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 748 KB Output is correct
2 Correct 82 ms 792 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 2280 KB Output is correct
2 Correct 10 ms 1900 KB Output is correct
3 Correct 507 ms 2324 KB Output is correct
4 Correct 298 ms 1900 KB Output is correct

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 239 ms 1836 KB Output is correct
2 Execution timed out 1027 ms 1900 KB Time limit exceeded

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 2660 KB Output is correct
2 Correct 41 ms 3300 KB Output is correct
3 Correct 386 ms 3300 KB Output is correct
4 Correct 600 ms 3044 KB Output is correct