oj.uz

Submission #239095

# Submission time Handle Problem Language Result Execution time Memory
239095 2020-06-14T11:28:55 Z T0p_ Garage (IOI09_garage) C++14
100 / 100
 6 ms 512 KB 
#include<bits/stdc++.h>
using namespace std;

int park[2020];
long long w[2020], s[110];
queue<int> q;
priority_queue<int> heap;

int main()
{
	int n, m;
	long long ans = 0;
	scanf(" %d %d",&n,&m);
	for(int i=1 ; i<=n ; i++)
	{
		scanf(" %lld",&s[i]);
		heap.push(-i);
	}
	for(int i=1 ; i<=m ; i++)
		scanf(" %lld",&w[i]);
	m *= 2;
	while(m--)
	{
		int no;
		scanf(" %d",&no);
		int op = (no < 0) ? 0 : 1;
		if(no < 0) no *= -1;
		if(op) q.push(no);
		else heap.push(-park[no]);
		while(!heap.empty() && !q.empty())
		{
			ans += s[-heap.top()] * w[q.front()];
			park[q.front()] = -heap.top();
			heap.pop();
			q.pop();
		}
	}
	printf("%lld\n",ans);
	return 0;
}

Compilation message

garage.cpp: In function 'int main()':
garage.cpp:13:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf(" %d %d",&n,&m);
  ~~~~~^~~~~~~~~~~~~~~~
garage.cpp:16:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf(" %lld",&s[i]);
   ~~~~~^~~~~~~~~~~~~~~
garage.cpp:20:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf(" %lld",&w[i]);
   ~~~~~^~~~~~~~~~~~~~~
garage.cpp:25:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf(" %d",&no);
   ~~~~~^~~~~~~~~~~

Subtask #1
100.0 / 100.0

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