oj.uz

Submission #247347

# Submission time Handle Problem Language Result Execution time Memory
247347 2020-07-11T08:52:51 Z dwsc Mouse (info1cup19_mouse) C++14
5.99999 / 100
 3000 ms 384 KB 
#include <bits/stdc++.h>
#include "grader.h"
using namespace std;
void solve(int N){
    vector<int> v;
    for (int i = 1; i <= N; i++) v.push_back(i);
    do{
        int val = query(v);
        if (val == N) return;
    }while(next_permutation(v.begin(),v.end()));
}

Subtask #1
5.999994 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 45 ms 256 KB Correct! Number of queries: 3487
2 Correct 5 ms 256 KB Correct! Number of queries: 18
3 Correct 8 ms 256 KB Correct! Number of queries: 328
4 Correct 36 ms 384 KB Correct! Number of queries: 3528
5 Correct 60 ms 256 KB Correct! Number of queries: 4783
6 Correct 6 ms 256 KB Correct! Number of queries: 88

Subtask #2
0.0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 45 ms 256 KB Correct! Number of queries: 3487
2 Correct 5 ms 256 KB Correct! Number of queries: 18
3 Correct 8 ms 256 KB Correct! Number of queries: 328
4 Correct 36 ms 384 KB Correct! Number of queries: 3528
5 Correct 60 ms 256 KB Correct! Number of queries: 4783
6 Correct 6 ms 256 KB Correct! Number of queries: 88
7 Execution timed out 3048 ms 384 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #3
0.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 45 ms 256 KB Correct! Number of queries: 3487
2 Correct 5 ms 256 KB Correct! Number of queries: 18
3 Correct 8 ms 256 KB Correct! Number of queries: 328
4 Correct 36 ms 384 KB Correct! Number of queries: 3528
5 Correct 60 ms 256 KB Correct! Number of queries: 4783
6 Correct 6 ms 256 KB Correct! Number of queries: 88
7 Execution timed out 3048 ms 384 KB Time limit exceeded
8 Halted 0 ms 0 KB -