oj.uz

답안 #441182

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
441182 2021-07-04T13:41:58 Z FEDIKUS Garage (IOI09_garage) C++17
100 / 100
 2 ms 332 KB 
#include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define pf push_front
#define popb pop_back
#define popf pop_front
#define xx first
#define yy second
#define srt(a) sort(a.begin(),a.end());
#define srtg(a,int) sort(a.begin(),a.end(),greater<int>())
#define lb(a,x) lower_bound(a.begin(),a.end(),x)
#define up(a,x) upper_bound(a.begin(),a.end(),x)
#define fnd(a,x) find(a.begin(),a.end(),x)
#define vstart auto startt=chrono::system_clock::now()
#define vend auto endd=chrono::system_clock::now()
#define vvreme chrono::duration<double> vremee=endd-startt
#define ios ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)

using namespace std;

typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef string str;

const int maxn=110;
const int maxm=2010;

int mul[maxn];
int tez[maxm];
bool mesto[maxm];
int gde[maxm];

void solve(){
    int n,m;
    cin>>n>>m;
    for(int i=0;i<n;i++) cin>>mul[i];
    for(int i=1;i<=m;i++) cin>>tez[i];
    int res=0;
    queue<int> sled;
    for(int i=0;i<2*m;i++){
        int a;
        cin>>a;
        if(a>0){
            sled.push(a);
        }else{
            a=abs(a);
            mesto[gde[a]]=false;
        }
        if(!sled.empty())
            for(int j=0;j<n;j++){
                if(!mesto[j]){
                    gde[sled.front()]=j;
                    mesto[j]=true;
                    res+=mul[j]*tez[sled.front()];
                    sled.pop();
                    break;
                }
            }
    }
    cout<<res;
}

int main(){
    ios;
    int t=1;
    //cin>>t;
    while(t--) solve();
    return 0;
}

Subtask #1
100.0 / 100.0

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