Submission #582137

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
582137	2022-06-23 12:21:04	AlexLuchianov	Arranging Tickets (JOI17_arranging_tickets)	C++14	100 / 100	803 ms	13964 KiB

arranging_tickets

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 <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <cassert>
#include <queue>
using ll = long long;
int const nmax = 200000;
ll acc[5 + nmax];
ll init[5 + nmax], pref[5 + nmax], suff[5 + nmax];
std::vector<std::pair<int,int>> queries[5 + nmax];
bool solve(int n, int m, int start, ll smax, ll target) {
  std::priority_queue<std::pair<int,int>> pq;
  for(int i = 1;i <= n; i++)
    acc[i] = 0;
  ll expended = 0;
  
  for(int i = 1;i <= start; i++) {
    ll needToErase = (1 + init[i] + target - smax) / 2;
    needToErase = std::max(0LL, needToErase - expended);
    for(int h = 0; h < queries[i].size(); h++)
      pq.push(queries[i][h]);
    expended += needToErase;
    
    while(0 < pq.size() && 0 < needToErase) {
      std::pair<int,int> tp = pq.top();
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 10 / 10
• Subtask 2: 35 / 35
• Subtask 3: 20 / 20
• Subtask 4: 20 / 20
• Subtask 5: 15 / 15