| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 249349 | 2020-07-14T16:32:30 Z | SamAnd | 코알라 (APIO17_koala) | C++17 | 76 ms | 1500 KB |
#include "koala.h"
#include <bits/stdc++.h>
using namespace std;
#define m_p make_pair
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define fi first
#define se second
const int N = 102;
int n, w;
int minValue(int N, int W)
{
// TODO: Implement Subtask 1 solution here.
// You may leave this function unmodified if you are not attempting this
// subtask.
n = N;
w = W;
int* a;
a = new int[n];
for (int i = 0; i < n; ++i)
a[i] = 0;
a[0] = 1;
int* b = new int[n];
playRound(a, b);
for (int i = 0; i < n; ++i)
{
if (b[i] == 0)
return i;
}
return 0;
}
int maxValue(int N, int W)
{
// TODO: Implement Subtask 2 solution here.
// You may leave this function unmodified if you are not attempting this
// subtask.
n = N;
w = W;
vector<int> v;
for (int i = 0; i < n; ++i)
v.push_back(i);
while (1)
{
if (sz(v) == 1)
return v[0];
int* a;
a = new int[n];
for (int i = 0; i < n; ++i)
a[i] = 0;
for (int i = 0; i < v.size(); ++i)
{
a[v[i]] = W / sz(v);
}
int* b;
b = new int[n];
playRound(a, b);
vector<int> nv;
for (int i = 0; i < v.size(); ++i)
{
if (b[v[i]] > a[v[i]])
nv.push_back(v[i]);
}
v = nv;
}
return 0;
}
map<pair<int, int>, bool> mp;
bool so(int i, int j)
{
if (i == j)
return false;
if (mp.find(m_p(j, i)) != mp.end())
mp[m_p(i, j)] = mp[m_p(j, i)] ^ true;
if (mp.find(m_p(i, j)) != mp.end())
return mp[m_p(i, j)];
int l = 1;
int r = 14;
while (1)
{
int m = (l + r) / 2;
int* a;
a = new int[n];
for (int i = 0; i < n; ++i)
a[i] = 0;
a[i] = a[j] = m;
if (m * 2 > w)
{
r = m - 1;
continue;
}
int* b;
b = new int[n];
playRound(a, b);
if (b[i] > a[i] && b[j] <= a[j])
return mp[m_p(i, j)] = false;
if (b[i] <= a[i] && b[j] > a[j])
return mp[m_p(i, j)] = true;
if (b[i] <= a[i])
r = m - 1;
else
l = m + 1;
}
assert(false);
}
int greaterValue(int N, int W)
{
// TODO: Implement Subtask 3 solution here.
// You may leave this function unmodified if you are not attempting this
// subtask.
mp.clear();
n = N;
w = W;
if (so(0, 1))
return 1;
return 0;
}
void allValues(int N, int W, int *P)
{
mp.clear();
n = N;
w = W;
int* a;
a = new int[n];
for (int i = 0; i < n; ++i)
a[i] = i;
sort(a, a + n, so);
for (int i = 0; i < n; ++i)
P[a[i]] = i + 1;
if (W == 2 * N)
{
// TODO: Implement Subtask 4 solution here.
// You may leave this block unmodified if you are not attempting this
// subtask.
}
else
{
// TODO: Implement Subtask 5 solution here.
// You may leave this block unmodified if you are not attempting this
// subtask.
}
}
Compilation message
| # | 결과 | 실행 시간 | 메모리 | Grader output |
|---|---|---|---|---|
| 1 | Correct | 6 ms | 384 KB | Output is correct |
| 2 | Correct | 6 ms | 384 KB | Output is correct |
| 3 | Correct | 6 ms | 384 KB | Output is correct |
| 4 | Correct | 6 ms | 384 KB | Output is correct |
| # | 결과 | 실행 시간 | 메모리 | Grader output |
|---|---|---|---|---|
| 1 | Correct | 18 ms | 640 KB | Output is correct |
| 2 | Correct | 17 ms | 640 KB | Output is correct |
| 3 | Correct | 17 ms | 640 KB | Output is correct |
| 4 | Correct | 17 ms | 640 KB | Output is correct |
| # | 결과 | 실행 시간 | 메모리 | Grader output |
|---|---|---|---|---|
| 1 | Correct | 62 ms | 1240 KB | Output is correct |
| 2 | Correct | 74 ms | 1500 KB | Output is correct |
| 3 | Correct | 61 ms | 1240 KB | Output is correct |
| 4 | Correct | 76 ms | 1236 KB | Output is correct |
| 5 | Correct | 63 ms | 1240 KB | Output is correct |
| 6 | Correct | 62 ms | 1240 KB | Output is correct |
| 7 | Correct | 65 ms | 1368 KB | Output is correct |
| 8 | Correct | 62 ms | 1240 KB | Output is correct |
| 9 | Correct | 62 ms | 1240 KB | Output is correct |
| 10 | Correct | 64 ms | 1240 KB | Output is correct |
| # | 결과 | 실행 시간 | 메모리 | Grader output |
|---|---|---|---|---|
| 1 | Incorrect | 56 ms | 888 KB | Output isn't correct |
| 2 | Halted | 0 ms | 0 KB | - |
| # | 결과 | 실행 시간 | 메모리 | Grader output |
|---|---|---|---|---|
| 1 | Partially correct | 27 ms | 888 KB | Output is partially correct |
| 2 | Partially correct | 36 ms | 1016 KB | Output is partially correct |
| 3 | Partially correct | 32 ms | 1024 KB | Output is partially correct |
| 4 | Partially correct | 32 ms | 1144 KB | Output is partially correct |
| 5 | Partially correct | 36 ms | 1144 KB | Output is partially correct |
| 6 | Partially correct | 31 ms | 1016 KB | Output is partially correct |
| 7 | Partially correct | 32 ms | 1016 KB | Output is partially correct |
| 8 | Partially correct | 34 ms | 1016 KB | Output is partially correct |
| 9 | Partially correct | 35 ms | 1016 KB | Output is partially correct |
| 10 | Partially correct | 29 ms | 888 KB | Output is partially correct |
| 11 | Partially correct | 31 ms | 1016 KB | Output is partially correct |
| 12 | Partially correct | 20 ms | 768 KB | Output is partially correct |
| 13 | Partially correct | 34 ms | 1016 KB | Output is partially correct |
| 14 | Partially correct | 31 ms | 1024 KB | Output is partially correct |
| 15 | Partially correct | 32 ms | 1016 KB | Output is partially correct |
| 16 | Partially correct | 33 ms | 1016 KB | Output is partially correct |
| 17 | Partially correct | 42 ms | 1144 KB | Output is partially correct |
| 18 | Partially correct | 37 ms | 1144 KB | Output is partially correct |
| 19 | Partially correct | 31 ms | 1016 KB | Output is partially correct |
| 20 | Partially correct | 32 ms | 1016 KB | Output is partially correct |
| 21 | Partially correct | 31 ms | 1016 KB | Output is partially correct |
| 22 | Partially correct | 36 ms | 1144 KB | Output is partially correct |
| 23 | Partially correct | 26 ms | 896 KB | Output is partially correct |
| 24 | Partially correct | 34 ms | 1016 KB | Output is partially correct |
| 25 | Partially correct | 33 ms | 1016 KB | Output is partially correct |
| 26 | Partially correct | 35 ms | 1144 KB | Output is partially correct |
| 27 | Partially correct | 32 ms | 1016 KB | Output is partially correct |
| 28 | Partially correct | 35 ms | 1016 KB | Output is partially correct |
| 29 | Partially correct | 33 ms | 1152 KB | Output is partially correct |
| 30 | Partially correct | 32 ms | 1016 KB | Output is partially correct |
| 31 | Partially correct | 32 ms | 1024 KB | Output is partially correct |
| 32 | Partially correct | 33 ms | 1024 KB | Output is partially correct |
| 33 | Partially correct | 31 ms | 1024 KB | Output is partially correct |
| 34 | Partially correct | 28 ms | 896 KB | Output is partially correct |
| 35 | Partially correct | 33 ms | 1016 KB | Output is partially correct |
| 36 | Partially correct | 29 ms | 1016 KB | Output is partially correct |
| 37 | Partially correct | 32 ms | 1016 KB | Output is partially correct |
| 38 | Partially correct | 34 ms | 1016 KB | Output is partially correct |
| 39 | Partially correct | 32 ms | 1016 KB | Output is partially correct |
| 40 | Partially correct | 32 ms | 1016 KB | Output is partially correct |