oj.uz

Submission #198578

# Submission time Handle Problem Language Result Execution time Memory
198578 2020-01-26T17:06:43 Z combi1k1 Arranging Tickets (JOI17_arranging_tickets) C++14
100 / 100
 1241 ms 16896 KB 
#include<bits/stdc++.h>

using namespace std;

#define ll  long long
#define ld  double

#define sz(x)   (int)x.size()
#define all(x)  x.begin(),x.end()

#define pb  emplace_back
#define X   first
#define Y   second

const int   N   = 2e5 + 5;

typedef pair<int,int>   ii;

vector<ii>  g[N];
ll  s[N], z[N];
ll  h[N], t[N];

int main()  {
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);

    int n;  cin >> n;
    int q;  cin >> q;

    for(int i = 0 ; i < q ; ++i)    {
        int l;  cin >> l;
        int r;  cin >> r;
        int x;  cin >> x;

        if (l > r)  swap(l,r);

        g[l].pb(r,x);
        s[l] += x;
        s[r] -= x;
    }
    ll  mx = -1;
    int ps = 0;

    for(int i = 1 ; i <= n ; ++i)   {
        s[i] += s[i - 1];
        if (mx < s[i])
            mx = s[i],
            ps = i;
    }
    for(int i = 1 ; i <= ps ; ++i)  z[i] = max(z[i - 1],s[i]);
    for(int i = n ; i >= ps ; --i)  z[i] = max(z[i + 1],s[i]);

    auto check = [&](ll  x) {
        ll  sum = 0;

        for(int i = 0 ; i < n ; ++i)
            h[i] = min(h[i],x),
            t[i] = 0;

        h[ps] = 0;
        priority_queue<ii>  pq;

        for(int i = 1 ; i <= ps ; ++i)  {
            for(ii  e : g[i])
                if (e.X > ps)   pq.push(e);

            sum += h[i - 1] - h[i];

            while (sum) {
                if (pq.empty()) return  0;

                int p = pq.top().X;
                int c = pq.top().Y;

                pq.pop();

                if (c >= sum)   {
                    c -= sum;
                    t[p] -= sum;
                    pq.push(ii(p,c));
                    sum = 0;
                }
                else    {
                    sum  -= c;
                    t[p] -= c;
                }
            }
        }
        for(int i = 1 ; i < n ; ++i)   {
            t[i] += t[i - 1];
            if (h[i] + t[i] < 0)
                return 0;
        }
        return  1;
    };
    auto chk = [&](ll  M)   {
        for(int i = 0 ; i < 2 ; ++i)    {
            ll  x = z[ps] - M + i;

            for(int j = 0 ; j < n ; ++j)
                h[j] = (x + M - z[j]) / 2;

            if (h[0] >= x && check(x))
                return  1;
        }
        return  0;
    };

    ll  L = 0;
    ll  R = mx;

    while(L < R)    {
        ll  M = (L + R) / 2;

        if (chk(M))
            R = M;
        else
            L = M + 1;
    }
    cout << L << endl;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
35.0 / 35.0

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

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 4984 KB Output is correct
2 Correct 8 ms 5112 KB Output is correct
3 Correct 8 ms 5112 KB Output is correct
4 Correct 8 ms 5112 KB Output is correct
5 Correct 8 ms 5112 KB Output is correct
6 Correct 8 ms 4984 KB Output is correct
7 Correct 8 ms 5112 KB Output is correct
8 Correct 8 ms 4984 KB Output is correct
9 Correct 9 ms 5112 KB Output is correct
10 Correct 9 ms 4984 KB Output is correct
11 Correct 8 ms 5112 KB Output is correct
12 Correct 8 ms 4984 KB Output is correct
13 Correct 8 ms 5112 KB Output is correct
14 Correct 8 ms 5112 KB Output is correct
15 Correct 8 ms 4984 KB Output is correct
16 Correct 8 ms 5112 KB Output is correct
17 Correct 9 ms 5112 KB Output is correct
18 Correct 9 ms 5112 KB Output is correct
19 Correct 9 ms 5112 KB Output is correct
20 Correct 9 ms 5112 KB Output is correct
21 Correct 9 ms 5112 KB Output is correct
22 Correct 9 ms 5112 KB Output is correct
23 Correct 8 ms 5112 KB Output is correct
24 Correct 9 ms 5112 KB Output is correct
25 Correct 9 ms 5020 KB Output is correct
26 Correct 8 ms 5112 KB Output is correct
27 Correct 8 ms 5112 KB Output is correct
28 Correct 12 ms 5244 KB Output is correct
29 Correct 13 ms 5240 KB Output is correct
30 Correct 12 ms 5240 KB Output is correct
31 Correct 12 ms 5240 KB Output is correct
32 Correct 13 ms 5240 KB Output is correct
33 Correct 13 ms 5240 KB Output is correct
34 Correct 10 ms 5244 KB Output is correct
35 Correct 13 ms 5240 KB Output is correct
36 Correct 12 ms 5240 KB Output is correct
37 Correct 10 ms 5240 KB Output is correct
38 Correct 10 ms 5240 KB Output is correct
39 Correct 10 ms 5240 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 4984 KB Output is correct
2 Correct 8 ms 5112 KB Output is correct
3 Correct 8 ms 5112 KB Output is correct
4 Correct 8 ms 5112 KB Output is correct
5 Correct 8 ms 5112 KB Output is correct
6 Correct 8 ms 4984 KB Output is correct
7 Correct 8 ms 5112 KB Output is correct
8 Correct 8 ms 4984 KB Output is correct
9 Correct 9 ms 5112 KB Output is correct
10 Correct 9 ms 4984 KB Output is correct
11 Correct 8 ms 5112 KB Output is correct
12 Correct 8 ms 4984 KB Output is correct
13 Correct 8 ms 5112 KB Output is correct
14 Correct 8 ms 5112 KB Output is correct
15 Correct 8 ms 4984 KB Output is correct
16 Correct 8 ms 5112 KB Output is correct
17 Correct 9 ms 5112 KB Output is correct
18 Correct 9 ms 5112 KB Output is correct
19 Correct 9 ms 5112 KB Output is correct
20 Correct 9 ms 5112 KB Output is correct
21 Correct 9 ms 5112 KB Output is correct
22 Correct 9 ms 5112 KB Output is correct
23 Correct 8 ms 5112 KB Output is correct
24 Correct 9 ms 5112 KB Output is correct
25 Correct 9 ms 5020 KB Output is correct
26 Correct 8 ms 5112 KB Output is correct
27 Correct 8 ms 5112 KB Output is correct
28 Correct 12 ms 5244 KB Output is correct
29 Correct 13 ms 5240 KB Output is correct
30 Correct 12 ms 5240 KB Output is correct
31 Correct 12 ms 5240 KB Output is correct
32 Correct 13 ms 5240 KB Output is correct
33 Correct 13 ms 5240 KB Output is correct
34 Correct 10 ms 5244 KB Output is correct
35 Correct 13 ms 5240 KB Output is correct
36 Correct 12 ms 5240 KB Output is correct
37 Correct 10 ms 5240 KB Output is correct
38 Correct 10 ms 5240 KB Output is correct
39 Correct 10 ms 5240 KB Output is correct
40 Correct 329 ms 15964 KB Output is correct
41 Correct 363 ms 16068 KB Output is correct
42 Correct 324 ms 15700 KB Output is correct
43 Correct 369 ms 15760 KB Output is correct
44 Correct 235 ms 16000 KB Output is correct
45 Correct 350 ms 15604 KB Output is correct
46 Correct 326 ms 15496 KB Output is correct
47 Correct 89 ms 15352 KB Output is correct
48 Correct 92 ms 15128 KB Output is correct
49 Correct 78 ms 12784 KB Output is correct
50 Correct 63 ms 12664 KB Output is correct
51 Correct 78 ms 12408 KB Output is correct

Subtask #5
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 4984 KB Output is correct
2 Correct 8 ms 5112 KB Output is correct
3 Correct 8 ms 5112 KB Output is correct
4 Correct 8 ms 5112 KB Output is correct
5 Correct 8 ms 5112 KB Output is correct
6 Correct 8 ms 4984 KB Output is correct
7 Correct 8 ms 5112 KB Output is correct
8 Correct 8 ms 4984 KB Output is correct
9 Correct 9 ms 5112 KB Output is correct
10 Correct 9 ms 4984 KB Output is correct
11 Correct 8 ms 5112 KB Output is correct
12 Correct 8 ms 4984 KB Output is correct
13 Correct 8 ms 5112 KB Output is correct
14 Correct 8 ms 5112 KB Output is correct
15 Correct 8 ms 4984 KB Output is correct
16 Correct 8 ms 5112 KB Output is correct
17 Correct 9 ms 5112 KB Output is correct
18 Correct 9 ms 5112 KB Output is correct
19 Correct 9 ms 5112 KB Output is correct
20 Correct 9 ms 5112 KB Output is correct
21 Correct 9 ms 5112 KB Output is correct
22 Correct 9 ms 5112 KB Output is correct
23 Correct 8 ms 5112 KB Output is correct
24 Correct 9 ms 5112 KB Output is correct
25 Correct 9 ms 5020 KB Output is correct
26 Correct 8 ms 5112 KB Output is correct
27 Correct 8 ms 5112 KB Output is correct
28 Correct 12 ms 5244 KB Output is correct
29 Correct 13 ms 5240 KB Output is correct
30 Correct 12 ms 5240 KB Output is correct
31 Correct 12 ms 5240 KB Output is correct
32 Correct 13 ms 5240 KB Output is correct
33 Correct 13 ms 5240 KB Output is correct
34 Correct 10 ms 5244 KB Output is correct
35 Correct 13 ms 5240 KB Output is correct
36 Correct 12 ms 5240 KB Output is correct
37 Correct 10 ms 5240 KB Output is correct
38 Correct 10 ms 5240 KB Output is correct
39 Correct 10 ms 5240 KB Output is correct
40 Correct 329 ms 15964 KB Output is correct
41 Correct 363 ms 16068 KB Output is correct
42 Correct 324 ms 15700 KB Output is correct
43 Correct 369 ms 15760 KB Output is correct
44 Correct 235 ms 16000 KB Output is correct
45 Correct 350 ms 15604 KB Output is correct
46 Correct 326 ms 15496 KB Output is correct
47 Correct 89 ms 15352 KB Output is correct
48 Correct 92 ms 15128 KB Output is correct
49 Correct 78 ms 12784 KB Output is correct
50 Correct 63 ms 12664 KB Output is correct
51 Correct 78 ms 12408 KB Output is correct
52 Correct 714 ms 16856 KB Output is correct
53 Correct 846 ms 16624 KB Output is correct
54 Correct 1213 ms 16896 KB Output is correct
55 Correct 596 ms 16636 KB Output is correct
56 Correct 965 ms 16432 KB Output is correct
57 Correct 1241 ms 16616 KB Output is correct
58 Correct 792 ms 16468 KB Output is correct
59 Correct 99 ms 13172 KB Output is correct