| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 55371 | 2018-07-07T05:38:20 Z | yp155136 | 코알라 (APIO17_koala) | C++14 | 74 ms | 840 KB |
#include "koala.h"
#include <bits/stdc++.h>
using namespace std;
const int N = 105;
int b[N],r[N];
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.
b[0] = 1;
playRound(b,r);
if (r[0] == 0) return 0;
else
{
for(int i=0;N>i;i++)
{
if (r[i] == 0) return i;
}
}
return 0;
}
int maxValue(int N, int W) {
/*int yee = 11;
for (int i=91;100>i;i++) b[i]=yee;
playRound(b,r);
for (int i=0;100>i;i++) cout << r[i] << ' ' ;
cout << endl;
for (int i=0;100>i;i++)
{
if (r[i] == yee+1) cout << "i = " << i << endl;
}*/
vector<int> v;
for (int i=0;100>i;i++) v.push_back(i);
int take[4] = {1,2,4,11};
for (int i=0;4>i;i++)
{
memset(b,0,sizeof(b));
for (int j:v) b[j] = take[i];
playRound(b,r);
vector<int> vv;
for (int j:v)
{
if (r[j] == take[i]+1) vv.push_back(j);
}
v = vv;
}
return v[0];
// TODO: Implement Subtask 2 solution here.
// You may leave this function unmodified if you are not attempting this
// subtask.
return 0;
}
int greaterValue(int N, int W) {
int L=1,R=13;
while (L <= R)
{
int mid=(L+R)>>1;
memset(b,0,sizeof(b));
b[0] = mid;
b[1] = mid;
playRound(b,r);
if (r[0] != r[1])
{
if (r[0] > r[1]) return 0;
else return 1;
}
else if (r[0] > 0) L = mid+1;
else R = mid-1;
}
// TODO: Implement Subtask 3 solution here.
// You may leave this function unmodified if you are not attempting this
// subtask.
return 0;
}
bool cmp(const int &x,const int &y)
{
int L=1,R=13;
while (L <= R)
{
int mid=(L+R)>>1;
b[x] = mid;
b[y] = mid;
playRound(b,r);
if (r[x] != r[y])
{
b[x] = b[y] = 0;
if (r[x] > r[y]) return false;
else return true;
}
else if (r[x] > 0) L = mid+1;
else R = mid-1;
}
}
int pp[N];
void allValues(int N, int W, int *p) {
if (W == 2*N) {
// TODO: Implement Subtask 4 solution here.
// You may leave this block unmodified if you are not attempting this
// subtask.
} else {
int n=100;
for (int i=0;n>i;i++)
{
p[i] = i;
}
sort(p,p+n,cmp);
for (int i=0;n>i;i++)
{
pp[ p[i] ] = i;
}
for (int i=0;n>i;i++)
{
p[i] = pp[i]+1;
}
// 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 | 7 ms | 364 KB | Output is correct |
| 2 | Correct | 7 ms | 364 KB | Output is correct |
| 3 | Correct | 11 ms | 448 KB | Output is correct |
| 4 | Correct | 10 ms | 556 KB | Output is correct |
| # | 결과 | 실행 시간 | 메모리 | Grader output |
|---|---|---|---|---|
| 1 | Correct | 20 ms | 564 KB | Output is correct |
| 2 | Correct | 30 ms | 676 KB | Output is correct |
| 3 | Correct | 23 ms | 676 KB | Output is correct |
| 4 | Correct | 19 ms | 676 KB | Output is correct |
| # | 결과 | 실행 시간 | 메모리 | Grader output |
|---|---|---|---|---|
| 1 | Correct | 67 ms | 712 KB | Output is correct |
| 2 | Correct | 74 ms | 712 KB | Output is correct |
| 3 | Correct | 60 ms | 712 KB | Output is correct |
| 4 | Correct | 61 ms | 840 KB | Output is correct |
| 5 | Correct | 58 ms | 840 KB | Output is correct |
| 6 | Correct | 62 ms | 840 KB | Output is correct |
| 7 | Correct | 61 ms | 840 KB | Output is correct |
| 8 | Correct | 70 ms | 840 KB | Output is correct |
| 9 | Correct | 69 ms | 840 KB | Output is correct |
| 10 | Correct | 63 ms | 840 KB | Output is correct |
| # | 결과 | 실행 시간 | 메모리 | Grader output |
|---|---|---|---|---|
| 1 | Incorrect | 3 ms | 840 KB | Output isn't correct |
| 2 | Halted | 0 ms | 0 KB | - |
| # | 결과 | 실행 시간 | 메모리 | Grader output |
|---|---|---|---|---|
| 1 | Partially correct | 44 ms | 840 KB | Output is partially correct |
| 2 | Partially correct | 41 ms | 840 KB | Output is partially correct |
| 3 | Partially correct | 38 ms | 840 KB | Output is partially correct |
| 4 | Partially correct | 53 ms | 840 KB | Output is partially correct |
| 5 | Partially correct | 47 ms | 840 KB | Output is partially correct |
| 6 | Partially correct | 39 ms | 840 KB | Output is partially correct |
| 7 | Partially correct | 54 ms | 840 KB | Output is partially correct |
| 8 | Partially correct | 44 ms | 840 KB | Output is partially correct |
| 9 | Partially correct | 38 ms | 840 KB | Output is partially correct |
| 10 | Partially correct | 46 ms | 840 KB | Output is partially correct |
| 11 | Partially correct | 34 ms | 840 KB | Output is partially correct |
| 12 | Partially correct | 26 ms | 840 KB | Output is partially correct |
| 13 | Partially correct | 38 ms | 840 KB | Output is partially correct |
| 14 | Partially correct | 38 ms | 840 KB | Output is partially correct |
| 15 | Partially correct | 37 ms | 840 KB | Output is partially correct |
| 16 | Partially correct | 57 ms | 840 KB | Output is partially correct |
| 17 | Partially correct | 64 ms | 840 KB | Output is partially correct |
| 18 | Partially correct | 49 ms | 840 KB | Output is partially correct |
| 19 | Partially correct | 41 ms | 840 KB | Output is partially correct |
| 20 | Partially correct | 39 ms | 840 KB | Output is partially correct |
| 21 | Partially correct | 48 ms | 840 KB | Output is partially correct |
| 22 | Partially correct | 39 ms | 840 KB | Output is partially correct |
| 23 | Partially correct | 39 ms | 840 KB | Output is partially correct |
| 24 | Partially correct | 59 ms | 840 KB | Output is partially correct |
| 25 | Partially correct | 38 ms | 840 KB | Output is partially correct |
| 26 | Partially correct | 55 ms | 840 KB | Output is partially correct |
| 27 | Partially correct | 44 ms | 840 KB | Output is partially correct |
| 28 | Partially correct | 44 ms | 840 KB | Output is partially correct |
| 29 | Partially correct | 44 ms | 840 KB | Output is partially correct |
| 30 | Partially correct | 37 ms | 840 KB | Output is partially correct |
| 31 | Partially correct | 37 ms | 840 KB | Output is partially correct |
| 32 | Partially correct | 57 ms | 840 KB | Output is partially correct |
| 33 | Partially correct | 41 ms | 840 KB | Output is partially correct |
| 34 | Partially correct | 45 ms | 840 KB | Output is partially correct |
| 35 | Partially correct | 36 ms | 840 KB | Output is partially correct |
| 36 | Partially correct | 44 ms | 840 KB | Output is partially correct |
| 37 | Partially correct | 39 ms | 840 KB | Output is partially correct |
| 38 | Partially correct | 60 ms | 840 KB | Output is partially correct |
| 39 | Partially correct | 53 ms | 840 KB | Output is partially correct |
| 40 | Partially correct | 45 ms | 840 KB | Output is partially correct |