oj.uz

Submission #970006

# Submission time Handle Problem Language Result Execution time Memory
970006 2024-04-26T05:40:09 Z tamir1 Cave (IOI13_cave) C++17
13 / 100
 9 ms 528 KB 
#include "cave.h"
#include<iostream>
using namespace std;
int S[5000],D[5000];
void exploreCave(int N) {
	int i,j,n;
	if(N<=100){
		while(tryCombination(S)!=-1){
			int x=tryCombination(S);
			for(i=0;i<N;i++){
				S[j]=1;
				int y=tryCombination(S);
				if(y==-1) break;
				if(y<=x) S[j]=0;
			}
		}
	}
	if(tryCombination(S)==-1){
		for(i=0;i<N;i++){
			S[i]=1-S[i];
			int x=tryCombination(S);
			S[i]=1-S[i];
			D[i]=x;
		}
		answer(S,D);
	}
	for(i=0;i<N;i++) D[i]=i;
	for(i=0;i<N;i++){
		int x=tryCombination(S);
		if(x==-1) break;
		S[x]=1;
	}
    answer(S,D);
}

Compilation message

cave.cpp: In function 'void exploreCave(int)':
cave.cpp:6:10: warning: unused variable 'n' [-Wunused-variable]
    6 |  int i,j,n;
      |          ^
cave.cpp:11:9: warning: 'j' may be used uninitialized in this function [-Wmaybe-uninitialized]
   11 |     S[j]=1;
      |     ~~~~^~

Subtask #1
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 6 ms 528 KB Output is correct
3 Correct 7 ms 344 KB Output is correct
4 Correct 5 ms 348 KB Output is correct
5 Correct 8 ms 524 KB Output is correct
6 Correct 4 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Incorrect 1 ms 348 KB too much calls on tryCombination()
12 Halted 0 ms 0 KB -

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 8 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 8 ms 348 KB Output is correct
7 Correct 8 ms 348 KB Output is correct
8 Correct 8 ms 528 KB Output is correct
9 Correct 8 ms 348 KB Output is correct
10 Correct 9 ms 348 KB Output is correct
11 Correct 8 ms 348 KB Output is correct

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 0 ms 348 KB too much calls on tryCombination()
3 Halted 0 ms 0 KB -

Subtask #4
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 0 ms 348 KB too much calls on tryCombination()
3 Halted 0 ms 0 KB -

Subtask #5
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 6 ms 528 KB Output is correct
3 Correct 7 ms 344 KB Output is correct
4 Correct 5 ms 348 KB Output is correct
5 Correct 8 ms 524 KB Output is correct
6 Correct 4 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Incorrect 1 ms 348 KB too much calls on tryCombination()
12 Halted 0 ms 0 KB -