oj.uz

답안 #480165

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
480165 2021-10-15T03:30:12 Z gg123_pe Garage (IOI09_garage) C++17
100 / 100
 2 ms 204 KB 
#include <bits/stdc++.h> 
using namespace std; 

#define f(i,a,b) for(int i = a; i < b; i++)

int n, m, x, ans, rate[105], w[2005], place[2005], freee;
bool on[105]; 

int main(){
    cin >> n >> m; 
    f(i,1,n+1) cin >> rate[i]; 
    f(i,1,m+1) cin >> w[i]; 

    freee = n; 
    queue <int> q; 
    f(i,0,2*m){
        cin >> x; 
        if(x < 0){
            on[place[-x]] = 0, freee++; 

            while(!q.empty()){
                if(freee == 0) break; 

                int t = q.front();
                f(j,1,n+1){
                    if(!on[j]) {
                        place[t] = j, on[j] = 1, ans += rate[j]*w[t]; 
                        break; 
                    }
                } 
                q.pop(), freee--; 
            }
            continue; 
        }
        else{
            q.push(x); 
            while(!q.empty()){
                if(freee == 0) break; 

                int t = q.front();
                f(j,1,n+1){
                    if(!on[j]) {
                        place[t] = j, on[j] = 1, ans += rate[j]*w[t]; 
                        break; 
                    }
                } 
                q.pop(), freee--; 
            }
        }
    }

    cout << ans << endl; 
    return 0; 
}

Subtask #1
100.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 2 ms 204 KB Output is correct
17 Correct 2 ms 204 KB Output is correct
18 Correct 2 ms 204 KB Output is correct
19 Correct 2 ms 204 KB Output is correct
20 Correct 2 ms 204 KB Output is correct