oj.uz

Submission #255145

# Submission time Handle Problem Language Result Execution time Memory
255145 2020-07-31T11:26:15 Z fedoseevtimofey Arranging Tickets (JOI17_arranging_tickets) C++14
65 / 100
 6000 ms 17996 KB 
#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <algorithm>
#include <random>
#include <iomanip>
#include <functional>
#include <cassert>

using namespace std;

typedef long long ll;

const int Inf = 1e9;

int main() {
  ios_base::sync_with_stdio(false); cin.tie(0);
#ifdef LOCAL
  freopen("input.txt", "r", stdin);
#endif
  int n, m;
  cin >> n >> m;
  vector <int> a(m), b(m), c(m);
  for (int i = 0; i < m; ++i) {
    cin >> a[i] >> b[i] >> c[i];
    --a[i], --b[i];
    if (a[i] > b[i]) swap(a[i], b[i]);
  }
  vector <int> cnt(n);
  for (int i = 0; i < m; ++i) {
    ++cnt[a[i]];
    --cnt[b[i]];
  }
  vector <vector <int>> who(n);
  for (int i = 0; i < m; ++i) {
    who[a[i]].push_back(b[i]);
  }
  for (int i = 1; i < n; ++i) cnt[i] += cnt[i - 1];
  vector <int> need(2 * m + 1, Inf);
  for (int delta = -m; delta <= m; ++delta) {
    vector <int> cur = cnt;
    for (int i = 0; i < n; ++i) {
      cur[i] += delta;
      cur[i] = max(cur[i], 0);
      cur[i] = (cur[i] + 1) / 2;
    }
    int cnt_open = 0;
    vector <int> close(n);
    multiset <int> have;
    int cnt_need = 0;
    for (int i = 0; i < n; ++i) {
      cnt_open -= close[i]; 
      cur[i] -= cnt_open; 
      for (auto r : who[i]) have.insert(r);
      while (cur[i] > 0) {
        if (have.empty()) {
          break;
        }
        ++cnt_need;
        ++cnt_open;
        --cur[i];
        ++close[*have.rbegin()];
        have.erase(--have.end());
      }
      if (cur[i] > 0) {
        cnt_need = Inf;
        break;
      }
    }
    need[delta + m] = cnt_need;
  }
  int low = 0, high = m;
  while (high - low > 1) {
    int mid = (low + high) >> 1;
    bool good = false;
    for (int cnt_go = 0; cnt_go <= m; ++cnt_go) {
      int all_delta = cnt_go - mid;
      if (need[all_delta + m] <= cnt_go) {
        good = true; 
      }
    }
    if (good) high = mid;
    else low = mid;
  }
  cout << high << '\n';
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 0 ms 384 KB Output is correct
13 Correct 0 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 0 ms 384 KB Output is correct

Subtask #2
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 0 ms 384 KB Output is correct
13 Correct 0 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 12 ms 384 KB Output is correct
17 Correct 12 ms 384 KB Output is correct
18 Correct 12 ms 384 KB Output is correct
19 Correct 12 ms 384 KB Output is correct
20 Correct 11 ms 384 KB Output is correct
21 Correct 14 ms 384 KB Output is correct
22 Correct 12 ms 384 KB Output is correct
23 Correct 11 ms 384 KB Output is correct
24 Correct 12 ms 384 KB Output is correct
25 Correct 11 ms 384 KB Output is correct
26 Correct 10 ms 384 KB Output is correct
27 Correct 11 ms 384 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 0 ms 384 KB Output is correct
13 Correct 0 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 12 ms 384 KB Output is correct
17 Correct 12 ms 384 KB Output is correct
18 Correct 12 ms 384 KB Output is correct
19 Correct 12 ms 384 KB Output is correct
20 Correct 11 ms 384 KB Output is correct
21 Correct 14 ms 384 KB Output is correct
22 Correct 12 ms 384 KB Output is correct
23 Correct 11 ms 384 KB Output is correct
24 Correct 12 ms 384 KB Output is correct
25 Correct 11 ms 384 KB Output is correct
26 Correct 10 ms 384 KB Output is correct
27 Correct 11 ms 384 KB Output is correct
28 Correct 1664 ms 772 KB Output is correct
29 Correct 1657 ms 888 KB Output is correct
30 Correct 1605 ms 768 KB Output is correct
31 Correct 1592 ms 768 KB Output is correct
32 Correct 1560 ms 640 KB Output is correct
33 Correct 1540 ms 760 KB Output is correct
34 Correct 1423 ms 760 KB Output is correct
35 Correct 1576 ms 760 KB Output is correct
36 Correct 1552 ms 768 KB Output is correct
37 Correct 1032 ms 888 KB Output is correct
38 Correct 1045 ms 888 KB Output is correct
39 Correct 1002 ms 888 KB Output is correct

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 0 ms 384 KB Output is correct
13 Correct 0 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 12 ms 384 KB Output is correct
17 Correct 12 ms 384 KB Output is correct
18 Correct 12 ms 384 KB Output is correct
19 Correct 12 ms 384 KB Output is correct
20 Correct 11 ms 384 KB Output is correct
21 Correct 14 ms 384 KB Output is correct
22 Correct 12 ms 384 KB Output is correct
23 Correct 11 ms 384 KB Output is correct
24 Correct 12 ms 384 KB Output is correct
25 Correct 11 ms 384 KB Output is correct
26 Correct 10 ms 384 KB Output is correct
27 Correct 11 ms 384 KB Output is correct
28 Correct 1664 ms 772 KB Output is correct
29 Correct 1657 ms 888 KB Output is correct
30 Correct 1605 ms 768 KB Output is correct
31 Correct 1592 ms 768 KB Output is correct
32 Correct 1560 ms 640 KB Output is correct
33 Correct 1540 ms 760 KB Output is correct
34 Correct 1423 ms 760 KB Output is correct
35 Correct 1576 ms 760 KB Output is correct
36 Correct 1552 ms 768 KB Output is correct
37 Correct 1032 ms 888 KB Output is correct
38 Correct 1045 ms 888 KB Output is correct
39 Correct 1002 ms 888 KB Output is correct
40 Execution timed out 6035 ms 17996 KB Time limit exceeded
41 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 0 ms 384 KB Output is correct
13 Correct 0 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 12 ms 384 KB Output is correct
17 Correct 12 ms 384 KB Output is correct
18 Correct 12 ms 384 KB Output is correct
19 Correct 12 ms 384 KB Output is correct
20 Correct 11 ms 384 KB Output is correct
21 Correct 14 ms 384 KB Output is correct
22 Correct 12 ms 384 KB Output is correct
23 Correct 11 ms 384 KB Output is correct
24 Correct 12 ms 384 KB Output is correct
25 Correct 11 ms 384 KB Output is correct
26 Correct 10 ms 384 KB Output is correct
27 Correct 11 ms 384 KB Output is correct
28 Correct 1664 ms 772 KB Output is correct
29 Correct 1657 ms 888 KB Output is correct
30 Correct 1605 ms 768 KB Output is correct
31 Correct 1592 ms 768 KB Output is correct
32 Correct 1560 ms 640 KB Output is correct
33 Correct 1540 ms 760 KB Output is correct
34 Correct 1423 ms 760 KB Output is correct
35 Correct 1576 ms 760 KB Output is correct
36 Correct 1552 ms 768 KB Output is correct
37 Correct 1032 ms 888 KB Output is correct
38 Correct 1045 ms 888 KB Output is correct
39 Correct 1002 ms 888 KB Output is correct
40 Execution timed out 6035 ms 17996 KB Time limit exceeded
41 Halted 0 ms 0 KB -