Submission #234245

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
234245	2020-05-23 14:19:54	tinjyu	Robots (IOI13_robots)	C++14	100 / 100	1919 ms	29048 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 <iostream>
#include <algorithm>
using namespace std;
struct node{
  int w,s;
}id[1000004];
long long int temp[1000005],a,b,t,x[1000005],y[1000005],num[1000005];
bool cmp2(long long int tmp1,long long int tmp2)
{
  return tmp1<tmp2;
}
long long int check(int m)
{
  //cout<<m<<endl;
  long long int p1=t-1,p2=a-1,now=0;
  num[0]=0;
  while(p1>=0 || p2>=0)
  {
    //cout<<id[p1].w<<" "<<x[p2]<<endl;
    temp[0]=0;
    while((id[p1].w>=x[p2] || p2==-1) && p1>=0)
    {
      temp[0]++;
      temp[temp[0]]=id[p1].s;
      p1--;
    }
    sort(temp+1,temp+temp[0]+1,cmp2);
    for(int i=1;i<=temp[0]-now;i++)
    {
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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