oj.uz

Submission #318792

# Submission time Handle Problem Language Result Execution time Memory
318792 2020-11-03T08:37:13 Z Wesley_Wang Cave (IOI13_cave) C++14
0 / 100
 26 ms 492 KB 
#include "cave.h"
#include <bits/stdc++.h>

using namespace std;

int determine[5000];
int correspond[5000];

void DoSort (int left, int right)
{
    if (left == right)
    {
        return;
    }

    int pivot = tryCombination(determine);
    int pivot_point = 0;

    int r = right;

    for (int i = left; i <= right; i++)
    {
        int o = correspond[i];
        determine[correspond[o]] = !determine[correspond[o]];
        int t = tryCombination(determine);
        if (t != pivot)
        {
            correspond[i] = t;
            if (t > pivot)
                pivot_point = i;
        }
        else
            correspond[i] = r--;
        determine[correspond[o]] = !determine[correspond[o]];
    }
    determine[correspond[pivot_point]] = !determine[correspond[pivot_point]];
    DoSort(pivot + 1, right);
}

void exploreCave(int N) {

    for (int i = 0; i < N; i++)
        determine[i] = rand() % 2;

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

    DoSort(0, N);
    answer(determine, correspond);
}

Subtask #1
0 / 12.0

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

Subtask #2
0 / 13.0

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

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 364 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 364 KB Answer is wrong
2 Halted 0 ms 0 KB -

Subtask #5
0 / 24.0

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