Submission #75776

#TimeUsernameProblemLanguageResultExecution timeMemory
75776faustaadpKoala Game (APIO17_koala)C++17
22 / 100
62 ms784 KiB
#include "koala.h" #include<bits/stdc++.h> #define ll long long #define pb push_back #define mp make_pair #define fi first #define se second using namespace std; ll i; int minValue(int N, int W) { int a[110],b[110]; for(i=0;i<N;i++) a[i]=0; a[0]=1; playRound(a,b); for(i=0;i<N;i++) if(b[i]==0) return i; return 0; } vector<ll> v; int maxValue(int N, int W) { ll VS,K; int a[110],b[110]; for(i=0;i<N;i++) v.pb(i); VS=N; K=1; while(VS>1) { vector<ll> vv; for(i=0;i<N;i++) a[i]=0; K=N/VS; for(i=0;i<VS;i++) a[v[i]]=K; playRound(a,b); for(i=0;i<N;i++) if(b[i]>K&&a[i]==K) vv.pb(i); v=vv; // K++; VS=v.size(); //K++; //break; // cout<<VS<<"\n"; } if(VS==0) while(1); return v[0]; } ll L,R,C; int greaterValue(int N, int W) { int a[110],b[110]; for(i=0;i<N;i++) a[i]=0; L=1; R=min(14,N/2); while(L<=R) { C=(L+R)/2; a[0]=C; a[1]=C; playRound(a,b); //cout<<i<<" "<<b[0]<<" "<<b[1]<<"\n"; if(b[0]>b[1])return 0; if(b[0]<b[1])return 1; if(b[0]>C)L=C+1; else R=C-1; } return 0; } void allValues(int N, int W, int *P) { if (W == 2*N) { } else { // TODO: Implement Subtask 5 solution here. // You may leave this block unmodified if you are not attempting this // subtask. } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...