Submission #152023

#TimeUsernameProblemLanguageResultExecution timeMemory
152023EntityITHomecoming (BOI18_homecoming)C++14
0 / 100
53 ms16852 KiB
#include<bits/stdc++.h> #include "homecoming.h" using namespace std; using ll = long long; ll solve(int n, int K, int *a, int *b) { ll ret = 0; vector<ll> prefB; for (int i = 0; i < (n << 1); ++i) prefB.push_back( (i ? prefB[i - 1] : 0) + (b[i % n]) ); for (int i = 0; i < n; ++i) { ret += max( (ll)0, a[i] - prefB[i + K - 1] + (i ? prefB[i - 1] : 0) ); } return ret; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...