제출 #31468

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
31468	2017-08-27 16:33:40	top34051	로봇 (IOI13_robots)	C++14	100 / 100	2306 ms	20748 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 n,m,k;
int a[50005], b[50005];
pair<int,int> p[1000005];
priority_queue<pair<int,int> > heap;
bool check(int cnt) {
    int i,j,cur;
    j = 0;
    while(!heap.empty()) heap.pop();
    for(i=0;i<n;i++) {
        while(j<k && p[j].second<a[i]) heap.push(p[j++]);
        for(cur=0;cur<cnt && !heap.empty();cur++) heap.pop();
    }
    while(j<k) heap.push(p[j++]);
    for(i=m-1;i>=0;i--) {
        for(cur=0;cur<cnt && !heap.empty();cur++) {
            if(heap.top().first>=b[i]) return 0;
            if(!heap.empty()) heap.pop();
        }
    }
    return heap.empty();
}
bool cmp(pair<int,int> x,pair<int,int> y) {
    return x.second<y.second;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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