Submission #25719

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
25719	2017-06-23T19:04:20 Z	gs14004	Potemkin cycle (CEOI15_indcyc)	C++11	100 / 100	286 ms	11864 KB

indcyc

#include <bits/stdc++.h>
using namespace std;
typedef long long lint;
typedef pair<int, int> pi;

int n, m;
int adj[1005][1005], edg[1005][1005];
int s[100005], e[100005];

int vis[100005], instk[100005], par[100005];
vector<int> edgs;

void dfs(int x, int y, int e){
	vis[e] = instk[e] = 1;
	for(int i=1; i<=n; i++){
		if(adj[x][i]) continue;
		if(adj[y][i]){
			int eno = edg[y][i];
			if(eno != e && instk[eno] && edgs.empty()){
				for(int i=e; i!=eno; i=par[i]){
					edgs.push_back(i);
				}
				edgs.push_back(eno);
			}
			if(!vis[eno]){
				par[eno] = e;
				dfs(y, i, eno);
			}
		}
	}
	instk[e] = 0;
}

void solve(){
	vector<int> vert;
	for(int i=0; i<edgs.size(); i++){
		int l = edgs[i], r = edgs[(i+1)%edgs.size()];
		auto x = pi(s[l], e[l]);
		auto y = pi(s[r], e[r]);
		if(x.first == y.first || x.first == y.second){
			vert.push_back(x.first);
		}
		else{
			vert.push_back(x.second);
		}
	}
	for(int i=0; i<vert.size(); i++){
		for(int j=0; j<i-1; j++){
			if(adj[vert[i]][vert[j]]){
				if(i == vert.size() - 1 && j == 0){
					continue;
				}
				for(int k=j; k<=i; k++){
					printf("%d ", vert[k]);
				}
				return;
			}
		}
	}
	for(auto &i : vert){
		printf("%d ", i);
	}
}

int main(){
	scanf("%d %d",&n,&m);
	for(int i=0; i<m; i++){
		scanf("%d %d",&s[i],&e[i]);
		edg[s[i]][e[i]] = edg[e[i]][s[i]] = i;
		adj[s[i]][e[i]] = adj[e[i]][s[i]] = 1;
	}
	for(int i=0; i<m; i++){
		if(!vis[i]){
			dfs(s[i], e[i], i);
			if(!edgs.empty()){
				solve();
				return 0;
			}
		}
	}
	puts("no");
}

Compilation message

indcyc.cpp: In function 'void solve()':
indcyc.cpp:36:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0; i<edgs.size(); i++){
                ^
indcyc.cpp:47:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0; i<vert.size(); i++){
                ^
indcyc.cpp:50:10: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     if(i == vert.size() - 1 && j == 0){
          ^
indcyc.cpp: In function 'int main()':
indcyc.cpp:66:22: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d",&n,&m);
                      ^
indcyc.cpp:68:29: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d",&s[i],&e[i]);
                             ^

Subtask #1
10.0 / 10.0

#	Verdict	Memory	Grader output
1	Correct	11864 KB	Output is correct
2	Correct	11864 KB	Output is correct
3	Correct	11864 KB	Output is correct
4	Correct	11864 KB	Output is correct
5	Correct	11864 KB	Output is correct

Subtask #2
10.0 / 10.0

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

Subtask #3
10.0 / 10.0

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

Subtask #4
10.0 / 10.0

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

Subtask #5
10.0 / 10.0

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

Subtask #6
10.0 / 10.0

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

Subtask #7
10.0 / 10.0

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

Subtask #8
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	136 ms	11864 KB	Output is correct
2	Correct	46 ms	11864 KB	Output is correct
3	Correct	126 ms	11864 KB	Output is correct
4	Correct	46 ms	11864 KB	Output is correct

Subtask #9
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	39 ms	11864 KB	Output is correct
2	Correct	96 ms	11864 KB	Output is correct

Subtask #10
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	33 ms	11864 KB	Output is correct
2	Correct	79 ms	11864 KB	Output is correct
3	Correct	283 ms	11864 KB	Output is correct
4	Correct	286 ms	11864 KB	Output is correct