oj.uz

Submission #1016917

# Submission time Handle Problem Language Result Execution time Memory
1016917 2024-07-08T15:29:43 Z ByeWorld Garage (IOI09_garage) C++14
100 / 100
 2 ms 2396 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("O3", "unroll-loops")
#define ll long long
#define int long long
#define pb push_back
#define fi first
#define se second
#define lf (id<<1)
#define rg ((id<<1)|1)
#define md ((l+r)>>1)
#define ld long double
using namespace std;
typedef pair<int,int> pii;
typedef pair<pii, int> ipii;
const int MAXN = 1e5+10;
const int MAXA = 110;
const int INF = 1e18+10;
const int LOG = 19;
const int MOD = 1e9+7;
const int SQRT = 450;
const vector<int> NOL = {};
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const vector<int> dx = {1, -1, 0, 0};
const vector<int> dy = {0, 0, 1, -1};
void chmx(int &a, int b){ a = max(a, b); }

int n, m;
int x[MAXN], w[MAXN];
int pl[MAXN];

signed main(){
    // ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    cin >> n >> m;
    for(int i=1; i<=n; i++) cin >> x[i];
    for(int i=1; i<=m; i++) cin >> w[i];
    int ANS = 0;
    queue <int> q;
    set <int> s; for(int i=1; i<=n; i++) s.insert(i);
    for(int i=1; i<=2*m; i++){
        int p; cin >> p;
        if(p>0){
            if(s.empty()){
                q.push(p);
            } else {
                int idx = *(s.begin()); s.erase(idx); pl[p] = idx;
                // cout << p << ' ' << idx << " pp\n";
                ANS += w[p] * x[idx];
            }
        } else {
            s.insert(pl[-p]);
            if(!q.empty()){
                p = q.front();
                int idx = *(s.begin()); s.erase(idx); pl[p] = idx;
                // cout << p << ' ' << idx << " pp\n";
                ANS += w[p] * x[idx];
                q.pop();
            }
        }
    }
    cout << ANS << '\n';
}

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 1 ms 2392 KB Output is correct
6 Correct 1 ms 2392 KB Output is correct
7 Correct 0 ms 2396 KB Output is correct
8 Correct 0 ms 2396 KB Output is correct
9 Correct 0 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2392 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 2 ms 2396 KB Output is correct
17 Correct 1 ms 2396 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Correct 2 ms 2392 KB Output is correct
20 Correct 2 ms 2396 KB Output is correct