제출 #235650

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
235650	2020-05-29 05:54:40	crossing0ver	로봇 (IOI13_robots)	C++17	100 / 100	1843 ms	29988 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<bits/stdc++.h>
#define ll long long
#define ld long double
#include "robots.h"
using namespace std;
int a,b,t,X[50001],Y[50001],W[1000001],S[1000001], flag = 1;
vector<pair<int,int> > f;
void count_max() {
  int mxW = 0;
  int mxS = 0;
  for (int i = 0; i < a; i++) mxW = max (mxW,X[i]);
  for (int i = 0; i < b; i++) mxS = max (mxS,Y[i]);
  for (int i = 0; i < t; i++) 
    if (W[i] >= mxW && S[i] >= mxS) flag = 0;
}
bool solve (int d) {
  int ptr = 0;
  priority_queue<int> pq;
  for (int i = 0; i < a; i++) {
    int s = d;
    while (ptr < t && X[i] > f[ptr].first) {
      pq.push (f[ptr].second),ptr++;
    }
    while (s && !pq.empty()) {
      pq.pop(),s--;
    } 
  }
  vector <int> v;
  while (!pq.empty()) {
    v.push_back(pq.top());
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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