| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1335871 | yc11 | Bikeparking (EGOI24_bikeparking) | C++20 | 102 ms | 2756 KiB |
#include<bits/stdc++.h>
using namespace std;
int n;
vector<int> n1;
vector<int> n2;
signed main(){
cin>>n;
n1.resize(n);
n2.resize(n);
for (int i = 0;i<n;i++) cin>>n1[i];
for (int i = 0;i<n;i++) cin>>n2[i];
if (n==1) cout<<0;
else if (n==2){
int ans = n1[0]-n2[0];
if (n1[0]>n2[1]){
ans = max(ans,n2[1]-(n1[0]-(n1[0]-n2[1])));
}
else ans = max(ans,n1[0]-n2[0]);
cout<<ans;
}
else cout<<(n-1)*n1[0]-n1[0];
}
| # | 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... | ||||
