| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1232432 | yixuan19 | Bikeparking (EGOI24_bikeparking) | C++20 | 48 ms | 2764 KiB |
#include <bits/stdc++.h>
#include <iostream>
#include <vector>
using namespace std;
int main(){
int N, slot, user;
cin >> N;
vector<int> slots(N+1,0);
vector<int> users(N+1,0);
for (int i = 0; i < N; ++i){
cin >> slots[i];
}
for (int i = 0; i < N; ++i){
cin >> users[i];
}
if (N<=2){
cout<<min(slots[0]-users[0],users[1])<<endl;
}else{
cout<<slots[0]*N-2<<endl;
}
}| # | 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... | ||||
