Submission #1076880

#TimeUsernameProblemLanguageResultExecution timeMemory
1076880steveonalexGarage (IOI09_garage)C++17
45 / 100
1 ms628 KiB
// #include "aliens.h" #include <bits/stdc++.h> using namespace std; typedef long long ll; typedef unsigned long long ull; #define MASK(i) (1LL << (i)) #define GETBIT(mask, i) (((mask) >> (i)) & 1) #define ALL(v) (v).begin(), (v).end() #define block_of_code if(true) ll max(ll a, ll b){return (a > b) ? a : b;} ll min(ll a, ll b){return (a < b) ? a : b;} ll gcd(ll a, ll b){return __gcd(a, b);} ll lcm(ll a, ll b){return a / gcd(a, b) * b;} ll LASTBIT(ll mask){return (mask) & (-mask);} int pop_cnt(ll mask){return __builtin_popcountll(mask);} int ctz(ull mask){return __builtin_ctzll(mask);} int logOf(ull mask){return 63 - __builtin_clzll(mask);} mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count()); ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);} double rngesus_d(double l, double r){ double cur = rngesus(0, MASK(60) - 1); cur /= MASK(60) - 1; return l + cur * (r - l); } template <class T1, class T2> bool maximize(T1 &a, T2 b){ if (a < b) {a = b; return true;} return false; } template <class T1, class T2> bool minimize(T1 &a, T2 b){ if (a > b) {a = b; return true;} return false; } template <class T> void printArr(T container, string separator = " ", string finish = "\n", ostream &out = cout){ for(auto item: container) out << item << separator; out << finish; } template <class T> void remove_dup(vector<T> &a){ sort(ALL(a)); a.resize(unique(ALL(a)) - a.begin()); } const int N = 105, M = 2007;; int n, m; int r[N]; int w[M]; bool occupied[N]; int pos[N]; int main(void){ ios::sync_with_stdio(0);cin.tie(0); cout.tie(0); clock_t start = clock(); int n, m; cin >> n >> m; for(int i = 1; i<=n; ++i) cin >> r[i]; for(int i = 1; i<=m; ++i) cin >> w[i]; deque<int> qu; ll ans = 0; for(int q = 0; q < 2 * m; ++q){ int u; cin >> u; if (u > 0){ int park_slot = 0; for(int i = 1; i<=n; ++i) if (!occupied[i]){ park_slot = i; occupied[i] = 1; break; } if (park_slot > 0){ ans += r[park_slot] * w[u]; pos[u] = park_slot; } else{ qu.push_back(u); } } else{ u = abs(u); occupied[pos[u]] = 0; if (qu.size()){ int v = qu.front(); qu.pop_front(); occupied[pos[u]] = 1; pos[v] = pos[u]; ans += r[pos[v]] * w[v]; } } } cout << ans << "\n"; cerr << "Time elapsed: " << clock() - start << " ms\n"; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...