#include "koala.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double D;
typedef pair<ll,ll> P;
typedef pair<ll,P> T;
#define M 1000000007
#define F first
#define S second
#define PB push_back
#define INF 1000000001
int n,b[105],r[105];
void ini(void){
for(int i=0;i<n;i++)b[i]=0;
}
int minValue(int N, int w) {
n=N;
ini();
b[0]=1;
playRound(b,r);
for(int i=0;i<n;i++)if(b[i]>=r[i])return i;
}
int maxValue(int N,int w) {
n=N;
vector<int>res;
for(int i=0;i<n;i++)res.PB(i);
while(res.size()>1){
ini();
for(int i=0;i<res.size();i++)b[res[i]]=w/res.size();
playRound(b,r);
res.clear();
for(int i=0;i<n;i++)if(b[i]>0&&b[i]<r[i])res.PB(i);
}
return res[0];
}
int greaterValue(int N, int w) {
n=N;
ini();
b[0]=4,b[1]=4;
playRound(b,r);
if(b[0]<r[0]){
if(b[1]>=r[1])return 1;
b[0]=7,b[1]=7;
playRound(b,r);
if(b[0]<r[0]&&b[1]<r[1]){
b[0]=8,b[1]=8;
playRound(b,r);
}
if(b[0]<r[0])return 1;
else return 0;
}else if(b[1]<r[1])return 0;
else{
b[0]=2,b[1]=2;
playRound(b,r);
if(b[0]>=r[0]&&b[1]>=r[1]){
b[0]=1,b[1]=1;
playRound(b,r);
}
if(b[0]<r[0])return 1;
else return 0;
}
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.
}
}
Compilation message
koala.cpp: In function 'int maxValue(int, int)':
koala.cpp:31:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int i=0;i<res.size();i++)b[res[i]]=w/res.size();
~^~~~~~~~~~~
koala.cpp: In function 'int minValue(int, int)':
koala.cpp:23:1: warning: control reaches end of non-void function [-Wreturn-type]
}
^
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
7 ms |
384 KB |
Output is correct |
2 |
Correct |
6 ms |
384 KB |
Output is correct |
3 |
Correct |
7 ms |
384 KB |
Output is correct |
4 |
Correct |
7 ms |
384 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
16 ms |
384 KB |
Output is correct |
2 |
Correct |
17 ms |
384 KB |
Output is correct |
3 |
Correct |
19 ms |
384 KB |
Output is correct |
4 |
Correct |
15 ms |
384 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
2 ms |
384 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
2 ms |
384 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
3 ms |
384 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |