#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int,int>
#define pll pair<ll,ll>
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define all(vr) vr.begin(),vr.end()
#define vi vector<int>
#define vll vector<ll>
#include "koala.h"
int B[100],R[100];
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);
int res;
for (int i=0;i<N;i++)
if (R[i]<=B[i]) res=i;
return res;
}
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.
vi vt;
for (int i=0;i<N;i++) vt.eb(i);
while (vt.size()>1)
{
for (int i=0;i<N;i++) B[i]=0;
int val=W/vt.size();
val=min(val,11);
for (int x : vt) B[x]=val;
playRound(B,R);
vt.clear();
for (int i=0;i<N;i++)
if (R[i]>val) vt.eb(i);
}
return vt[0];
}
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.
int val[7]={1,2,3,4,5,6,8};
int l=0,r=6,res=2;
while (l<=r)
{
int mid=(l+r)/2;
B[0]=B[1]=val[mid];
playRound(B,R);
int cnt=0;
for (int i=0;i<=1;i++)
if (R[i]>val[mid]) res=i,cnt++;
if (cnt==1) break;
if (cnt==2) l=mid+1;
else r=mid-1;
}
return res;
}
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.
}
}
/*int main()
{
//freopen("ss.inp","r",stdin);
ios::sync_with_stdio(false);
cin.tie(0);
return 0;
}*/
Compilation message
koala.cpp: In function 'int minValue(int, int)':
koala.cpp:28:12: warning: 'res' may be used uninitialized in this function [-Wmaybe-uninitialized]
28 | return res;
| ^~~
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
5 ms |
364 KB |
Output is correct |
2 |
Correct |
6 ms |
364 KB |
Output is correct |
3 |
Correct |
6 ms |
364 KB |
Output is correct |
4 |
Correct |
6 ms |
388 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
18 ms |
364 KB |
Output is correct |
2 |
Correct |
19 ms |
396 KB |
Output is correct |
3 |
Correct |
18 ms |
364 KB |
Output is correct |
4 |
Correct |
19 ms |
364 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
96 ms |
364 KB |
Output is correct |
2 |
Correct |
99 ms |
404 KB |
Output is correct |
3 |
Correct |
86 ms |
400 KB |
Output is correct |
4 |
Correct |
88 ms |
408 KB |
Output is correct |
5 |
Correct |
88 ms |
364 KB |
Output is correct |
6 |
Correct |
92 ms |
364 KB |
Output is correct |
7 |
Correct |
88 ms |
428 KB |
Output is correct |
8 |
Correct |
88 ms |
404 KB |
Output is correct |
9 |
Correct |
85 ms |
364 KB |
Output is correct |
10 |
Correct |
87 ms |
364 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
0 ms |
364 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
0 ms |
364 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |