oj.uz

답안 #308103

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
308103 2020-09-30T03:55:54 Z daniel920712 동굴 (IOI13_cave) C++14
51 / 100
 416 ms 888 KB 
#include "cave.h"
#include <set>
#include <vector>
#include <stdio.h>
using namespace std;
set < int > all;
vector < int > how;
int have[5005]={0};
int ans[5005];
void F(int l,int r,int here)
{
    int t,x,y,t2,i;
    if(l==r)
    {
        have[how[l]]=0;

        t=tryCombination(have);
        if(t==here) have[how[l]]=1;
        else have[how[l]]=0;


        ans[how[l]]=here;
        all.erase(how[l]);
        return;
    }

    x=(l+r)/2;
    for(i=l;i<=r;i++) have[how[i]]=0;
    t=tryCombination(have);
    for(i=l;i<=x;i++) have[how[i]]=1;
    t2=tryCombination(have);


    if(t==here&&t2!=here||t!=here&&t2==here) F(l,x,here);
    else F(x+1,r,here);

}
void exploreCave(int N)
{
    int i;
    for(i=0;i<N;i++) all.insert(i);
    for(i=0;i<N;i++)
    {
        how.clear();
        for(auto j:all) how.push_back(j);
        F(0,N-i-1,i);

    }
    answer(have,ans);
}

Compilation message

cave.cpp: In function 'void F(int, int, int)':
cave.cpp:34:15: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
   34 |     if(t==here&&t2!=here||t!=here&&t2==here) F(l,x,here);
      |        ~~~~~~~^~~~~~~~~~
cave.cpp:12:13: warning: unused variable 'y' [-Wunused-variable]
   12 |     int t,x,y,t2,i;
      |             ^

Subtask #1
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 234 ms 640 KB too much calls on tryCombination()
2 Halted 0 ms 0 KB -

Subtask #2
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 416 ms 888 KB too much calls on tryCombination()
2 Halted 0 ms 0 KB -

Subtask #3
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 256 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 1 ms 256 KB Output is correct
13 Correct 1 ms 256 KB Output is correct
14 Correct 0 ms 256 KB Output is correct

Subtask #4
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 256 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 1 ms 256 KB Output is correct
13 Correct 1 ms 256 KB Output is correct
14 Correct 0 ms 256 KB Output is correct
15 Correct 0 ms 288 KB Output is correct
16 Correct 0 ms 256 KB Output is correct
17 Correct 0 ms 256 KB Output is correct
18 Correct 0 ms 256 KB Output is correct
19 Correct 1 ms 256 KB Output is correct
20 Correct 70 ms 512 KB Output is correct
21 Correct 1 ms 256 KB Output is correct
22 Correct 1 ms 256 KB Output is correct
23 Correct 78 ms 512 KB Output is correct
24 Correct 78 ms 512 KB Output is correct
25 Correct 80 ms 512 KB Output is correct
26 Correct 1 ms 256 KB Output is correct
27 Correct 1 ms 256 KB Output is correct
28 Correct 78 ms 640 KB Output is correct
29 Correct 1 ms 256 KB Output is correct
30 Correct 73 ms 528 KB Output is correct
31 Correct 73 ms 512 KB Output is correct
32 Correct 1 ms 256 KB Output is correct
33 Correct 1 ms 256 KB Output is correct
34 Correct 1 ms 384 KB Output is correct
35 Correct 79 ms 512 KB Output is correct
36 Correct 80 ms 512 KB Output is correct
37 Correct 0 ms 256 KB Output is correct

Subtask #5
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 234 ms 640 KB too much calls on tryCombination()
2 Halted 0 ms 0 KB -