oj.uz

Submission #319127

# Submission time Handle Problem Language Result Execution time Memory
319127 2020-11-04T01:38:20 Z Wesley_Wang Cave (IOI13_cave) C++14
0 / 100
 3 ms 492 KB 
#include "cave.h"
#include <bits/stdc++.h>
 
using namespace std;
 
int determine[5000];
int correspond[5000];
vector<int> undone;
int undones;
 
void exploreCave(int N) {
 
    for (int i = 0; i < N; i++)
        determine[i] = rand() % 2, correspond[i] = i, undone.push_back(i);
 
    undones = N;
 
    while (undones > 0)
    {
        int pivot = tryCombination(determine);
        int pivot_point = 0;
 
        int r = N;
 		if (pivot == -1)
              break;
        bool flag = false;
        for (int p : undone)
        {
            determine[p] = !determine[p];
            int t = tryCombination(determine);
            if (t == -1)
            {
              flag = true; 
              break;
            }
            if (t != pivot)
            {
                undone.erase(undone.begin() + p), undones--;
                correspond[p] = t;
                if (t > pivot)
                    pivot_point = p;
            }
            else
                correspond[p] = --r;
            determine[p] = !determine[p];
        }
      	if (flag)
          break;
        determine[correspond[pivot_point]] = !determine[correspond[pivot_point]];
    }
  	while (undones > 0)
    {
      	int o = undone[0];
        determine[o] = !determine[o];
      	int t = tryCombination(determine);
      	correspond[o] = t, undone.erase(undone.begin()), undones--;
      	determine[o] = !determine[o];
    }
    answer(determine, correspond);
}

Subtask #1
0 / 12.0

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

Subtask #2
0 / 13.0

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

Subtask #4
0 / 30.0

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

Subtask #5
0 / 24.0

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