oj.uz

답안 #416583

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
416583 2021-06-02T16:22:21 Z ioi Garage (IOI09_garage) C++14
100 / 100
 2 ms 332 KB 
#include<bits/stdc++.h>
/*
Created By Tornado2004
*/
using namespace std;

#define debug(x) cout << '[' << #x << " is: " << x << "] " << endl;
#define imod(a , n) (a % n + n ) % n

#define fastio ios_base::sync_with_stdio(false);cin.tie(0);
#define inF freopen("ladder.in","r",stdin );
#define outF freopen("ladder.out" , "w" , stdout ) ;
#define sor(v) sort(v.begin() , v.end());
#define print(v) for(auto f : v ) cout << f << " " ;
#define rsor(v) sort(v.rbegin() , v.rend());
#define rev(v) reverse(v.begin() , v.end());
#define scan(v)for(auto &it : v)cin >> it ;

#define ll long long
#define int ll
#define logar(x , y) log(x) / log(y)
#define __sum(n) n * (n + 1) / 2
#define __lcm(a , b) a / __gcd(a , b) * b
#define pii pair<int , int >
const int N = 2e5 + 3 , K = 11 , M = N * 4 ;
const ll MOD = 998244353 , oo = 1e9 , OO = 1e18 , mod = MOD ;
const double pi = acos(-1) , eps = 1e-17 ;

//37
// (a ^ b / c ) % mod = (a ^ b ) % MOD * (c ^ (mod - 2)) % mod
// m is prime --> (a ^ m) % m = a % m

int di[] = {0 , 0 , 1 , -1};
int dj[] = {1 , -1 , 0 , 0};





int32_t main()
{   //inF;
    //inF;outF;
    fastio;




     int n , m;
     cin >> n >> m;
     ll ans = 0 ;
     ll pos[n] , arr[n];

     for(int i = 0 ; i <n ; i ++)
        cin >> arr[i];

     ll car[m];
     for(int i = 0 ;i < m ; i ++)
        cin >> car[i];

     bool busy[n] ;
     for(int i = 0 ;i < n ; i ++) busy[i] = false ;

     queue<int> q ;


     for(int i = 0 ; i < 2 * m; i ++){
        int a ;
        cin >>a ;

        if(a < 0){
            int done = 0 ;

            for(int j = 0 ; j < n ; j ++)
                if(pos[j] == -a){busy[j] = false , pos[j] = 0 , done ++;
                break;}

            if(!done)q.push(a);
        }
        else q.push(a);


        for(int j = 0 ; j < n && q.size() ; j ++){
            if(!busy[j] && q.front() > 0){
                busy[j] = true ;
                pos[j] = q.front();

                ans += arr[j] * car[q.front() - 1] ;  q.pop();


            }
            while(q.size() && q.front() < 0){

                for(int i = 0 ; i < n ; i ++)
                if(pos[i] == -q.front()){
                    q.pop();
                    busy[i] = 0 ;
                    pos[i] = 0 ;
                }

            }
        }
     }
     cout << ans ;


}

Subtask #1
100.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 312 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 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 316 KB Output is correct
14 Correct 1 ms 324 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 320 KB Output is correct
17 Correct 2 ms 332 KB Output is correct
18 Correct 2 ms 332 KB Output is correct
19 Correct 2 ms 332 KB Output is correct
20 Correct 2 ms 324 KB Output is correct