oj.uz

Submission #401057

# Submission time Handle Problem Language Result Execution time Memory
401057 2021-05-09T09:46:18 Z dolphingarlic Mouse (info1cup19_mouse) C++14
0 / 100
 1 ms 200 KB 
#include "grader.h"

#include <bits/stdc++.h>
typedef long long ll;
using namespace std;

void solve(int N) {
    vector<int> ans(N);
    for (int i = 0; i < N; i++) {
        int l = 0, r = N - 1;
        while (l != r) {
            int mid = (l + r) / 2;
            vector<int> tst(N, 0);
            for (int j = l; j <= mid; j++) tst[j] = i + 1;
            if (query(tst)) r = mid;
            else l = mid + 1;
        }
        ans[l] = i + 1;
    }
    query(ans);
}

Subtask #1
0.0 / 13.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 200 KB Execution killed with signal 13
2 Halted 0 ms 0 KB -

Subtask #2
0.0 / 38.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 200 KB Execution killed with signal 13
2 Halted 0 ms 0 KB -

Subtask #3
0.0 / 49.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 200 KB Execution killed with signal 13
2 Halted 0 ms 0 KB -