oj.uz

Submission #54159

# Submission time Handle Problem Language Result Execution time Memory
54159 2018-07-02T14:01:42 Z hogogk(#1409) Garage (IOI09_garage) C++11
40 / 100
 3 ms 812 KB 
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
queue<int> wait;
priority_queue<int> parking;
int cost[1006],car[10007],weight[10006];
int main()
{
	int N,M; scanf("%d %d",&N,&M);
	ll ans=0;
	for(int i=1;i<=N;i++) parking.push(-i);
	for(int i=1;i<=N;i++) scanf("%d",&cost[i]);
	for(int i=1;i<=M;i++) scanf("%d",&weight[i]);
	for(int i=0;i<2*M;i++)
	{
		int t; scanf("%d",&t);
		if(t<0) parking.push(-car[-t]);
		else
		{
			if(parking.size()==0) wait.push(t);
			else
			{
				int v=-parking.top();
				parking.pop();
				car[t]=v; ans+=weight[t]*cost[v];
			}
		}
		while(!wait.empty() && !parking.empty())
		{
			int c1=wait.front(); wait.pop();
			int c2=-parking.top(); parking.pop();
			printf("%d %d",c1,c2);
			car[c1]=c2; ans+=cost[c2]*weight[c1];
		}
	}
	return !printf("%lld",ans);
}

Compilation message

garage.cpp: In function 'int main()':
garage.cpp:9:16: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  int N,M; scanf("%d %d",&N,&M);
           ~~~~~^~~~~~~~~~~~~~~
garage.cpp:12:29: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for(int i=1;i<=N;i++) scanf("%d",&cost[i]);
                        ~~~~~^~~~~~~~~~~~~~~
garage.cpp:13:29: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for(int i=1;i<=M;i++) scanf("%d",&weight[i]);
                        ~~~~~^~~~~~~~~~~~~~~~~
garage.cpp:16:15: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   int t; scanf("%d",&t);
          ~~~~~^~~~~~~~~

Subtask #1
40.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 504 KB Output is correct
2 Incorrect 3 ms 516 KB Output isn't correct
3 Correct 3 ms 516 KB Output is correct
4 Incorrect 3 ms 516 KB Output isn't correct
5 Correct 2 ms 556 KB Output is correct
6 Incorrect 2 ms 608 KB Output isn't correct
7 Correct 2 ms 620 KB Output is correct
8 Incorrect 2 ms 624 KB Output isn't correct
9 Correct 2 ms 628 KB Output is correct
10 Incorrect 2 ms 756 KB Output isn't correct
11 Correct 2 ms 756 KB Output is correct
12 Incorrect 2 ms 756 KB Output isn't correct
13 Correct 3 ms 756 KB Output is correct
14 Incorrect 2 ms 756 KB Output isn't correct
15 Correct 2 ms 756 KB Output is correct
16 Incorrect 2 ms 756 KB Output isn't correct
17 Incorrect 3 ms 756 KB Output isn't correct
18 Incorrect 3 ms 756 KB Output isn't correct
19 Incorrect 3 ms 768 KB Output isn't correct
20 Incorrect 3 ms 812 KB Output isn't correct