Submission #850268

#TimeUsernameProblemLanguageResultExecution timeMemory
850268RifalHomecoming (BOI18_homecoming)C++14
0 / 100
118 ms4696 KiB
#include <bits/stdc++.h> #include "homecoming.h" #include <fstream> #define endl '\n' #define mod 998244353 #define INF 9000000000 //#define cin fin //#define cout fout //#define fi first //#define se second using namespace std; //ofstream fout("intel.out"); //ifstream fin("intel.in"); long long solve(int N, int K, int *A, int *B) { long long ans = 0; bool ok[N] = {}; for(int q = 0; q < N; q++) { long long now = ans; for(int i = 0; i < N; i++) { long long sum = 0; if(ok[i] == 1) continue; for(int j = 0; j < K; j++) { sum += B[(i+j)%N]; } if(sum < A[i]) { ok[i] = 1; ans += A[i]-sum; for(int j = 0; j < K; j++) { B[(i+j)%N] = 0;} } } if(now == ans) break; } return ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...