Submission #723429

#TimeUsernameProblemLanguageResultExecution timeMemory
723429n0sk1llKoala Game (APIO17_koala)C++14
19 / 100
15 ms320 KiB
#include <bits/stdc++.h> #define FAST ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);cerr.tie(0) #define mp make_pair #define xx first #define yy second #define pb push_back #define pf push_front #define popb pop_back #define popf pop_front #define all(x) x.begin(),x.end() #define ff(i,a,b) for (int i = a; i < b; i++) #define fff(i,a,b) for (int i = a; i <= b; i++) #define bff(i,a,b) for (int i = b-1; i >= a; i--) #define bfff(i,a,b) for (int i = b; i >= a; i--) using namespace std; long double typedef ld; unsigned int typedef ui; long long int typedef li; pair<int,int> typedef pii; pair<li,li> typedef pli; pair<ld,ld> typedef pld; vector<vector<int>> typedef graph; unsigned long long int typedef ull; //const int mod = 998244353; const int mod = 1000000007; //Note to self: Check for overflow #include "koala.h" int R[100]; int B[100]; int minValue(int n, int w) { B[0]=1; playRound(B,R); ff(i,0,n) if (R[i]==0) return i; return 0; } int maxValue(int n, int w) { ff(i,0,n) B[i]=1; int keci=n; while (keci>1) { playRound(B,R); ff(i,0,n) { if (R[i]==0) { if (B[i]>0) keci--; B[i]=0; } } ff(i,0,n) { if (R[i]!=0 && B[i]!=0) { B[i]=w/keci; } } } ff(i,0,n) if (B[i]>0) return i; return 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. 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. } }
#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...