Submission #63548

#TimeUsernameProblemLanguageResultExecution timeMemory
63548kylych03Homecoming (BOI18_homecoming)C++14
0 / 100
1088 ms4324 KiB
#include <bits/stdc++.h> using namespace std; long long solve(int N, int K, int *A, int *B){ int ok=1; long long res=0; //int *vis = new int[N]; //for(int i=0;i<N;i++) // vis[i]=1; while(ok){ ok=0; for(int i=0;i<N;i++) { int sum=0; for(int j=i;j<i+K;j++) sum+=B[j]; if(sum<=A[i]){ ok=1; //vis[i]=0; res+=(A[i]-sum); for(int j=i;j<i+K;j++) B[j]=0; } } } return res; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...