oj.uz

Submission #697950

# Submission time Handle Problem Language Result Execution time Memory
697950 2023-02-11T14:57:05 Z urosk Arranging Tickets (JOI17_arranging_tickets) C++14
100 / 100
 2498 ms 18684 KB 
#define here cerr<<"===========================================\n"
#define dbg(x) cerr<<#x<<": "<<x<<endl;
#include "bits/stdc++.h"
//#include <ext/pb_ds/tree_policy.hpp>
//#include <ext/pb_ds/assoc_container.hpp>
#define ld double
#define ll long long
#define llinf 100000000000000000LL // 10^17
#define pb push_back
#define popb pop_back
#define fi first
#define sc second
#define endl '\n'
#define pll pair<ll,ll>
#define pld pair<ld,ld>
#define sz(a) (ll)(a.size())
#define all(a) a.begin(),a.end()
#define ceri(a,l,r) {cerr<<#a<<": ";for(ll i_ = l;i_<=r;i_++) cerr<<a[i_]<< " ";cerr<<endl;}
#define cer(a) {cerr<<#a<<": ";for(ll x_ : a) cerr<<x_<< " ";cerr<<endl;}

#define daj_mi_malo_vremena ios_base::sync_with_stdio(false);cerr.tie(0);cout.tie(0);cin.tie(0);

using namespace std;
//using namespace __gnu_pbds;
/*
ll add(ll x,ll y){
    x+=y;
    if(x<0){
        x%=mod;
        x+=mod;
    }else{
        if(x>=mod) x%=mod;
    }
    return x;
}
ll mul(ll a,ll b){
	ll ans = (a*b)%mod;
	if(ans<0) ans+=mod;
	return ans;
}
typedef tree<int,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
typedef tree<int,null_type,less_equal<ll>,rb_tree_tag,tree_order_statistics_node_update> ordered_multiset;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll rnd(ll l,ll r){
    return uniform_int_distribution<ll>(l,r)(rng);
}
*/
#define maxn 200005
ll n,m;
ll a[maxn],b[maxn],c[maxn];
ll ps[maxn],add[maxn],need[maxn],cnt[maxn];
vector<ll> v[maxn];
bool cmp(ll x,ll y){return b[x]<b[y];}
priority_queue<ll,vector<ll>,decltype(&cmp)> pq(cmp);
bool moe(ll x,ll pos,ll f){
    for(ll i = 1;i<=n;i++) add[i] = 0;
    for(ll i = 1;i<=m;i++) cnt[i] = c[i];
    for(ll i = 1;i<pos;i++) need[i] = (ps[i]+f-x+1)/2;
    need[pos] = f;
    ll cur = 0;
    while(sz(pq)) pq.pop();
    for(ll i = 1;i<=pos;i++){
        for(ll j : v[i]){
            if(b[j]>pos){
                pq.push(j);
                cnt[j] = c[j];
            }
        }
        while(sz(pq)&&cur<need[i]){
            ll j = pq.top();
            ll d = min(cnt[j],need[i]-cur);
            cur+=d;
            cnt[j]-=d;
            add[1]+=d;
            add[a[j]]-=2*d;
            add[b[j]]+=2*d;
            if(cnt[j]==0) pq.pop();
        }
        if(cur<need[i]) return 0;
    }
    for(ll i = 1;i<=n;i++) add[i]+=add[i-1];
    for(ll i = 1;i<=n;i++) if(add[i]+ps[i]>x) return 0;
    return 1;
}
void tc(){
    cin >> n >> m;
    for(ll i = 1;i<=n;i++){
        cin >> a[i] >> b[i] >> c[i];
        if(a[i]>b[i]) swap(a[i],b[i]);
        ps[a[i]]+=c[i];
        ps[b[i]]-=c[i];
        v[a[i]].pb(i);
    }
    for(ll i = 1;i<=n;i++) ps[i]+=ps[i-1];
    ll fir = 0,lst = 0,mx = 0;
    for(ll i = 1;i<=n;i++) mx = max(mx,ps[i]);
    for(ll i = 1;i<=n;i++) if(ps[i]==mx) lst = i;
    for(ll i = n;i>=1;i--) if(ps[i]==mx) fir = i;
    ll tl = 0,tr = mx,mid,ans = 0;
    while(tl<=tr){
        mid = (tl+tr)/2;
        if(moe(mid,fir,mx-mid)||moe(mid,fir,mx-mid+1)||
        moe(mid,lst,mx-mid)||moe(mid,lst,mx-mid+1)){ans = mid; tr = mid-1;}
        else tl = mid+1;
    }
    cout<<ans<<endl;
}
int main(){
	daj_mi_malo_vremena
    int t; t = 1;
    while(t--){
        tc();
    }
	return 0;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
35.0 / 35.0

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

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 3 ms 5076 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 2 ms 5076 KB Output is correct
6 Correct 3 ms 5032 KB Output is correct
7 Correct 3 ms 5076 KB Output is correct
8 Correct 3 ms 4948 KB Output is correct
9 Correct 2 ms 4948 KB Output is correct
10 Correct 3 ms 4988 KB Output is correct
11 Correct 3 ms 5076 KB Output is correct
12 Correct 3 ms 5032 KB Output is correct
13 Correct 3 ms 4948 KB Output is correct
14 Correct 3 ms 4948 KB Output is correct
15 Correct 3 ms 5028 KB Output is correct
16 Correct 3 ms 5076 KB Output is correct
17 Correct 5 ms 5036 KB Output is correct
18 Correct 3 ms 5036 KB Output is correct
19 Correct 3 ms 5076 KB Output is correct
20 Correct 3 ms 5076 KB Output is correct
21 Correct 3 ms 5076 KB Output is correct
22 Correct 3 ms 5040 KB Output is correct
23 Correct 3 ms 5036 KB Output is correct
24 Correct 4 ms 5076 KB Output is correct
25 Correct 4 ms 5036 KB Output is correct
26 Correct 4 ms 5032 KB Output is correct
27 Correct 3 ms 5076 KB Output is correct
28 Correct 6 ms 5332 KB Output is correct
29 Correct 6 ms 5332 KB Output is correct
30 Correct 8 ms 5272 KB Output is correct
31 Correct 6 ms 5332 KB Output is correct
32 Correct 12 ms 5308 KB Output is correct
33 Correct 8 ms 5332 KB Output is correct
34 Correct 5 ms 5332 KB Output is correct
35 Correct 8 ms 5332 KB Output is correct
36 Correct 7 ms 5332 KB Output is correct
37 Correct 4 ms 5308 KB Output is correct
38 Correct 4 ms 5292 KB Output is correct
39 Correct 4 ms 5332 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 3 ms 5076 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 2 ms 5076 KB Output is correct
6 Correct 3 ms 5032 KB Output is correct
7 Correct 3 ms 5076 KB Output is correct
8 Correct 3 ms 4948 KB Output is correct
9 Correct 2 ms 4948 KB Output is correct
10 Correct 3 ms 4988 KB Output is correct
11 Correct 3 ms 5076 KB Output is correct
12 Correct 3 ms 5032 KB Output is correct
13 Correct 3 ms 4948 KB Output is correct
14 Correct 3 ms 4948 KB Output is correct
15 Correct 3 ms 5028 KB Output is correct
16 Correct 3 ms 5076 KB Output is correct
17 Correct 5 ms 5036 KB Output is correct
18 Correct 3 ms 5036 KB Output is correct
19 Correct 3 ms 5076 KB Output is correct
20 Correct 3 ms 5076 KB Output is correct
21 Correct 3 ms 5076 KB Output is correct
22 Correct 3 ms 5040 KB Output is correct
23 Correct 3 ms 5036 KB Output is correct
24 Correct 4 ms 5076 KB Output is correct
25 Correct 4 ms 5036 KB Output is correct
26 Correct 4 ms 5032 KB Output is correct
27 Correct 3 ms 5076 KB Output is correct
28 Correct 6 ms 5332 KB Output is correct
29 Correct 6 ms 5332 KB Output is correct
30 Correct 8 ms 5272 KB Output is correct
31 Correct 6 ms 5332 KB Output is correct
32 Correct 12 ms 5308 KB Output is correct
33 Correct 8 ms 5332 KB Output is correct
34 Correct 5 ms 5332 KB Output is correct
35 Correct 8 ms 5332 KB Output is correct
36 Correct 7 ms 5332 KB Output is correct
37 Correct 4 ms 5308 KB Output is correct
38 Correct 4 ms 5292 KB Output is correct
39 Correct 4 ms 5332 KB Output is correct
40 Correct 392 ms 17324 KB Output is correct
41 Correct 448 ms 17864 KB Output is correct
42 Correct 423 ms 16928 KB Output is correct
43 Correct 708 ms 17316 KB Output is correct
44 Correct 328 ms 17648 KB Output is correct
45 Correct 926 ms 16772 KB Output is correct
46 Correct 491 ms 16872 KB Output is correct
47 Correct 81 ms 17092 KB Output is correct
48 Correct 113 ms 16240 KB Output is correct
49 Correct 69 ms 14024 KB Output is correct
50 Correct 46 ms 14844 KB Output is correct
51 Correct 63 ms 14248 KB Output is correct

Subtask #5
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 3 ms 5076 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 2 ms 5076 KB Output is correct
6 Correct 3 ms 5032 KB Output is correct
7 Correct 3 ms 5076 KB Output is correct
8 Correct 3 ms 4948 KB Output is correct
9 Correct 2 ms 4948 KB Output is correct
10 Correct 3 ms 4988 KB Output is correct
11 Correct 3 ms 5076 KB Output is correct
12 Correct 3 ms 5032 KB Output is correct
13 Correct 3 ms 4948 KB Output is correct
14 Correct 3 ms 4948 KB Output is correct
15 Correct 3 ms 5028 KB Output is correct
16 Correct 3 ms 5076 KB Output is correct
17 Correct 5 ms 5036 KB Output is correct
18 Correct 3 ms 5036 KB Output is correct
19 Correct 3 ms 5076 KB Output is correct
20 Correct 3 ms 5076 KB Output is correct
21 Correct 3 ms 5076 KB Output is correct
22 Correct 3 ms 5040 KB Output is correct
23 Correct 3 ms 5036 KB Output is correct
24 Correct 4 ms 5076 KB Output is correct
25 Correct 4 ms 5036 KB Output is correct
26 Correct 4 ms 5032 KB Output is correct
27 Correct 3 ms 5076 KB Output is correct
28 Correct 6 ms 5332 KB Output is correct
29 Correct 6 ms 5332 KB Output is correct
30 Correct 8 ms 5272 KB Output is correct
31 Correct 6 ms 5332 KB Output is correct
32 Correct 12 ms 5308 KB Output is correct
33 Correct 8 ms 5332 KB Output is correct
34 Correct 5 ms 5332 KB Output is correct
35 Correct 8 ms 5332 KB Output is correct
36 Correct 7 ms 5332 KB Output is correct
37 Correct 4 ms 5308 KB Output is correct
38 Correct 4 ms 5292 KB Output is correct
39 Correct 4 ms 5332 KB Output is correct
40 Correct 392 ms 17324 KB Output is correct
41 Correct 448 ms 17864 KB Output is correct
42 Correct 423 ms 16928 KB Output is correct
43 Correct 708 ms 17316 KB Output is correct
44 Correct 328 ms 17648 KB Output is correct
45 Correct 926 ms 16772 KB Output is correct
46 Correct 491 ms 16872 KB Output is correct
47 Correct 81 ms 17092 KB Output is correct
48 Correct 113 ms 16240 KB Output is correct
49 Correct 69 ms 14024 KB Output is correct
50 Correct 46 ms 14844 KB Output is correct
51 Correct 63 ms 14248 KB Output is correct
52 Correct 803 ms 18684 KB Output is correct
53 Correct 1200 ms 18232 KB Output is correct
54 Correct 2282 ms 18328 KB Output is correct
55 Correct 748 ms 18600 KB Output is correct
56 Correct 2029 ms 17824 KB Output is correct
57 Correct 2498 ms 17724 KB Output is correct
58 Correct 1100 ms 18100 KB Output is correct
59 Correct 1457 ms 14588 KB Output is correct