제출 #990068

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
990068		bachhoangxuan	Garage (IOI09_garage)	C++17	100 / 100	1 ms	4444 KiB

garage

// Judges with GCC >= 12 only needs Ofast
// #pragma GCC optimize("O3,no-stack-protector,fast-math,unroll-loops,tree-vectorize")
// MLE optimization
// #pragma GCC optimize("conserve-stack")
// Old judges
// #pragma GCC target("sse4.2,popcnt,lzcnt,abm,mmx,fma,bmi,bmi2")
// New judges. Test with assert(__builtin_cpu_supports("avx2"));
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma,tune=native")
// Atcoder
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma")
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
- insert(x),erase(x)
- find_by_order(k): return iterator to the k-th smallest element
- order_of_key(x): the number of elements that are strictly smaller
*/
#include<bits/stdc++.h>
using namespace std;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
uniform_real_distribution<> pp(0.0,1.0);
#define int long long
#define ld long double
#define pii pair<int,int>
#define piii pair<int,pii>
#define mpp make_pair
#define fi first
#define se second
const long long inf=1e18;
const int mod=998244353;
const int maxn=200005;
const int B=650;
const int maxs=655;
const int maxm=200005;
const int maxq=1000005;
const int maxl=25;
const int maxa=1000000;
const int root=3;
int power(int a,int n){
    int res=1;
    while(n){
        if(n&1) res=res*a%mod;
        a=a*a%mod;n>>=1;
    }
    return res;
}
const int iroot=power(3,mod-2);
const int base=101;

int n,m,R[maxn],W[maxn],cc[maxn];
bool del[maxn];
queue<int> q;

void solve(){
    cin >> n >> m;
    for(int i=1;i<=n;i++) cin >> R[i];
    for(int i=1;i<=m;i++) cin >> W[i];
    int total=0;
    for(int i=1;i<=2*m;i++){
        int id;cin >> id;
        if(id>0) q.push(id);
        else{
            del[-id]=true;
            for(int i=1;i<=n;i++) if(cc[i]==-id) cc[i]=0;
        }
        while(!q.empty()){
            int p=0;
            for(int i=n;i>=1;i--) if(!cc[i]) p=i;
            if(!p) break;
            int u=q.front();q.pop();
            total+=W[u]*R[p];
            if(!del[u]) cc[p]=u;
        }
    }
    cout << total << '\n';
}

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);cout.tie(NULL);
    int test=1;//cin >> test;
    while(test--) solve();
}

• Subtask 1: 100 / 100