oj.uz

답안 #457608

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
457608 2021-08-07T08:46:40 Z vanic Potemkin cycle (CEOI15_indcyc) C++14
30 / 100
 20 ms 4428 KB 
#include <iostream>
#include <cmath>
#include <cstdio>
#include <algorithm>
#include <vector>
#include <cassert>

using namespace std;

const int maxn=1005;

bool ms[maxn][maxn];
int n, m;
vector < int > sol;
bool bio[maxn];

bool dfs(int x, vector < int > minus, vector < int > put){
	bio[x]=1;
	vector < int > tren;
	for(int i=(int)minus.size()-1; i>-1; i--){
		for(int j=0; j<minus[i]; j++){
			if(tren.empty()){
				cout << 1/0;
			}
			tren.pop_back();
		}
		if(!tren.empty() && ms[x][put[i]]){
			if(tren.size()==1){
				minus[i]++;
				tren.pop_back();
			}
			else{
				tren.push_back(put[i]);
				tren.push_back(x);
				sol=tren;
				return 1;
			}
		}
		tren.push_back(put[i]);
	}
	minus.push_back(0);
	put.push_back(x);
	for(int i=0; i<n; i++){
		if(!bio[i] && ms[x][i]){
			if(dfs(i, minus, put)){
				return 1;
			}
		}
	}
	return 0;
}

int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	cin >> n >> m;
	int a, b;
	for(int i=0; i<m; i++){
		cin >> a >> b;
		a--;
		b--;
		ms[a][b]=1;
		ms[b][a]=1;
	}
	for(int i=0; i<n; i++){
		if(!bio[i] && dfs(i, {}, {})){
			for(int j=0; j<(int)sol.size(); j++){
				cout << sol[j]+1 << ' ';
			}
			cout << '\n';
			return 0;
		}
	}
	cout << "no\n";
	return 0;
}

Compilation message

indcyc.cpp: In function 'bool dfs(int, std::vector<int>, std::vector<int>)':
indcyc.cpp:23:14: warning: division by zero [-Wdiv-by-zero]
   23 |     cout << 1/0;
      |             ~^~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Runtime error 1 ms 460 KB Execution killed with signal 8

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct

Subtask #5
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1 ms 588 KB Execution killed with signal 8
2 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 2 ms 972 KB Execution killed with signal 8
2 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 2 ms 972 KB Execution killed with signal 8
2 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 11 ms 2452 KB Execution killed with signal 8
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 8 ms 2508 KB Execution killed with signal 8
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 20 ms 4428 KB Execution killed with signal 8
2 Halted 0 ms 0 KB -