| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1335955 | enson | Bikeparking (EGOI24_bikeparking) | C++20 | 1096 ms | 19208 KiB |
#include <bits/stdc++.h>
using namespace std;
#define int long long
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
int N;
cin >> N;
int X[N], Y[N], U = 0, D = 0;
set<int>S;
for(int i = 0; i < N; i++) cin >> X[i];
for(int i = 0; i < N; i++){
cin >> Y[i];
if (Y[i] != 0) S.insert(i);
}
for(int i = 1; i < N; i++){
queue<int>eS;
for(int j: S){
if (i > j){
eS.push(j);
continue;
}
if (Y[j] >= X[j-i]) Y[j] -= X[j-i], U += X[j-i], X[j-i] = 0;
else U += Y[j], X[j-i] -= Y[j], Y[j] = 0, eS.push(j);
}
while(!eS.empty()){
S.erase(eS.front());
eS.pop();
}
}
for(int i = 0; i < N; i++){
D += Y[i] - min(Y[i], X[i]);
}
cout << U-D;
}
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
