# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
879052 | 2023-11-26T08:00:32 Z | klee | Garage (IOI09_garage) | C++14 | 3 ms | 376 KB |
#include <bits/stdc++.h> using namespace std; int main() { int a,b; int counter=0; queue <int> q; cin >> a; cin >> b; int price[a+1]; int slot[a+1]; for(int i=1; i<=a; i++) { int x; cin >> x; price[i] = x; } for(int i=1;i<=a; i++) { slot[i] = 0; } int weight[b+1]; for(int i=1;i<=b; i++) { int x; cin >> x; weight[i] = x; } for(int i=1;i<=2*b; i++) { int y; cin >> y; if(y>0) { q.push(y); for(int i=1; i<=a; i++) { if((slot[i]==0)&&(!q.empty())) { slot[i]=q.front(); q.pop(); } } } else { int g; for(int i=1;i<=a; i++) { if(slot[i]==y*-1) { g = i; slot[i] = 0; } } for(int i=1; i<=a; i++) { if((slot[i]==0)&&(!q.empty())) { slot[i]=q.front(); q.pop(); } } counter+= (price[g]*weight[-1*y]); } } cout << counter; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 344 KB | Output is correct |
2 | Correct | 0 ms | 348 KB | Output is correct |
3 | Correct | 0 ms | 348 KB | Output is correct |
4 | Correct | 0 ms | 348 KB | Output is correct |
5 | Correct | 0 ms | 348 KB | Output is correct |
6 | Correct | 0 ms | 348 KB | Output is correct |
7 | Correct | 0 ms | 348 KB | Output is correct |
8 | Correct | 0 ms | 348 KB | Output is correct |
9 | Correct | 0 ms | 348 KB | Output is correct |
10 | Correct | 0 ms | 348 KB | Output is correct |
11 | Correct | 0 ms | 348 KB | Output is correct |
12 | Correct | 1 ms | 348 KB | Output is correct |
13 | Correct | 1 ms | 348 KB | Output is correct |
14 | Correct | 1 ms | 348 KB | Output is correct |
15 | Correct | 1 ms | 348 KB | Output is correct |
16 | Correct | 2 ms | 376 KB | Output is correct |
17 | Correct | 2 ms | 348 KB | Output is correct |
18 | Correct | 2 ms | 348 KB | Output is correct |
19 | Correct | 2 ms | 348 KB | Output is correct |
20 | Correct | 3 ms | 344 KB | Output is correct |