| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1339752 | sally | Bikeparking (EGOI24_bikeparking) | C++20 | 103 ms | 2756 KiB |
#include<iostream>
#include<vector>
using namespace std;
int N;
vector<int> p, b; // person bike
int main() {
cin>>N;
p.resize(N+1);
b.resize(N+1);
for(int i=0; i<N; i++) cin>>p[i];
for(int i=0; i<N; i++) cin>>b[i];
cout<<max(N-2, 0)*p[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... | ||||
