oj.uz

Submission #154993

# Submission time Handle Problem Language Result Execution time Memory
154993 2019-09-25T20:25:47 Z TadijaSebez Potemkin cycle (CEOI15_indcyc) C++11
70 / 100
 1000 ms 2556 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);
	}
}
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;
	for(int i=1;i<=n;i++) for(int j:E[i]) if(i<j) Solve(i,j);
	printf("no\n");
	return 0;
}

Compilation message

indcyc.cpp: In function 'int main()':
indcyc.cpp:36:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%i %i",&n,&m);
  ~~~~~^~~~~~~~~~~~~~~
indcyc.cpp:37:62: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  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;
                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
10.0 / 10.0

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

Subtask #4
10.0 / 10.0

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

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 504 KB Output is correct
2 Correct 7 ms 504 KB Output is correct

Subtask #6
10.0 / 10.0

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

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 760 KB Output is correct
2 Correct 44 ms 760 KB Output is correct

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 67 ms 2284 KB Output is correct
2 Correct 25 ms 1784 KB Output is correct
3 Execution timed out 1068 ms 2300 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 1804 KB Output is correct
2 Execution timed out 1080 ms 1784 KB Time limit exceeded

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 58 ms 2424 KB Output is correct
2 Correct 244 ms 2552 KB Output is correct
3 Correct 236 ms 2552 KB Output is correct
4 Execution timed out 1082 ms 2556 KB Time limit exceeded