oj.uz

Submission #315092

# Submission time Handle Problem Language Result Execution time Memory
315092 2020-10-22T02:26:11 Z daniel920712 Mouse (info1cup19_mouse) C++14
0 / 100
 1 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)
{
    int i;
    for(i=0;i<N;i++) how[i]=i;
    do
    {
        if(query(how)==N) return;
    }while(next_permutation(how.begin(),how.begin()));

}

Subtask #1
0.0 / 13.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 384 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #2
0.0 / 38.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 384 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #3
0.0 / 49.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 384 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -