| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1366459 | afric | Bikeparking (EGOI24_bikeparking) | C++20 | 71 ms | 8876 KiB |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<long long> x;
vector<long long> y;
for (int i = 0; i < n; i++) {
long long inpt; cin >> inpt;
x.push_back(inpt);
}
for (int i = 0; i < n; i++) {
long long inpt; cin >> inpt;
y.push_back(inpt);
}
long long val = x[0];
if (n == 2 || n == 1) {
cout << 0 << endl;
return 0;
}
cout << val * (n-2) << endl;
return 0;
}| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
