답안 #970008

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
970008	2024-04-26T05:46:27 Z	tamir1	동굴 (IOI13_cave)	C++17	25 / 100	9 ms	604 KB

cave

#include "cave.h"
#include<iostream>
using namespace std;
int S[5000],D[5000];
void exploreCave(int N) {
	int i,n;
	if(N<=100){
		while(tryCombination(S)!=-1){
			int x=tryCombination(S);
			for(i=0;i<N;i++){
				if(S[i]==1) continue;
				S[i]=1;
				int y=tryCombination(S);
				if(y==-1) break;
				if(y<x) S[i]=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:8: warning: unused variable 'n' [-Wunused-variable]
    6 |  int i,n;
      |        ^

Subtask #1

12.0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	348 KB	Output is correct
2	Correct	5 ms	532 KB	Output is correct
3	Correct	8 ms	348 KB	Output is correct
4	Correct	6 ms	532 KB	Output is correct
5	Correct	8 ms	348 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	420 KB	Output is correct
9	Correct	0 ms	344 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	6 ms	348 KB	Output is correct
13	Correct	4 ms	348 KB	Output is correct
14	Correct	4 ms	592 KB	Output is correct

Subtask #2

13.0 / 13.0

#	결과	실행 시간	메모리	Grader output
1	Correct	8 ms	604 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	8 ms	348 KB	Output is correct
4	Correct	1 ms	348 KB	Output is correct
5	Correct	0 ms	348 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	348 KB	Output is correct
9	Correct	9 ms	348 KB	Output is correct
10	Correct	8 ms	348 KB	Output is correct
11	Correct	8 ms	516 KB	Output is correct

Subtask #3

0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	356 KB	Output is correct
5	Incorrect	1 ms	348 KB	too much calls on tryCombination()
6	Halted	0 ms	0 KB	-

Subtask #4

0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	356 KB	Output is correct
5	Incorrect	1 ms	348 KB	too much calls on tryCombination()
6	Halted	0 ms	0 KB	-

Subtask #5

0 / 24.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	348 KB	Output is correct
2	Correct	5 ms	532 KB	Output is correct
3	Correct	8 ms	348 KB	Output is correct
4	Correct	6 ms	532 KB	Output is correct
5	Correct	8 ms	348 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	420 KB	Output is correct
9	Correct	0 ms	344 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	6 ms	348 KB	Output is correct
13	Correct	4 ms	348 KB	Output is correct
14	Correct	4 ms	592 KB	Output is correct
15	Correct	8 ms	604 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	8 ms	348 KB	Output is correct
18	Correct	1 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	8 ms	348 KB	Output is correct
21	Correct	8 ms	348 KB	Output is correct
22	Correct	8 ms	348 KB	Output is correct
23	Correct	9 ms	348 KB	Output is correct
24	Correct	8 ms	348 KB	Output is correct
25	Correct	8 ms	516 KB	Output is correct
26	Correct	1 ms	344 KB	Output is correct
27	Correct	0 ms	348 KB	Output is correct
28	Correct	0 ms	348 KB	Output is correct
29	Correct	0 ms	356 KB	Output is correct
30	Incorrect	1 ms	348 KB	too much calls on tryCombination()
31	Halted	0 ms	0 KB	-