Submission #15632

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
15632	2015-07-13 13:32:42	progressive	Robots (IOI13_robots)	C++14	100 / 100	2146 ms	17500 KiB

robots

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include "robots.h"
#include<algorithm>
#include<queue>
#include<cstdio>
using namespace std;
static int A,B,T;
static int *X,*Y;
static pair<int,int> toy[1010101];
static bool can(int a)
{
  int ptoy=0;
  priority_queue<int> PQ;
  for(int i=0;i<A;i++)
  {
    while(ptoy<T && toy[ptoy].first<X[i])
      PQ.push(toy[ptoy++].second);
    for(int j=0;j<a && !PQ.empty() ;j++)
      PQ.pop();
  }
  for(int i=ptoy;i<T;i++)
    PQ.push(toy[i].second);
  for(int i=B-1;i>=0;i--)
  {
    if(PQ.empty()) return true;
    if(PQ.top()>=Y[i]) return false;
    for(int j=0;j<a && !PQ.empty();j++)
      PQ.pop();
  }
  return PQ.empty();
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 14 / 14
• Subtask 2: 14 / 14
• Subtask 3: 25 / 25
• Subtask 4: 37 / 37
• Subtask 5: 10 / 10