oj.uz

Submission #527155

# Submission time Handle Problem Language Result Execution time Memory
527155 2022-02-17T02:53:42 Z hmm789 Potemkin cycle (CEOI15_indcyc) C++14
10 / 100
 1000 ms 4460 KB 
#include <bits/stdc++.h>
using namespace std;

int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0); cout.tie(0);
	int n, e, a, b, ans = 0;
	cin >> n >> e;
	int adj[n][n];
	memset(adj, 0, sizeof(adj));
	for(int i = 0; i < e; i++) {
		cin >> a >> b;
		a--; b--;
		adj[a][b] = 1;
		adj[b][a] = 1;
	}
	vector<int> v;
	for(int i = 0; i < (1<<n); i++) {
		v.clear();
		for(int j = 0; j < n; j++) {
			if(i & (1<<j)) v.push_back(j);
		}
		if(v.size() < 4) continue;
		int cnt[v.size()];
		memset(cnt, 0, sizeof(cnt));
		for(int i = 0; i < v.size(); i++) {
			for(int j = 0; j < v.size(); j++) {
				if(adj[v[i]][v[j]]) cnt[i]++;
			}
		}
		for(int i = 0; i < v.size(); i++) if(cnt[i] != 2) goto end2;
		ans++;
		break;
		end2:;
	}
	if(ans == 0) cout << "no";
	else for(int i : v) cout << i+1 << " ";
}

Compilation message

indcyc.cpp: In function 'int main()':
indcyc.cpp:26:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   26 |   for(int i = 0; i < v.size(); i++) {
      |                  ~~^~~~~~~~~~
indcyc.cpp:27:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   27 |    for(int j = 0; j < v.size(); j++) {
      |                   ~~^~~~~~~~~~
indcyc.cpp:31:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   31 |   for(int i = 0; i < v.size(); i++) if(cnt[i] != 2) goto end2;
      |                  ~~^~~~~~~~~~
indcyc.cpp:24:7: warning: argument to variable-length array may be too large [-Wvla-larger-than=]
   24 |   int cnt[v.size()];
      |       ^~~

Subtask #1
10.0 / 10.0

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

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB Wrong adjacency
2 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 312 KB Wrong adjacency
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 332 KB Expected integer, but "no" found
2 Halted 0 ms 0 KB -

Subtask #5
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 332 KB Expected integer, but "no" found
2 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 35 ms 660 KB Output is correct
2 Incorrect 33 ms 588 KB Expected integer, but "no" found
3 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 38 ms 588 KB Expected integer, but "no" found
2 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 23 ms 4460 KB Expected integer, but "no" found
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 14 ms 4376 KB Expected integer, but "no" found
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1085 ms 1740 KB Time limit exceeded
2 Halted 0 ms 0 KB -