Submission #24098

# Submission time Handle Problem Language Result Execution time Memory
24098 2017-05-31T00:34:33 Z jiaqiyang Arranging Tickets (JOI17_arranging_tickets) C++14
100 / 100
1376 ms 8152 KB
#include <cstdio>
#include <algorithm>

const int N = 200000 + 10;

typedef long long i64;

int n, m;

struct Tuple {
  int x, y, z;
  Tuple() {}
  Tuple(int _x, int _y, int _z): x(_x), y(_y), z(_z) {}
  inline bool operator< (const Tuple &rhs) const {
    return x < rhs.x;
  }
} tuple[N];

i64 a[N];

bool solve(i64 cnt, i64 threshold) {
  cnt = std::min(cnt, threshold);
  static i64 b[N];
  std::fill(b + 1, b + n, 0);
  static std::pair<int, int> heap[N];
  i64 temp = cnt;
  int top = 0;
  for (int i = 1, j = 1; i < n; ++i) {
    b[i] += b[i - 1];
    for (; j <= m && tuple[j].x <= i; ++j) {
      heap[top++] = std::make_pair(tuple[j].y, tuple[j].z);
      std::push_heap(heap, heap + top);
    }
    i64 val = a[i] + cnt - 2 * b[i] - threshold;
    if (val <= 0) continue;
    i64 cur = (val + 1) / 2;
    while (top && cur && temp) {
      std::pop_heap(heap, heap + top);
      std::pair<int, int> &info = heap[--top];
      if (i >= info.first) continue;
      int det = std::min<i64>(info.second, std::min(cur, temp));
      info.second -= det;
      b[i] += det;
      b[info.first] -= det;
      cur -= det;
      temp -= det;
      if (info.second) std::push_heap(heap, heap + ++top);
    }
    if (cur) return false;
  }
  return true;
}

int main() {
  scanf("%d%d", &n, &m);
  for (int i = 1; i <= m; ++i) {
    int x, y, z;
    scanf("%d%d%d", &x, &y, &z);
    if (x > y) std::swap(x, y);
    tuple[i] = Tuple(x, y, z);
    a[x] += z;
    a[y] -= z;
  }
  std::sort(tuple + 1, tuple + m + 1);
  for (int i = 1; i <= n; ++i) a[i] += a[i - 1];
  i64 l = 1, t = *std::max_element(a + 1, a + n), r = t;
  while (l < r) {
    i64 mid = (l + r) >> 1;
    if (solve(t - mid, mid) || solve(t - (mid - 1), mid)) r = mid; else l = mid + 1;
  }
  printf("%lld\n", l);
  return 0;
}

Compilation message

arranging_tickets.cpp: In function 'int main()':
arranging_tickets.cpp:55:24: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d", &n, &m);
                        ^
arranging_tickets.cpp:58:32: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d%d", &x, &y, &z);
                                ^
# Verdict Execution time Memory Grader output
1 Correct 0 ms 8152 KB Output is correct
2 Correct 0 ms 8152 KB Output is correct
3 Correct 0 ms 8152 KB Output is correct
4 Correct 0 ms 8152 KB Output is correct
5 Correct 0 ms 8152 KB Output is correct
6 Correct 0 ms 8152 KB Output is correct
7 Correct 0 ms 8152 KB Output is correct
8 Correct 0 ms 8152 KB Output is correct
9 Correct 0 ms 8152 KB Output is correct
10 Correct 0 ms 8152 KB Output is correct
11 Correct 0 ms 8152 KB Output is correct
12 Correct 0 ms 8152 KB Output is correct
13 Correct 0 ms 8152 KB Output is correct
14 Correct 0 ms 8152 KB Output is correct
15 Correct 0 ms 8152 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 8152 KB Output is correct
2 Correct 0 ms 8152 KB Output is correct
3 Correct 0 ms 8152 KB Output is correct
4 Correct 0 ms 8152 KB Output is correct
5 Correct 0 ms 8152 KB Output is correct
6 Correct 0 ms 8152 KB Output is correct
7 Correct 0 ms 8152 KB Output is correct
8 Correct 0 ms 8152 KB Output is correct
9 Correct 0 ms 8152 KB Output is correct
10 Correct 0 ms 8152 KB Output is correct
11 Correct 0 ms 8152 KB Output is correct
12 Correct 0 ms 8152 KB Output is correct
13 Correct 0 ms 8152 KB Output is correct
14 Correct 0 ms 8152 KB Output is correct
15 Correct 0 ms 8152 KB Output is correct
16 Correct 0 ms 8152 KB Output is correct
17 Correct 0 ms 8152 KB Output is correct
18 Correct 0 ms 8152 KB Output is correct
19 Correct 0 ms 8152 KB Output is correct
20 Correct 0 ms 8152 KB Output is correct
21 Correct 0 ms 8152 KB Output is correct
22 Correct 0 ms 8152 KB Output is correct
23 Correct 0 ms 8152 KB Output is correct
24 Correct 0 ms 8152 KB Output is correct
25 Correct 0 ms 8152 KB Output is correct
26 Correct 0 ms 8152 KB Output is correct
27 Correct 0 ms 8152 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 8152 KB Output is correct
2 Correct 0 ms 8152 KB Output is correct
3 Correct 0 ms 8152 KB Output is correct
4 Correct 0 ms 8152 KB Output is correct
5 Correct 0 ms 8152 KB Output is correct
6 Correct 0 ms 8152 KB Output is correct
7 Correct 0 ms 8152 KB Output is correct
8 Correct 0 ms 8152 KB Output is correct
9 Correct 0 ms 8152 KB Output is correct
10 Correct 0 ms 8152 KB Output is correct
11 Correct 0 ms 8152 KB Output is correct
12 Correct 0 ms 8152 KB Output is correct
13 Correct 0 ms 8152 KB Output is correct
14 Correct 0 ms 8152 KB Output is correct
15 Correct 0 ms 8152 KB Output is correct
16 Correct 0 ms 8152 KB Output is correct
17 Correct 0 ms 8152 KB Output is correct
18 Correct 0 ms 8152 KB Output is correct
19 Correct 0 ms 8152 KB Output is correct
20 Correct 0 ms 8152 KB Output is correct
21 Correct 0 ms 8152 KB Output is correct
22 Correct 0 ms 8152 KB Output is correct
23 Correct 0 ms 8152 KB Output is correct
24 Correct 0 ms 8152 KB Output is correct
25 Correct 0 ms 8152 KB Output is correct
26 Correct 0 ms 8152 KB Output is correct
27 Correct 0 ms 8152 KB Output is correct
28 Correct 3 ms 8152 KB Output is correct
29 Correct 3 ms 8152 KB Output is correct
30 Correct 3 ms 8152 KB Output is correct
31 Correct 3 ms 8152 KB Output is correct
32 Correct 6 ms 8152 KB Output is correct
33 Correct 3 ms 8152 KB Output is correct
34 Correct 3 ms 8152 KB Output is correct
35 Correct 3 ms 8152 KB Output is correct
36 Correct 3 ms 8152 KB Output is correct
37 Correct 3 ms 8152 KB Output is correct
38 Correct 3 ms 8152 KB Output is correct
39 Correct 0 ms 8152 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 8152 KB Output is correct
2 Correct 0 ms 8152 KB Output is correct
3 Correct 0 ms 8152 KB Output is correct
4 Correct 0 ms 8152 KB Output is correct
5 Correct 0 ms 8152 KB Output is correct
6 Correct 0 ms 8152 KB Output is correct
7 Correct 0 ms 8152 KB Output is correct
8 Correct 0 ms 8152 KB Output is correct
9 Correct 0 ms 8152 KB Output is correct
10 Correct 0 ms 8152 KB Output is correct
11 Correct 0 ms 8152 KB Output is correct
12 Correct 0 ms 8152 KB Output is correct
13 Correct 0 ms 8152 KB Output is correct
14 Correct 0 ms 8152 KB Output is correct
15 Correct 0 ms 8152 KB Output is correct
16 Correct 0 ms 8152 KB Output is correct
17 Correct 0 ms 8152 KB Output is correct
18 Correct 0 ms 8152 KB Output is correct
19 Correct 0 ms 8152 KB Output is correct
20 Correct 0 ms 8152 KB Output is correct
21 Correct 0 ms 8152 KB Output is correct
22 Correct 0 ms 8152 KB Output is correct
23 Correct 0 ms 8152 KB Output is correct
24 Correct 0 ms 8152 KB Output is correct
25 Correct 0 ms 8152 KB Output is correct
26 Correct 0 ms 8152 KB Output is correct
27 Correct 0 ms 8152 KB Output is correct
28 Correct 3 ms 8152 KB Output is correct
29 Correct 3 ms 8152 KB Output is correct
30 Correct 3 ms 8152 KB Output is correct
31 Correct 3 ms 8152 KB Output is correct
32 Correct 6 ms 8152 KB Output is correct
33 Correct 3 ms 8152 KB Output is correct
34 Correct 3 ms 8152 KB Output is correct
35 Correct 3 ms 8152 KB Output is correct
36 Correct 3 ms 8152 KB Output is correct
37 Correct 3 ms 8152 KB Output is correct
38 Correct 3 ms 8152 KB Output is correct
39 Correct 0 ms 8152 KB Output is correct
40 Correct 226 ms 8152 KB Output is correct
41 Correct 219 ms 8152 KB Output is correct
42 Correct 303 ms 8152 KB Output is correct
43 Correct 249 ms 8152 KB Output is correct
44 Correct 259 ms 8152 KB Output is correct
45 Correct 273 ms 8152 KB Output is correct
46 Correct 293 ms 8152 KB Output is correct
47 Correct 329 ms 8152 KB Output is correct
48 Correct 283 ms 8152 KB Output is correct
49 Correct 246 ms 8152 KB Output is correct
50 Correct 86 ms 8152 KB Output is correct
51 Correct 186 ms 8152 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 8152 KB Output is correct
2 Correct 0 ms 8152 KB Output is correct
3 Correct 0 ms 8152 KB Output is correct
4 Correct 0 ms 8152 KB Output is correct
5 Correct 0 ms 8152 KB Output is correct
6 Correct 0 ms 8152 KB Output is correct
7 Correct 0 ms 8152 KB Output is correct
8 Correct 0 ms 8152 KB Output is correct
9 Correct 0 ms 8152 KB Output is correct
10 Correct 0 ms 8152 KB Output is correct
11 Correct 0 ms 8152 KB Output is correct
12 Correct 0 ms 8152 KB Output is correct
13 Correct 0 ms 8152 KB Output is correct
14 Correct 0 ms 8152 KB Output is correct
15 Correct 0 ms 8152 KB Output is correct
16 Correct 0 ms 8152 KB Output is correct
17 Correct 0 ms 8152 KB Output is correct
18 Correct 0 ms 8152 KB Output is correct
19 Correct 0 ms 8152 KB Output is correct
20 Correct 0 ms 8152 KB Output is correct
21 Correct 0 ms 8152 KB Output is correct
22 Correct 0 ms 8152 KB Output is correct
23 Correct 0 ms 8152 KB Output is correct
24 Correct 0 ms 8152 KB Output is correct
25 Correct 0 ms 8152 KB Output is correct
26 Correct 0 ms 8152 KB Output is correct
27 Correct 0 ms 8152 KB Output is correct
28 Correct 3 ms 8152 KB Output is correct
29 Correct 3 ms 8152 KB Output is correct
30 Correct 3 ms 8152 KB Output is correct
31 Correct 3 ms 8152 KB Output is correct
32 Correct 6 ms 8152 KB Output is correct
33 Correct 3 ms 8152 KB Output is correct
34 Correct 3 ms 8152 KB Output is correct
35 Correct 3 ms 8152 KB Output is correct
36 Correct 3 ms 8152 KB Output is correct
37 Correct 3 ms 8152 KB Output is correct
38 Correct 3 ms 8152 KB Output is correct
39 Correct 0 ms 8152 KB Output is correct
40 Correct 226 ms 8152 KB Output is correct
41 Correct 219 ms 8152 KB Output is correct
42 Correct 303 ms 8152 KB Output is correct
43 Correct 249 ms 8152 KB Output is correct
44 Correct 259 ms 8152 KB Output is correct
45 Correct 273 ms 8152 KB Output is correct
46 Correct 293 ms 8152 KB Output is correct
47 Correct 329 ms 8152 KB Output is correct
48 Correct 283 ms 8152 KB Output is correct
49 Correct 246 ms 8152 KB Output is correct
50 Correct 86 ms 8152 KB Output is correct
51 Correct 186 ms 8152 KB Output is correct
52 Correct 1186 ms 8152 KB Output is correct
53 Correct 1376 ms 8152 KB Output is correct
54 Correct 999 ms 8152 KB Output is correct
55 Correct 1086 ms 8152 KB Output is correct
56 Correct 876 ms 8152 KB Output is correct
57 Correct 979 ms 8152 KB Output is correct
58 Correct 913 ms 8152 KB Output is correct
59 Correct 676 ms 8152 KB Output is correct