oj.uz

Submission #129662

# Submission time Handle Problem Language Result Execution time Memory
129662 2019-07-13T00:04:05 Z qkxwsm Koala Game (APIO17_koala) C++14
4 / 100
 6 ms 380 KB 
#include "koala.h"
#include <bits/stdc++.h>

using namespace std;

template<class T, class U>
void ckmin(T &a, U b)
{
	if (a > b) a = b;
}

template<class T, class U>
void ckmax(T &a, U b)
{
	if (a < b) a = b;
}

#define MP make_pair
#define PB push_back
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define FOR(i, a, b) for (auto i = (a); i < (b); i++)
#define FORD(i, a, b) for (auto i = (a) - 1; i >= b; i--)
#define SZ(x) ((int) ((x).size()))
#define ALL(x) x.begin(), x.end()
#define INF 1000000007
#define LLINF 2696969696969696969

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<pii> vpi;
typedef vector<pll> vpl;

int N, Q;
vi arr, rec;
vi ans;

vi ask(vi s)
{
	int tmp[100], tmp1[100];
	FOR(i, 0, N)
	{
		tmp[i] = s[i];
	}
	playRound(tmp, tmp1);
	FOR(i, 0, N)
	{
		s[i] = tmp1[i];
	}
	return s;
}

int minValue(int n, int q)
{
	N = n; Q = q; arr.resize(N);
	arr[0] = 1;
	rec = ask(arr);
	FOR(i, 1, N)
	{
		if (rec[i] == 0) return i;
	}
    return 0;
}

int maxValue(int n, int q)
{
    N = n; Q = q; arr.resize(N);
    return 0;
}

int greaterValue(int n, int q)
{
	N = n; Q = q; arr.resize(N);
    return 0;
}

void allValues(int n, int q, int *res)
{
    N = n; Q = q; arr.resize(N); ans.resize(N);
	FOR(i, 0, N) res[i] = ans[i];
	return;
}

Subtask #1
4.0 / 4.0

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

Subtask #2
0 / 15.0

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

Subtask #3
0 / 18.0

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

Subtask #4
0 / 10.0

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

Subtask #5
0 / 53.0

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