oj.uz

Submission #582137

# Submission time Handle Problem Language Result Execution time Memory
582137 2022-06-23T12:21:04 Z AlexLuchianov Arranging Tickets (JOI17_arranging_tickets) C++14
100 / 100
 803 ms 13964 KB 
#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();
      pq.pop();
      if(needToErase < tp.second) {
        tp.second -= needToErase;
        pq.push(tp);
        acc[start] -= needToErase;
        acc[tp.first + 1] += 2 * needToErase;
        needToErase = 0;
      } else {
        acc[start] -= tp.second;
        acc[tp.first + 1] += 2 * tp.second;
        needToErase -= tp.second;
      }
    }
    if(0 < needToErase)
      return 0;
  }
  for(int i = 1; i <= n; i++)
    acc[i] += acc[i - 1];
  for(int i = start;i <= n; i++)
    if(!(acc[i] + init[i] <= smax))
      return 0;
  return 1;
};

int main() {
  std::ios::sync_with_stdio(0);
  std::cin.tie(0);

  int n, m;
  std::cin >> n >> m;
  for(int i = 1;i <= m; i++) {
    int x, y, cost;
    std::cin >> x >> y >> cost;
    if(y < x)
      std::swap(x, y);
    y--;
    queries[x].push_back({y, cost});
    init[x] += cost;
    init[y + 1] -= cost;
  }
  for(int i = 2;i <= n; i++)
    init[i] += init[i - 1];
  int start = 1;
  for(int i = 1; i <= n; i++)
    if(init[start] < init[i])
      start = i;
  ll x = 0;
  
  for(ll jump = (1LL << 60); 0 < jump; jump /= 2)
    if(solve(n, m, start, init[start] - (x + jump), x + jump) == 1 || solve(n, m, start, init[start] - (x + jump), x + jump + 1))
      x += jump;
  std::cout << init[start] - x << '\n';
  return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 3 ms 4972 KB Output is correct
6 Correct 3 ms 4948 KB Output is correct
7 Correct 3 ms 5040 KB Output is correct
8 Correct 3 ms 4948 KB Output is correct
9 Correct 3 ms 4948 KB Output is correct
10 Correct 3 ms 4948 KB Output is correct
11 Correct 2 ms 4948 KB Output is correct
12 Correct 3 ms 4948 KB Output is correct
13 Correct 4 ms 4948 KB Output is correct
14 Correct 3 ms 5028 KB Output is correct
15 Correct 3 ms 5012 KB Output is correct

Subtask #2
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 3 ms 4972 KB Output is correct
6 Correct 3 ms 4948 KB Output is correct
7 Correct 3 ms 5040 KB Output is correct
8 Correct 3 ms 4948 KB Output is correct
9 Correct 3 ms 4948 KB Output is correct
10 Correct 3 ms 4948 KB Output is correct
11 Correct 2 ms 4948 KB Output is correct
12 Correct 3 ms 4948 KB Output is correct
13 Correct 4 ms 4948 KB Output is correct
14 Correct 3 ms 5028 KB Output is correct
15 Correct 3 ms 5012 KB Output is correct
16 Correct 3 ms 4948 KB Output is correct
17 Correct 3 ms 4948 KB Output is correct
18 Correct 3 ms 4948 KB Output is correct
19 Correct 3 ms 4948 KB Output is correct
20 Correct 3 ms 4948 KB Output is correct
21 Correct 3 ms 4948 KB Output is correct
22 Correct 3 ms 4948 KB Output is correct
23 Correct 3 ms 4948 KB Output is correct
24 Correct 3 ms 4948 KB Output is correct
25 Correct 3 ms 5076 KB Output is correct
26 Correct 3 ms 5008 KB Output is correct
27 Correct 3 ms 5032 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 3 ms 4972 KB Output is correct
6 Correct 3 ms 4948 KB Output is correct
7 Correct 3 ms 5040 KB Output is correct
8 Correct 3 ms 4948 KB Output is correct
9 Correct 3 ms 4948 KB Output is correct
10 Correct 3 ms 4948 KB Output is correct
11 Correct 2 ms 4948 KB Output is correct
12 Correct 3 ms 4948 KB Output is correct
13 Correct 4 ms 4948 KB Output is correct
14 Correct 3 ms 5028 KB Output is correct
15 Correct 3 ms 5012 KB Output is correct
16 Correct 3 ms 4948 KB Output is correct
17 Correct 3 ms 4948 KB Output is correct
18 Correct 3 ms 4948 KB Output is correct
19 Correct 3 ms 4948 KB Output is correct
20 Correct 3 ms 4948 KB Output is correct
21 Correct 3 ms 4948 KB Output is correct
22 Correct 3 ms 4948 KB Output is correct
23 Correct 3 ms 4948 KB Output is correct
24 Correct 3 ms 4948 KB Output is correct
25 Correct 3 ms 5076 KB Output is correct
26 Correct 3 ms 5008 KB Output is correct
27 Correct 3 ms 5032 KB Output is correct
28 Correct 5 ms 5168 KB Output is correct
29 Correct 5 ms 5124 KB Output is correct
30 Correct 5 ms 5204 KB Output is correct
31 Correct 6 ms 5120 KB Output is correct
32 Correct 6 ms 5168 KB Output is correct
33 Correct 5 ms 5204 KB Output is correct
34 Correct 4 ms 5204 KB Output is correct
35 Correct 5 ms 5204 KB Output is correct
36 Correct 5 ms 5204 KB Output is correct
37 Correct 5 ms 5172 KB Output is correct
38 Correct 4 ms 5204 KB Output is correct
39 Correct 4 ms 5204 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 3 ms 4972 KB Output is correct
6 Correct 3 ms 4948 KB Output is correct
7 Correct 3 ms 5040 KB Output is correct
8 Correct 3 ms 4948 KB Output is correct
9 Correct 3 ms 4948 KB Output is correct
10 Correct 3 ms 4948 KB Output is correct
11 Correct 2 ms 4948 KB Output is correct
12 Correct 3 ms 4948 KB Output is correct
13 Correct 4 ms 4948 KB Output is correct
14 Correct 3 ms 5028 KB Output is correct
15 Correct 3 ms 5012 KB Output is correct
16 Correct 3 ms 4948 KB Output is correct
17 Correct 3 ms 4948 KB Output is correct
18 Correct 3 ms 4948 KB Output is correct
19 Correct 3 ms 4948 KB Output is correct
20 Correct 3 ms 4948 KB Output is correct
21 Correct 3 ms 4948 KB Output is correct
22 Correct 3 ms 4948 KB Output is correct
23 Correct 3 ms 4948 KB Output is correct
24 Correct 3 ms 4948 KB Output is correct
25 Correct 3 ms 5076 KB Output is correct
26 Correct 3 ms 5008 KB Output is correct
27 Correct 3 ms 5032 KB Output is correct
28 Correct 5 ms 5168 KB Output is correct
29 Correct 5 ms 5124 KB Output is correct
30 Correct 5 ms 5204 KB Output is correct
31 Correct 6 ms 5120 KB Output is correct
32 Correct 6 ms 5168 KB Output is correct
33 Correct 5 ms 5204 KB Output is correct
34 Correct 4 ms 5204 KB Output is correct
35 Correct 5 ms 5204 KB Output is correct
36 Correct 5 ms 5204 KB Output is correct
37 Correct 5 ms 5172 KB Output is correct
38 Correct 4 ms 5204 KB Output is correct
39 Correct 4 ms 5204 KB Output is correct
40 Correct 142 ms 12668 KB Output is correct
41 Correct 140 ms 12824 KB Output is correct
42 Correct 96 ms 12388 KB Output is correct
43 Correct 155 ms 12484 KB Output is correct
44 Correct 204 ms 12812 KB Output is correct
45 Correct 178 ms 12368 KB Output is correct
46 Correct 136 ms 12348 KB Output is correct
47 Correct 123 ms 12476 KB Output is correct
48 Correct 112 ms 12232 KB Output is correct
49 Correct 61 ms 10760 KB Output is correct
50 Correct 41 ms 11016 KB Output is correct
51 Correct 79 ms 10820 KB Output is correct

Subtask #5
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 3 ms 4972 KB Output is correct
6 Correct 3 ms 4948 KB Output is correct
7 Correct 3 ms 5040 KB Output is correct
8 Correct 3 ms 4948 KB Output is correct
9 Correct 3 ms 4948 KB Output is correct
10 Correct 3 ms 4948 KB Output is correct
11 Correct 2 ms 4948 KB Output is correct
12 Correct 3 ms 4948 KB Output is correct
13 Correct 4 ms 4948 KB Output is correct
14 Correct 3 ms 5028 KB Output is correct
15 Correct 3 ms 5012 KB Output is correct
16 Correct 3 ms 4948 KB Output is correct
17 Correct 3 ms 4948 KB Output is correct
18 Correct 3 ms 4948 KB Output is correct
19 Correct 3 ms 4948 KB Output is correct
20 Correct 3 ms 4948 KB Output is correct
21 Correct 3 ms 4948 KB Output is correct
22 Correct 3 ms 4948 KB Output is correct
23 Correct 3 ms 4948 KB Output is correct
24 Correct 3 ms 4948 KB Output is correct
25 Correct 3 ms 5076 KB Output is correct
26 Correct 3 ms 5008 KB Output is correct
27 Correct 3 ms 5032 KB Output is correct
28 Correct 5 ms 5168 KB Output is correct
29 Correct 5 ms 5124 KB Output is correct
30 Correct 5 ms 5204 KB Output is correct
31 Correct 6 ms 5120 KB Output is correct
32 Correct 6 ms 5168 KB Output is correct
33 Correct 5 ms 5204 KB Output is correct
34 Correct 4 ms 5204 KB Output is correct
35 Correct 5 ms 5204 KB Output is correct
36 Correct 5 ms 5204 KB Output is correct
37 Correct 5 ms 5172 KB Output is correct
38 Correct 4 ms 5204 KB Output is correct
39 Correct 4 ms 5204 KB Output is correct
40 Correct 142 ms 12668 KB Output is correct
41 Correct 140 ms 12824 KB Output is correct
42 Correct 96 ms 12388 KB Output is correct
43 Correct 155 ms 12484 KB Output is correct
44 Correct 204 ms 12812 KB Output is correct
45 Correct 178 ms 12368 KB Output is correct
46 Correct 136 ms 12348 KB Output is correct
47 Correct 123 ms 12476 KB Output is correct
48 Correct 112 ms 12232 KB Output is correct
49 Correct 61 ms 10760 KB Output is correct
50 Correct 41 ms 11016 KB Output is correct
51 Correct 79 ms 10820 KB Output is correct
52 Correct 764 ms 13964 KB Output is correct
53 Correct 288 ms 13224 KB Output is correct
54 Correct 803 ms 13772 KB Output is correct
55 Correct 789 ms 13528 KB Output is correct
56 Correct 617 ms 13204 KB Output is correct
57 Correct 622 ms 13152 KB Output is correct
58 Correct 635 ms 13616 KB Output is correct
59 Correct 375 ms 11304 KB Output is correct