제출 #197501

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
197501	2020-01-21 13:15:52	handlename	로봇 (IOI13_robots)	C++17	100 / 100	1962 ms	24688 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 <bits/stdc++.h>
using namespace std;
int putaway(int A, int B, int T, int X[], int Y[], int W[], int S[]) {
  sort(X,X+A);
  sort(Y,Y+B);
  if (T<=50){
      multiset<pair<int,int> > weight;
      multiset<pair<int,int> > sizee;
      for (int i=0;i<T;i++){
          if (W[i]>=X[A-1] && S[i]>=Y[B-1]) return -1;
          weight.insert(make_pair(W[i],S[i]));
          sizee.insert(make_pair(S[i],W[i]));
      }
      int wstart=0,sstart=0,total=0;
      while (!weight.empty()){
          for (int i=wstart;i<A;i++){
              auto it=weight.lower_bound(make_pair(X[i],0));
              if (it==weight.begin()){
                  wstart=i;
                  continue;
              }
              else {
                  it--;
                  int curw=(*it).first;
                  int curs=(*it).second;
                  weight.erase(it);
                  sizee.erase(sizee.find(make_pair(curs,curw)));
              }
          }
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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