oj.uz

Submission #379302

# Submission time Handle Problem Language Result Execution time Memory
379302 2021-03-17T23:38:56 Z jainbot27 Arranging Tickets (JOI17_arranging_tickets) C++17
100 / 100
 2264 ms 15208 KB 
#include <bits/stdc++.h>
using namespace std;

#define int ll
#define f first
#define s second
#define pb push_back
#define ar array
#define all(x) x.begin(), x.end()
#define siz(x) (int)x.size()

#define FOR(x, y, z) for(int x = (y); x < (z); x++)
#define ROF(x, z, y) for(int x = (y-1); x >= (z); x--)
#define F0R(x, z) FOR(x, 0, z)
#define R0F(x, z) ROF(x, 0, z)
#define trav(x, y) for(auto&x:y)

using ll = long long;
using vi = vector<int>;
using vl = vector<long long>;
using pii = pair<int, int>;
using vpii = vector<pair<int, int>>;

template<class T> inline bool ckmin(T&a, T b) {return b < a ? a = b, 1 : 0;}
template<class T> inline bool ckmax(T&a, T b) {return b > a ? a = b, 1 : 0;}
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

const char nl = '\n';
const int mxN = 2e5 + 10;
const int MOD = 1e9 + 7;
const long long infLL = 1e18;

int n, m, mx; ll p[mxN], b[mxN];
vpii v[mxN];
int l, r;

bool chk(int t, ll m, ll n){
    ll x  = 0;
    //cout << t << ' ' << m << ' ' << n << nl;
    FOR(i, 1, ::n+1) b[i] = 0;
    priority_queue<pii> pq;
    FOR(i, 1, t+1){
        ll need = (n+p[i]-m+1)/2-x;
        if(i==t) need = n-x;
        trav(x, v[i]){
            if(x.f >= t) pq.push(x);
        }
        if(need>0) x += need;
        while(need>0){
            if(pq.empty()) return 0;
            auto T = pq.top(); pq.pop();
            if(T.s>need) {
                b[T.f] += need;
                T.s -= need, pq.push(T);
                break;
            }
            else{
                b[T.f] += T.s;
                need -= T.s;
            }
        }
    }
    FOR(i, t+1, ::n+1){
        trav(x, v[i]){
            b[i] += x.s; b[x.f] -= x.s;
        }
    }
    while(!pq.empty()){
        b[t] += pq.top().s; b[pq.top().f] -= pq.top().s;
        pq.pop();
    }
    FOR(i, t, ::n+1){
        b[i] += b[i-1];
        //cout << b[i] << ' ';
        if(b[i]>m) return 0;
    }
    //cout << nl;
    return 1;
}

int32_t main(){
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin >> n >> m;
    FOR(i, 1, m+1){
        int a, b, c; cin >> a >> b >> c;
        if(a>b) swap(a, b);
        p[a]+=c, p[b]-=c;
        v[a].pb({b, c});
    }
    FOR(i, 1, n+1) {
        p[i] += p[i-1];
        //cout << p[i] << ' ';
    }
    //cout << nl;
    mx = *max_element(p, p+n+1);
    FOR(i, 1, n+1){
        if(mx==p[i]){
            l = i;
            break;
        }
    }
    ROF(i, 1, n+1){
        if(mx==p[i]){
            r = i;
            break;
        }
    }
    ll L = 0, R = mx, ans = -1;
    while(L<=R){
        ll m = (L+R)/2;
        //cout << L << ' ' << R << nl;
        if(chk(l, m, mx-m)||chk(l, m, mx-m+1)||chk(r, m, mx-m)||chk(r, m, mx-m+1)) R = m-1, ans = m;
        else L = m+1;
    }
    cout << ans << nl;
    return 0;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
35.0 / 35.0

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

Subtask #3
20.0 / 20.0

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

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5100 KB Output is correct
2 Correct 4 ms 5100 KB Output is correct
3 Correct 4 ms 5100 KB Output is correct
4 Correct 4 ms 5100 KB Output is correct
5 Correct 4 ms 5100 KB Output is correct
6 Correct 3 ms 5100 KB Output is correct
7 Correct 4 ms 5100 KB Output is correct
8 Correct 4 ms 5100 KB Output is correct
9 Correct 4 ms 5100 KB Output is correct
10 Correct 4 ms 5100 KB Output is correct
11 Correct 4 ms 5100 KB Output is correct
12 Correct 4 ms 5100 KB Output is correct
13 Correct 4 ms 5100 KB Output is correct
14 Correct 4 ms 5100 KB Output is correct
15 Correct 4 ms 5100 KB Output is correct
16 Correct 4 ms 5100 KB Output is correct
17 Correct 4 ms 5100 KB Output is correct
18 Correct 4 ms 5100 KB Output is correct
19 Correct 4 ms 5100 KB Output is correct
20 Correct 5 ms 5100 KB Output is correct
21 Correct 4 ms 5100 KB Output is correct
22 Correct 4 ms 5100 KB Output is correct
23 Correct 5 ms 5100 KB Output is correct
24 Correct 4 ms 5100 KB Output is correct
25 Correct 5 ms 5100 KB Output is correct
26 Correct 4 ms 5100 KB Output is correct
27 Correct 4 ms 5100 KB Output is correct
28 Correct 8 ms 5228 KB Output is correct
29 Correct 8 ms 5228 KB Output is correct
30 Correct 8 ms 5228 KB Output is correct
31 Correct 9 ms 5228 KB Output is correct
32 Correct 12 ms 5228 KB Output is correct
33 Correct 9 ms 5248 KB Output is correct
34 Correct 6 ms 5228 KB Output is correct
35 Correct 10 ms 5228 KB Output is correct
36 Correct 8 ms 5228 KB Output is correct
37 Correct 7 ms 5228 KB Output is correct
38 Correct 6 ms 5228 KB Output is correct
39 Correct 5 ms 5228 KB Output is correct
40 Correct 304 ms 14368 KB Output is correct
41 Correct 376 ms 14204 KB Output is correct
42 Correct 332 ms 14324 KB Output is correct
43 Correct 560 ms 14020 KB Output is correct
44 Correct 228 ms 14392 KB Output is correct
45 Correct 714 ms 14036 KB Output is correct
46 Correct 365 ms 14044 KB Output is correct
47 Correct 71 ms 13164 KB Output is correct
48 Correct 107 ms 13564 KB Output is correct
49 Correct 69 ms 12224 KB Output is correct
50 Correct 61 ms 11280 KB Output is correct
51 Correct 73 ms 11684 KB Output is correct

Subtask #5
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5100 KB Output is correct
2 Correct 4 ms 5100 KB Output is correct
3 Correct 4 ms 5100 KB Output is correct
4 Correct 4 ms 5100 KB Output is correct
5 Correct 4 ms 5100 KB Output is correct
6 Correct 3 ms 5100 KB Output is correct
7 Correct 4 ms 5100 KB Output is correct
8 Correct 4 ms 5100 KB Output is correct
9 Correct 4 ms 5100 KB Output is correct
10 Correct 4 ms 5100 KB Output is correct
11 Correct 4 ms 5100 KB Output is correct
12 Correct 4 ms 5100 KB Output is correct
13 Correct 4 ms 5100 KB Output is correct
14 Correct 4 ms 5100 KB Output is correct
15 Correct 4 ms 5100 KB Output is correct
16 Correct 4 ms 5100 KB Output is correct
17 Correct 4 ms 5100 KB Output is correct
18 Correct 4 ms 5100 KB Output is correct
19 Correct 4 ms 5100 KB Output is correct
20 Correct 5 ms 5100 KB Output is correct
21 Correct 4 ms 5100 KB Output is correct
22 Correct 4 ms 5100 KB Output is correct
23 Correct 5 ms 5100 KB Output is correct
24 Correct 4 ms 5100 KB Output is correct
25 Correct 5 ms 5100 KB Output is correct
26 Correct 4 ms 5100 KB Output is correct
27 Correct 4 ms 5100 KB Output is correct
28 Correct 8 ms 5228 KB Output is correct
29 Correct 8 ms 5228 KB Output is correct
30 Correct 8 ms 5228 KB Output is correct
31 Correct 9 ms 5228 KB Output is correct
32 Correct 12 ms 5228 KB Output is correct
33 Correct 9 ms 5248 KB Output is correct
34 Correct 6 ms 5228 KB Output is correct
35 Correct 10 ms 5228 KB Output is correct
36 Correct 8 ms 5228 KB Output is correct
37 Correct 7 ms 5228 KB Output is correct
38 Correct 6 ms 5228 KB Output is correct
39 Correct 5 ms 5228 KB Output is correct
40 Correct 304 ms 14368 KB Output is correct
41 Correct 376 ms 14204 KB Output is correct
42 Correct 332 ms 14324 KB Output is correct
43 Correct 560 ms 14020 KB Output is correct
44 Correct 228 ms 14392 KB Output is correct
45 Correct 714 ms 14036 KB Output is correct
46 Correct 365 ms 14044 KB Output is correct
47 Correct 71 ms 13164 KB Output is correct
48 Correct 107 ms 13564 KB Output is correct
49 Correct 69 ms 12224 KB Output is correct
50 Correct 61 ms 11280 KB Output is correct
51 Correct 73 ms 11684 KB Output is correct
52 Correct 761 ms 15088 KB Output is correct
53 Correct 1087 ms 15208 KB Output is correct
54 Correct 2190 ms 15132 KB Output is correct
55 Correct 689 ms 14996 KB Output is correct
56 Correct 1885 ms 15140 KB Output is correct
57 Correct 2264 ms 14876 KB Output is correct
58 Correct 903 ms 14572 KB Output is correct
59 Correct 918 ms 13360 KB Output is correct