#include <bits/stdc++.h>
#include "koala.h"
// #pragma GCC optimize("Ofast")
// #pragma GCC target("avx2")
// #pragma GCC optimization ("O3")
// #pragma GCC optimization ("unroll-loops")
// #pragma GCC target("popcnt")
using namespace std;
using ll = long long;
using ull = unsigned long long;
using lld = long double;
using vi = vector<int>;
using vll = vector<ll>;
using ii = pair<int,int>;
using pll = pair<ll, ll>;
using vii = vector<ii>;
using vpll = vector<pll>;
#define endl '\n'
#define all(x) x.begin(),x.end()
#define lsb(x) x&(-x)
#define gcd(a,b) __gcd(a,b)
#define sz(x) (int)x.size()
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define fls cout.flush()
#define fore(i,l,r) for(auto i=l;i<r;i++)
#define fo(i,n) fore(i,0,n)
#define forex(i,r,l) for(auto i=r; i>=l;i--)
#define ffo(i,n) forex(i,n-1,0)
bool cmin(int &a, int b){if(b<a){a=b;return 1;}return 0;}
bool cmax(int &a, int b){if(b>a){a=b;return 1;}return 0;}
void valid(ll in){cout<<((in)?"YES\n":"NO\n");}
ll lcm(ll a, ll b){return (a/gcd(a,b))*b;}
ll gauss(ll n){return (n*(n+1))/2;}
int minValue(int N, int W) {
int B[N], R[N];
fo(i,N)B[i]=0,R[i]=0;
fo(i,N){
B[i]=1;
playRound(B,R);
int mx=0;
fo(j,N)mx = max(mx, R[j]);
fo(j,N)if(R[j]==0)return j;
if(mx==1)return i;
assert(0);
B[i]=0;
}
return 0;
}
void Assert(int cond){
if(cond^1){
while(1)cout<<"s"<<endl;
}
}
int maxValue(int N, int W) {
int B[N], R[N];
fo(i,N)B[i]=R[i]=0;
fo(i,N)B[i]=1;
playRound(B,R);
fo(i,N)B[i]=0;
fo(i,N)if(R[i]>1)B[i]=2;
fo(i,N)R[i]=0;
playRound(B,R);
fo(i,N)B[i]=0;
fo(i,N)if(R[i]>2)B[i]=4;
fo(i,N)R[i]=0;
playRound(B,R);
fo(i,N)B[i]=0;
fo(i,N)if(R[i]>4)B[i]=21;
fo(i,N)R[i]=0;
playRound(B,R);
int c=0;
fo(i,N)if(R[i]>21)c++;
Assert(c==1);
fo(i,N)if(R[i]>21)return i;
Assert(0);
// return ans;
}
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.
}
}
// void test_case(){
// cin >> N >> W;
// int B[N], R[N];
// fo(i,N)B[i]=R[i]=0;
// fo(i,N)P[i]=i+1;
// fore(i,91,N)B[i]=16;
// playRound(B,R);
// fo(i,N)cout<<R[i]<<" ";
// cout<<endl;
// }
// int main(){cin.tie(0)->sync_with_stdio(0);
// int t=1;
// // cin >> t;
// while(t--)test_case();
// }
Compilation message
koala.cpp: In function 'int maxValue(int, int)':
koala.cpp:84:1: warning: control reaches end of non-void function [-Wreturn-type]
84 | }
| ^
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
344 KB |
Output is correct |
| 2 |
Correct |
3 ms |
344 KB |
Output is correct |
| 3 |
Correct |
2 ms |
344 KB |
Output is correct |
| 4 |
Correct |
2 ms |
344 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
344 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
