oj.uz

답안 #315108

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
315108 2020-10-22T02:35:51 Z daniel920712 Mouse (info1cup19_mouse) C++14
5.99999 / 100
 3000 ms 384 KB 
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <algorithm>
#include "grader.h"

using namespace std;
struct A
{
    int all[10];
}all[6000],guess[105];
vector < int > how;

void solve(int N)
{
    how.clear();
    int i;
    for(i=0;i<N;i++) how.push_back(i+1);
    do
    {
        //printf("aa\n");
        if(query(how)==N) return;
    }while(next_permutation(how.begin(),how.end())!=0);

}

Subtask #1
5.999994 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 35 ms 256 KB Correct! Number of queries: 3487
2 Correct 1 ms 256 KB Correct! Number of queries: 18
3 Correct 3 ms 384 KB Correct! Number of queries: 328
4 Correct 36 ms 256 KB Correct! Number of queries: 3528
5 Correct 52 ms 256 KB Correct! Number of queries: 4783
6 Correct 2 ms 256 KB Correct! Number of queries: 88

Subtask #2
0.0 / 38.0

# 결과 실행 시간 메모리 Grader output
1 Correct 35 ms 256 KB Correct! Number of queries: 3487
2 Correct 1 ms 256 KB Correct! Number of queries: 18
3 Correct 3 ms 384 KB Correct! Number of queries: 328
4 Correct 36 ms 256 KB Correct! Number of queries: 3528
5 Correct 52 ms 256 KB Correct! Number of queries: 4783
6 Correct 2 ms 256 KB Correct! Number of queries: 88
7 Execution timed out 3047 ms 256 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #3
0.0 / 49.0

# 결과 실행 시간 메모리 Grader output
1 Correct 35 ms 256 KB Correct! Number of queries: 3487
2 Correct 1 ms 256 KB Correct! Number of queries: 18
3 Correct 3 ms 384 KB Correct! Number of queries: 328
4 Correct 36 ms 256 KB Correct! Number of queries: 3528
5 Correct 52 ms 256 KB Correct! Number of queries: 4783
6 Correct 2 ms 256 KB Correct! Number of queries: 88
7 Execution timed out 3047 ms 256 KB Time limit exceeded
8 Halted 0 ms 0 KB -