Submission #792431

#TimeUsernameProblemLanguageResultExecution timeMemory
792431vjudge1Bitaro's travel (JOI23_travel)C++17
15 / 100
3057 ms3028 KiB
#include<bits/stdc++.h> using namespace std; using ll = long long; ll INF = 1e9 + 10; int main() { ios::sync_with_stdio(0); cin.tie(0);cout.tie(0); int n; cin >> n; int x[n + 2] = {}; for(int i = 1; i <= n; i++) cin >> x[i]; int q; cin >> q; while(q--) { ll ans = 0; ll cur; cin >> cur; int cnt = 0; int l = 0, r = 1; while(r <= n && x[r] <= cur) r++; l = r - 1; while(cnt < n) { // cout << l << ' ' << r << '\n'; int w1 = (l > 0 ? cur - x[l] : INF); int w2 = (r < n + 1 ? x[r] - cur : INF); ans += min(w1, w2); if(w1 <= w2) cur = x[l--]; else cur = x[r++]; cnt++; } cout << ans << '\n'; } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...