Submission #950563

#TimeUsernameProblemLanguageResultExecution timeMemory
950563arbuzickAncient Machine 2 (JOI23_ancient2)C++17
0 / 100
70 ms1412 KiB
#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;
}
#Verdict Execution timeMemoryGrader output
Fetching results...