제출 #203833

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
203833	2020-02-22 12:31:57	youngyojun	Sushi (JOI16_sushi)	C++11	100 / 100	5106 ms	82544 KiB

sushi

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>
using namespace std;
 
const int MAXN = 400005;
const int MAXQ = 25005;
const int SQRN = 655;
 
struct BUK {
  priority_queue<int, vector<int>, greater<int>> QV;
  priority_queue<int> PQ;
  int A[SQRN];
  int S, E, N;
 
  int cal(int s, int e, int x) {
    for(int i = s; i <= e; i++)
      if(x < A[i]) swap(A[i], x);
    return x;
  }
 
  int f(int p, int q, int x) {
    p = max(S, p); q = min(E, q);
    if(p > q) return x;
    if(PQ.top() <= x) return x;
    if(p <= S && E <= q) {
      QV.push(x);
      int ret = PQ.top(); PQ.pop();
      PQ.push(x);
      return ret;
    }
 
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 5 / 5
• Subtask 2: 15 / 15
• Subtask 3: 80 / 80