| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1335833 | WongYiKai | Bikeparking (EGOI24_bikeparking) | C++20 | 104 ms | 5100 KiB |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ll n;
cin >> n;
ll x[n],y[n];
ll u=0,d=0;
for (int i=0;i<n;i++) cin >> x[i];
for (int i=0;i<n;i++) cin >> y[i];
ll idx = 0;
ll neutral = 0;
for (int i=0;i<n;i++){
while (idx < n && x[i] > 0){
if (idx == i){
y[idx] -= neutral;
neutral = 0;
}
if (y[idx] > x[i]){
if (idx > i){
u += x[i];
y[idx] -= x[i];
x[i] = 0;
}
else{
y[idx] -= x[i];
neutral += x[i];
x[i] = 0;
d += y[idx];
idx++;
}
}
else{
if (idx > i){
u += y[idx];
x[i] -= y[idx];
y[idx] = 0;
idx++;
}
else{
x[i] -= y[idx];
neutral += y[idx];
y[idx] = 0;
idx++;
}
}
}
}
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... | ||||
