oj.uz

Submission #502168

# Submission time Handle Problem Language Result Execution time Memory
502168 2022-01-05T11:55:34 Z bigo Mouse (info1cup19_mouse) C++14
5.99999 / 100
 135 ms 284 KB 
#include <bits/stdc++.h>
#include "grader.h"

using namespace std;
void solve(int n) {
    vector<int>vec(n);
    for (int i = 0; i < n; i++)
        vec[i] = i + 1;
    do {
        if (query(vec) == n)
            return;
    } while (next_permutation(vec.begin(), vec.end()));
}

Subtask #1
5.999994 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 284 KB Correct! Number of queries: 3487
2 Correct 1 ms 284 KB Correct! Number of queries: 18
3 Correct 4 ms 200 KB Correct! Number of queries: 328
4 Correct 43 ms 284 KB Correct! Number of queries: 3528
5 Correct 43 ms 200 KB Correct! Number of queries: 4783
6 Correct 2 ms 200 KB Correct! Number of queries: 88

Subtask #2
0.0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 284 KB Correct! Number of queries: 3487
2 Correct 1 ms 284 KB Correct! Number of queries: 18
3 Correct 4 ms 200 KB Correct! Number of queries: 328
4 Correct 43 ms 284 KB Correct! Number of queries: 3528
5 Correct 43 ms 200 KB Correct! Number of queries: 4783
6 Correct 2 ms 200 KB Correct! Number of queries: 88
7 Runtime error 135 ms 200 KB Execution killed with signal 13
8 Halted 0 ms 0 KB -

Subtask #3
0.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 284 KB Correct! Number of queries: 3487
2 Correct 1 ms 284 KB Correct! Number of queries: 18
3 Correct 4 ms 200 KB Correct! Number of queries: 328
4 Correct 43 ms 284 KB Correct! Number of queries: 3528
5 Correct 43 ms 200 KB Correct! Number of queries: 4783
6 Correct 2 ms 200 KB Correct! Number of queries: 88
7 Runtime error 135 ms 200 KB Execution killed with signal 13
8 Halted 0 ms 0 KB -