oj.uz

Submission #257698

# Submission time Handle Problem Language Result Execution time Memory
257698 2020-08-04T14:52:54 Z super_j6 Potemkin cycle (CEOI15_indcyc) C++14
100 / 100
 372 ms 91768 KB 
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <vector>
#include <queue>
using namespace std;
#define endl '\n'
#define ll long long
#define pi pair<int, int>
#define f first
#define s second

const int mxn = 1000, mxm = 200000;
int n, m;
int u[mxm], v[mxm], vis[mxm], p[mxm];
bool a[mxn][mxn];
vector<int> g[mxn], gr[mxm];

void dfs(int c){
	vis[c] = 1;
	for(int i : gr[c]){
		if(!vis[i]){
			p[i] = c;
			dfs(i);
		}else if(i != p[c] && !~-vis[i]){
			cout << (i < m ? u[i] : v[i]) + 1;
			for(int j = c; j != i; j = p[j]){
				cout << " " << (j < m ? u[j] : v[j]) + 1;
			}
			cout << endl;
			exit(0);
		}
	}
	vis[c] = 2;
}

int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	
	cin >> n >> m;
	
	for(int i = 0; i < m; i++){
		cin >> u[i] >> v[i];
		u[m + i] = --u[i], v[m + i] = --v[i];
		a[u[i]][v[i]] = a[v[i]][u[i]] = 1;
		g[u[i]].push_back(i);
		g[v[i]].push_back(i);
	}
	
	for(int i = 0; i < n; i++)
	for(int j = 0; j < g[i].size(); j++)
	for(int l = 0; l < j; l++){
		int x = g[i][j], y = g[i][l];
		if(!a[i ^ u[x] ^ v[x]][i ^ u[y] ^ v[y]]){
			gr[(i == u[x]) * m + x].push_back((i == v[y]) * m + y);
			gr[(i == u[y]) * m + y].push_back((i == v[x]) * m + x);
		} 
	}
	
	for(int i = 0; i < m; i++) if(!vis[i]) p[i] = -1, dfs(i);
	
	cout << "no" << endl;

	return 0;
}

Compilation message

indcyc.cpp: In function 'int main()':
indcyc.cpp:52:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int j = 0; j < g[i].size(); j++)
                 ~~^~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
10.0 / 10.0

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

Subtask #4
10.0 / 10.0

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

Subtask #5
10.0 / 10.0

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

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 5760 KB Output is correct
2 Correct 9 ms 5760 KB Output is correct
3 Correct 14 ms 7680 KB Output is correct
4 Correct 14 ms 7808 KB Output is correct

Subtask #7
10.0 / 10.0

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

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 118 ms 22936 KB Output is correct
2 Correct 43 ms 9840 KB Output is correct
3 Correct 119 ms 22904 KB Output is correct
4 Correct 37 ms 9976 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 151 ms 51236 KB Output is correct
2 Correct 155 ms 55420 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 137 ms 8696 KB Output is correct
2 Correct 127 ms 8684 KB Output is correct
3 Correct 361 ms 91344 KB Output is correct
4 Correct 372 ms 91768 KB Output is correct