oj.uz

Submission #410868

# Submission time Handle Problem Language Result Execution time Memory
410868 2021-05-23T20:53:10 Z jjj Cave (IOI13_cave) C++14
13 / 100
 224 ms 404 KB 
#include "cave.h"

int s[5010], d[5010], s1[5010];

void exploreCave(int N)
{
    for(int i = 0; i < N; i++) d[i] = -1;
    for(int i = 0; i < N; i++) s[i] = 0;

     int x = tryCombination(s);

     if(x == -1)
     {
         for(int i = 0; i < N; i++)
         {
             s[i] = 1;

             x = tryCombination(s);

             d[i] = x;
             s[i] = 0;
         }


         answer(s, d);
     }

    if(N  <= 100)
    {
        for(int i = 0; i < N; i++) s1[i] = 0;

        int k = 0;

        while(k < N)
        {
            for(int i = 0; i < N; i++)
            {
                s1[i] = 1;

                int y = tryCombination(s1);

                if(y < x)
                {
                    if(d[i] == -1) k++;

                    s[i] = 0;
                    d[i] = y;

                    s1[i] = 0;
                }
                if(x < y)
                {
                    if(d[i] == -1) k++;

                    s[i] = 1;
                    d[i] = x;

                    x = y;
                }
            }
        }

        answer(s, d);
    }

    int k = 0;

    while(k < N)
    {
        s[x] = 1;

        k = x + 1;

        x = tryCombination(s);
    }

    for(int i = 0; i < N; i++) d[i] = i;

    answer(s, d);
}

Subtask #1
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 224 ms 332 KB too much calls on tryCombination()
2 Halted 0 ms 0 KB -

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 368 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 11 ms 292 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 11 ms 296 KB Output is correct
7 Correct 11 ms 404 KB Output is correct
8 Correct 15 ms 404 KB Output is correct
9 Correct 15 ms 404 KB Output is correct
10 Correct 15 ms 400 KB Output is correct
11 Correct 12 ms 400 KB Output is correct

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Incorrect 1 ms 204 KB Answer is wrong
3 Halted 0 ms 0 KB -

Subtask #4
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Incorrect 1 ms 204 KB Answer is wrong
3 Halted 0 ms 0 KB -

Subtask #5
0 / 24.0

# Verdict Execution time Memory Grader output
1 Incorrect 224 ms 332 KB too much calls on tryCombination()
2 Halted 0 ms 0 KB -