oj.uz

Submission #334840

# Submission time Handle Problem Language Result Execution time Memory
334840 2020-12-10T05:07:20 Z Trickster Xoractive (IZhO19_xoractive) C++14
6 / 100
 1 ms 364 KB 
//Suleyman Atayew
 
#include "interactive.h"
#include <algorithm>
#include <iostream>
#include <string.h>
#include <stdio.h>
#include <bitset>
#include <vector>
#include <queue>
#include <cmath>
#include <map>
#include <set>
 
#define N 200010
#define ff first
#define ss second
#define pb push_back
#define ll long long
#define mod 1000000007
#define pii pair <int, int>
#define sz(a) (int)(a.size())
ll bigmod(ll a, ll b) { if(b==0)return 1; ll ret = bigmod(a, b/2); return ret * ret % mod * (b%2 ? a : 1) % mod; }

using namespace std;

vector <int> guess(int n)
{
    vector <int> A;

    for(int i = 1; i <= n; i++) {
        A.pb(ask(i));
    }

    return A;
}

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 0 ms 364 KB Output is correct

Subtask #2
0 / 94.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 364 KB Output isn't correct
2 Halted 0 ms 0 KB -