oj.uz

Submission #933249

# Submission time Handle Problem Language Result Execution time Memory
933249 2024-02-25T10:13:26 Z SmuggingSpun Cave (IOI13_cave) C++17
0 / 100
 533 ms 544 KB 
#include "cave.h"
#include<bits/stdc++.h>
using namespace std;
const int lim = 5e3 + 5;
int S[lim], D[lim];
bitset<lim>vis;
void exploreCave(int n){
	vis.reset();
	for(int i = 0; i < n; i++){
		for(int j = 0; j < n; j++){
			if(!vis.test(j)){
				S[j] = 0;
			}
		}
		if(tryCombination(S) != i){
			for(int j = 0; j < n; j++){
				if(!vis.test(j)){
					S[j] = 1;
				}
			}
		}
		int low = 0, high = n - 1, ans;
		while(low <= high){
			int mid = (low + high) >> 1;
			for(int j = 0; j <= mid; j++){
				if(!vis.test(j)){
					S[j] ^= 1;
				}
			}
			if(tryCombination(S) == i){
				high = (ans = mid) - 1;
			}
			else{
				low = mid + 1;
			}
			for(int j = 0; j <= mid; j++){
				if(!vis.test(j)){
					S[j] ^= 1;
				}
			}
		}
		vis.set(D[i] = ans);
	}
	answer(S, D);
}

Compilation message

cave.cpp: In function 'void exploreCave(int)':
cave.cpp:22:30: warning: 'ans' may be used uninitialized in this function [-Wmaybe-uninitialized]
   22 |   int low = 0, high = n - 1, ans;
      |                              ^~~

Subtask #1
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 337 ms 536 KB Answer is wrong
2 Halted 0 ms 0 KB -

Subtask #2
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 533 ms 544 KB Answer is wrong
2 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Answer is wrong
2 Halted 0 ms 0 KB -

Subtask #4
0 / 30.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Answer is wrong
2 Halted 0 ms 0 KB -

Subtask #5
0 / 24.0

# Verdict Execution time Memory Grader output
1 Incorrect 337 ms 536 KB Answer is wrong
2 Halted 0 ms 0 KB -