Submission #892944

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
892944	2023-12-26T08:24:48 Z	LCJLY	Garage (IOI09_garage)	C++14	100 / 100	1 ms	604 KB

garage

#include <bits/stdc++.h>
using namespace std;

#define int long long
#define ld long double
#define show(x,y) cout << y << " " << #x << endl;
#define show2(x,y,i,j) cout << y << " " << #x << "  " << j << " " << #i << endl;
#define show3(x,y,i,j,p,q) cout << y << " " << #x << "  " << j << " " << #i << "  " << q << " " << #p << endl; 
#define show4(x,y) for(auto it:x) cout << it << " "; cout << #y << endl;
typedef pair<int,int>pii;
typedef pair<pii,pii>pi2;

void solve(){	
	int n,m;
	cin >> n >> m;
	
	int rate[n+1];
	for(int x=1;x<=n;x++){
		cin >> rate[x];
	}
	
	int weight[m+1];
	for(int x=1;x<=m;x++){
		cin >> weight[x];
	}
	
	int index[m+1];
	
	int temp;
	set<int>se;
	for(int x=1;x<=n;x++) se.insert(x);
	int counter=0;
	queue<int>q;
	for(int x=0;x<2*m;x++){
		cin >> temp;
		if(temp>0){
			q.push(temp);
		}
		else{
			temp=-temp;
			se.insert(index[temp]);
		}
		
		if(!se.empty()&&!q.empty()){
			int hold=*se.begin();
			se.erase(se.find(hold));
			int hold2=q.front();
			q.pop();
			index[hold2]=hold;
			counter+= rate[hold]*weight[hold2];
		}
	}
	
	cout << counter;
	
	
}

int32_t main(){										
	ios::sync_with_stdio(0);	
	cin.tie(0);
	//freopen("in.txt", "r", stdin);
	int t=1;
	//cin >> t;
	while(t--){
		solve();
	}	
}



		


		
		
	

Subtask #1

100.0 / 100.0

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