oj.uz

Submission #418181

# Submission time Handle Problem Language Result Execution time Memory
418181 2021-06-05T07:45:31 Z 2qbingxuan Arranging Tickets (JOI17_arranging_tickets) C++14
85 / 100
 6000 ms 7856 KB 
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#ifdef local
#define safe cerr<<__PRETTY_FUNCTION__<<" line "<<__LINE__<<" safe\n"
#define pary(a...) danb(#a, a)
#define debug(a...) qqbx(#a, a)
template <typename ...T> void qqbx(const char *s, T ...a) {
    int cnt = sizeof...(T);
    ((std::cerr << "\033[1;32m(" << s << ") = (") , ... , (std::cerr << a << (--cnt ? ", " : ")\033[0m\n")));
}
template <typename T> void danb(const char *s, T L, T R) {
    std::cerr << "\033[1;32m[ " << s << " ] = [ ";
    for (int f = 0; L != R; ++L)
        std::cerr << (f++ ? ", " : "") << *L;
    std::cerr << " ]\033[0m\n";
}
#else
#define debug(...) ((void)0)
#define safe ((void)0)
#define pary(...) ((void)0)
#endif // local
#define all(v) begin(v),end(v)
#define pb emplace_back
#define get_pos(u,x) int(lower_bound(all(u),x)-begin(u))

using namespace std;
using ll = int_fast64_t;
using ld = long double;
template <typename T> using min_heap = priority_queue<T, vector<T>, greater<T>>;
template <typename T> using max_heap = priority_queue<T, vector<T>, less<T>>;
const int inf = 1e9;
const int mod = 1000000007;
const ll INF = 1e18;
const int maxn = 5002;

signed main() {
    ios_base::sync_with_stdio(0), cin.tie(0);
    int n, m;
    cin >> n >> m;
    vector<tuple<int,int,int>> seg;
    for (int i = 0; i < m; i++) {
        int l, r, c;
        cin >> l >> r >> c;
        if (l > r) swap(l, r);
        --l, --r;
        seg.pb(l, r, c);
    }

    vector<ll> pref(n);
    for (auto [l, r, c]: seg)
        pref[l] += c, pref[r] -= c;
    for (int i = 1; i < n; i++) pref[i] += pref[i-1];

    sort(all(seg));

    auto calc = [&](ll x) {
        vector<ll> need(n);
        for (int i = 0; i < n; i++)
            need[i] = max<ll>(0, (pref[i] - x + 1) / 2);
        ll cnt = 0;
        ll sum = 0;
        max_heap<pair<int,int>> pq;
        min_heap<pair<int,int>> cover;
        for (int i = 0, it = 0; i < n; i++) {
            while (it < seg.size() && get<0>(seg[it]) <= i) {
                auto [l, r, c] = seg[it];
                pq.emplace(r, c);
                it++;
            }
            while (cover.size() && cover.top().first <= i) {
                sum -= cover.top().second;
                cover.pop();
            }
            while (sum < need[i]) {
                assert (!pq.empty());
                auto [r, c] = pq.top(); pq.pop();
                assert (r > i);
                if (sum + c < need[i]) {
                    cover.emplace(r, c);
                    sum += c;
                    cnt += c;
                } else {
                    ll take = need[i] - sum;
                    pq.emplace(r, c - take);
                    cover.emplace(r, take);
                    sum += take;
                    cnt += take;
                }
            }
        }
        return x + cnt;
    };

    ll p0 = 0;
    ll p1 = 1;
    for (ll s = 1LL << 50; s > 1; s >>= 1) {
        if (calc(p0 + s - 2) > calc(p0 + s))
            p0 += s;
        if (calc(p1 + s - 2) > calc(p1 + s))
            p1 += s;
    }
    cout << min(calc(p0), calc(p1)) << '\n';
}

Compilation message

arranging_tickets.cpp: In function 'int main()':
arranging_tickets.cpp:50:15: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   50 |     for (auto [l, r, c]: seg)
      |               ^
arranging_tickets.cpp: In lambda function:
arranging_tickets.cpp:66:22: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   66 |                 auto [l, r, c] = seg[it];
      |                      ^
arranging_tickets.cpp:76:22: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   76 |                 auto [r, c] = pq.top(); pq.pop();
      |                      ^

Subtask #1
10.0 / 10.0

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

Subtask #2
35.0 / 35.0

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

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 3 ms 332 KB Output is correct
17 Correct 4 ms 332 KB Output is correct
18 Correct 3 ms 332 KB Output is correct
19 Correct 3 ms 332 KB Output is correct
20 Correct 3 ms 332 KB Output is correct
21 Correct 3 ms 332 KB Output is correct
22 Correct 3 ms 332 KB Output is correct
23 Correct 3 ms 332 KB Output is correct
24 Correct 4 ms 332 KB Output is correct
25 Correct 3 ms 332 KB Output is correct
26 Correct 3 ms 332 KB Output is correct
27 Correct 3 ms 312 KB Output is correct
28 Correct 38 ms 440 KB Output is correct
29 Correct 39 ms 504 KB Output is correct
30 Correct 37 ms 500 KB Output is correct
31 Correct 36 ms 436 KB Output is correct
32 Correct 33 ms 460 KB Output is correct
33 Correct 40 ms 628 KB Output is correct
34 Correct 38 ms 492 KB Output is correct
35 Correct 32 ms 460 KB Output is correct
36 Correct 35 ms 460 KB Output is correct
37 Correct 25 ms 460 KB Output is correct
38 Correct 16 ms 460 KB Output is correct
39 Correct 17 ms 448 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 3 ms 332 KB Output is correct
17 Correct 4 ms 332 KB Output is correct
18 Correct 3 ms 332 KB Output is correct
19 Correct 3 ms 332 KB Output is correct
20 Correct 3 ms 332 KB Output is correct
21 Correct 3 ms 332 KB Output is correct
22 Correct 3 ms 332 KB Output is correct
23 Correct 3 ms 332 KB Output is correct
24 Correct 4 ms 332 KB Output is correct
25 Correct 3 ms 332 KB Output is correct
26 Correct 3 ms 332 KB Output is correct
27 Correct 3 ms 312 KB Output is correct
28 Correct 38 ms 440 KB Output is correct
29 Correct 39 ms 504 KB Output is correct
30 Correct 37 ms 500 KB Output is correct
31 Correct 36 ms 436 KB Output is correct
32 Correct 33 ms 460 KB Output is correct
33 Correct 40 ms 628 KB Output is correct
34 Correct 38 ms 492 KB Output is correct
35 Correct 32 ms 460 KB Output is correct
36 Correct 35 ms 460 KB Output is correct
37 Correct 25 ms 460 KB Output is correct
38 Correct 16 ms 460 KB Output is correct
39 Correct 17 ms 448 KB Output is correct
40 Correct 2460 ms 7480 KB Output is correct
41 Correct 2564 ms 7856 KB Output is correct
42 Correct 2359 ms 7308 KB Output is correct
43 Correct 2284 ms 7136 KB Output is correct
44 Correct 2346 ms 7220 KB Output is correct
45 Correct 2116 ms 7136 KB Output is correct
46 Correct 2383 ms 7224 KB Output is correct
47 Correct 2526 ms 7296 KB Output is correct
48 Correct 2213 ms 7044 KB Output is correct
49 Correct 1096 ms 5272 KB Output is correct
50 Correct 656 ms 5156 KB Output is correct
51 Correct 953 ms 5208 KB Output is correct

Subtask #5
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 3 ms 332 KB Output is correct
17 Correct 4 ms 332 KB Output is correct
18 Correct 3 ms 332 KB Output is correct
19 Correct 3 ms 332 KB Output is correct
20 Correct 3 ms 332 KB Output is correct
21 Correct 3 ms 332 KB Output is correct
22 Correct 3 ms 332 KB Output is correct
23 Correct 3 ms 332 KB Output is correct
24 Correct 4 ms 332 KB Output is correct
25 Correct 3 ms 332 KB Output is correct
26 Correct 3 ms 332 KB Output is correct
27 Correct 3 ms 312 KB Output is correct
28 Correct 38 ms 440 KB Output is correct
29 Correct 39 ms 504 KB Output is correct
30 Correct 37 ms 500 KB Output is correct
31 Correct 36 ms 436 KB Output is correct
32 Correct 33 ms 460 KB Output is correct
33 Correct 40 ms 628 KB Output is correct
34 Correct 38 ms 492 KB Output is correct
35 Correct 32 ms 460 KB Output is correct
36 Correct 35 ms 460 KB Output is correct
37 Correct 25 ms 460 KB Output is correct
38 Correct 16 ms 460 KB Output is correct
39 Correct 17 ms 448 KB Output is correct
40 Correct 2460 ms 7480 KB Output is correct
41 Correct 2564 ms 7856 KB Output is correct
42 Correct 2359 ms 7308 KB Output is correct
43 Correct 2284 ms 7136 KB Output is correct
44 Correct 2346 ms 7220 KB Output is correct
45 Correct 2116 ms 7136 KB Output is correct
46 Correct 2383 ms 7224 KB Output is correct
47 Correct 2526 ms 7296 KB Output is correct
48 Correct 2213 ms 7044 KB Output is correct
49 Correct 1096 ms 5272 KB Output is correct
50 Correct 656 ms 5156 KB Output is correct
51 Correct 953 ms 5208 KB Output is correct
52 Execution timed out 6007 ms 7812 KB Time limit exceeded
53 Halted 0 ms 0 KB -