#include "koala.h"
#include<bits/stdc++.h>
using namespace std;
int b[100],r[100];
int minValue(int n, int w) {
for(int i=0;i<n;i++){
b[i]=0;
}
b[0]=1;
playRound(b,r);
if(r[0]==2){
for(int i=1;i<n;i++){
if(r[i]==0)return i;
}
}
return 0;
}
int maxValue(int n, int w) {
bool ok[n];
memset(ok,1,n);
for(int i=1;i<=16;i<<=1){
if(i==8)i=11;
for(int j=0;j<n;j++){
if(ok[j]){
b[j]=i;
}else{
b[j]=0;
}
}
playRound(b,r);
int cnt=0;
for(int j=0;j<n;j++){
if(ok[j]){
if(i<r[j]){
cnt++;
}else{
ok[j]=0;
}
}
}
}
for(int i=0;i<n;i++)if(ok[i])return i;
return -1;
}
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.
return 0;
}
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 {
// TODO: Implement Subtask 5 solution here.
// You may leave this block unmodified if you are not attempting this
// subtask.
}
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
4 ms |
344 KB |
Output is correct |
2 |
Correct |
3 ms |
456 KB |
Output is correct |
3 |
Correct |
3 ms |
344 KB |
Output is correct |
4 |
Correct |
4 ms |
344 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
11 ms |
344 KB |
Output is correct |
2 |
Correct |
9 ms |
344 KB |
Output is correct |
3 |
Correct |
9 ms |
344 KB |
Output is correct |
4 |
Correct |
10 ms |
340 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
1 ms |
344 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
1 ms |
344 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |