oj.uz

답안 #1007472

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1007472 2024-06-25T03:29:47 Z huutuan Garage (IOI09_garage) C++14
100 / 100
 1 ms 480 KB 
#include <bits/stdc++.h>

using namespace std;

int n, m, r[110], w[2010], pos[2010], id[110];

int32_t main(){
   ios_base::sync_with_stdio(false);
   cin.tie(nullptr);
   cin >> n >> m;
   for (int i=1; i<=n; ++i) cin >> r[i];
   for (int i=1; i<=m; ++i) cin >> w[i];
   int ans=0;
   queue<int> q;
   for (int i=1; i<=m*2; ++i){
      int x; cin >> x;
      if (x>0){
         q.push(x);
      }else{
         x=-x;
         id[pos[x]]=0;
         pos[x]=0;
      }
      while (q.size()){
         int j=-1;
         for (int k=1; k<=n; ++k) if (id[k]==0){
            j=k;
            break;
         }
         if (j==-1) break;
         id[j]=q.front();
         pos[q.front()]=j;
         ans+=r[j]*w[q.front()];
         q.pop();
      }
   }
   cout << ans << '\n';
   return 0;
}

Subtask #1
100.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 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 464 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 460 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 480 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 0 ms 468 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 472 KB Output is correct