oj.uz

Submission #950563

# Submission time Handle Problem Language Result Execution time Memory
950563 2024-03-20T12:38:39 Z arbuzick Ancient Machine 2 (JOI23_ancient2) C++17
0 / 100
 70 ms 1412 KB 
#include <bits/stdc++.h>

#include "ancient2.h"

using namespace std;

string Solve(int n) {
    string ans(n, '0');
    for (int i = 0; i < n; ++i) {
        int m = i + 2;
        vector<int> a(m), b(m);
        for (int j = 0; j < i; ++j) {
            a[j] = b[j] = j + 1;
        }
        a[i] = i;
        a[i + 1] = i + 1;
        b[i] = i + 1;
        b[i + 1] = i + 1;
        int val = Query(m, a, b);
        if (val == i) {
            ans[i] = '0';
        } else {
            ans[i] = '1';
        }
    }
    return ans;
}

Subtask #1
0.0 / 100.0

# Verdict Execution time Memory Grader output
1 Incorrect 70 ms 1412 KB Wrong Answer [3]
2 Halted 0 ms 0 KB -