oj.uz

Submission #810962

# Submission time Handle Problem Language Result Execution time Memory
810962 2023-08-06T18:28:04 Z taher Ancient Machine 2 (JOI23_ancient2) C++17
0 / 100
 152 ms 428 KB 
#include "ancient2.h"

#include <bits/stdc++.h>

using namespace std;

string Solve(int N) {
  string s;

  const int M = 1002;
  vector<int> a(M);
  vector<int> b(M);
  a[0] = 1;
  a[1] = 1;
  b[1] = 1;

  b[0] = 2;
  b[2] = 2;
  a[2] = 2;

  for (int i = 0; i < N; i++) {
    int ret = Query(M, a, b);

    if (ret == i + 1) {
      s += '0';
      a[i] = i + 1;
    } else {
      s += '1';
      b[i] = i + 1;
    }

    a[i + 1] = i + 2;
    a[i + 2] = i + 2;
    b[i + 2] = i + 2;

    b[i + 1] = i + 3;
    b[i + 3] = i + 3;
    a[i + 3] = i + 3;
  }

  return s;
}

Subtask #1
0.0 / 100.0

# Verdict Execution time Memory Grader output
1 Runtime error 152 ms 428 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -