| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1359715 | FZ_Laabidi | Bikeparking (EGOI24_bikeparking) | C++20 | 37 ms | 2756 KiB |
#include <bits/stdc++.h>
using namespace std;
signed main(){
int n; cin >> n;
vector<int> x(n), y(n);
for(int i=0; i<n; i++)cin >> x[i];
for(int i=0; i<n; i++)cin >> y[i];
if(x==y||n==1)cout << 0 << endl;
else cout << min(y[1], x[0]-y[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... | ||||
