oj.uz

Submission #626704

# Submission time Handle Problem Language Result Execution time Memory
626704 2022-08-11T16:37:11 Z Minindu2006 Prisoner Challenge (IOI22_prison) C++17
0 / 100
 0 ms 212 KB 
#include "prison.h"
#include <bits/stdc++.h>
using namespace std;

std::vector<std::vector<int>> devise_strategy(int N) {
  vector<vector<int>>ans(25,vector<int>(N + 1));
  for (int i = 0;i<25;++i){
    if (i == 0){
      ans[i][0] = 0;
      for (int j = 1;j<=N;++j){
        ans[i][j] = 12;
      }      
    }
    else {
      if (i > 12){
        ans[i][0] = 1;
      }
      else ans[i][0] = 0;
      for (int j = 1;j<=N;++j){
        if (i > 12){
          if (j & (1<<(25 - i))){
            if (25 - i == 1){
              if (j & 1){
                ans[i][j] = -1;
              }
              else ans[i][j] = -2;
            }
            else{
              ans[i][j] = (25 - i) - 1;
            }
          }
          else{
            ans[i][j] = -2;
          }
        }
        else{
          if (j & (1<<i)){
            ans[i][j] = 25 - i;
          }
          else{
            if (i == 1){
              if (j & 1)ans[i][j] = -2;
              else ans[i][j] = -1;
            }
            else ans[i][j] = i - 1;
          }
        }
      }
    }
  }
  return ans;
}

Subtask #1
0.0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Strategy failed for N=2, A=1, B=2
2 Halted 0 ms 0 KB -

Subtask #2
0.0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Strategy failed for N=2, A=1, B=2
2 Halted 0 ms 0 KB -

Subtask #3
0 / 90.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Strategy failed for N=3, A=1, B=2
2 Halted 0 ms 0 KB -