oj.uz

답안 #798051

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
798051 2023-07-30T10:23:26 Z YassirSalama Garage (IOI09_garage) C++14
100 / 100
 1 ms 340 KB 
#include <iostream>
#include <vector>
#include <algorithm>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <iomanip>
#include <cmath>
#include <limits>
#include <map>
#include <utility>
#include <cctype>
#include <string>
#include <cstring>
#include <stack>
#include <queue>
#include <functional>
#include <iterator>
using namespace std;
#define OVL(x,s) for(auto y:x) cout<<y<<s; cout<<"\n";
#define dbg(x) cout << "[ " << #x << " ] : " << x<<endl;
#define endl "\n"
#define pb push_back
#define F first
#define S second
#define ll long long
#define mod 1000000007
#define all(v) v.begin(),v.end()
#define int long long
const int MAXN=200;
const int MAXM=2100;
int arr[MAXN];
int w[MAXM];
signed main(){
ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
int n;
int m;
cin>>n>>m;
for(int i=1;i<=n;i++) cin>>arr[i];
for(int i=1;i<=m;i++) cin>>w[i];
set<int> s;
for(int i=1;i<=n;i++) s.insert(i);
map<int,int> mp;
queue<int> qq;
int ans=0;
for(int i=0;i<2*m;i++){
	int x;
	cin>>x;
	if(x>0){
		qq.push(x);
		int node=qq.front();
		auto it=s.begin();
		if(it==s.end()){
			continue;
		}else{
		    int c=*it;
			ans+=w[node]*arr[c];
			s.erase(it);
			mp[node]=c;
			qq.pop();
		}
	}else{
		int npark=mp[-x];
		mp.erase(-x);
		s.insert(npark);
		if(!qq.empty()){
    		int node=qq.front();
    		auto it=s.begin();
    		if(it==s.end()){
    			continue;
    		}else{
    		    int c=*it;
    			ans+=w[node]*arr[c];
    			s.erase(it);
    			mp[node]=c;
    			qq.pop();
    		}
		}
	}
}
cout<<ans<<endl;
}

Subtask #1
100.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct