oj.uz

Submission #911253

# Submission time Handle Problem Language Result Execution time Memory
911253 2024-01-18T17:06:08 Z bachhoangxuan Arranging Tickets (JOI17_arranging_tickets) C++17
85 / 100
 211 ms 15376 KB 
// Judges with GCC >= 12 only needs Ofast
// #pragma GCC optimize("O3,no-stack-protector,fast-math,unroll-loops,tree-vectorize")
// MLE optimization
// #pragma GCC optimize("conserve-stack")
// Old judges
// #pragma GCC target("sse4.2,popcnt,lzcnt,abm,mmx,fma,bmi,bmi2")
// New judges. Test with assert(__builtin_cpu_supports("avx2"));
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma,tune=native")
// Atcoder
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma")
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
- insert(x),erase(x)
- find_by_order(k): return iterator to the k-th smallest element
- order_of_key(x): the number of elements that are strictly smaller
*/

#include<bits/stdc++.h>
using namespace std;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
uniform_real_distribution<> pp(0.0,1.0);
#define int long long
#define ld long double
#define pii pair<int,int>
#define piii pair<int,pii>
#define mpp make_pair
#define fi first
#define se second
const int inf=1e18;
const int mod=998244353;
const int maxn=200005;
const int bl=650;
const int maxs=655;
const int maxm=200005;
const int maxq=1000005;
const int maxl=25;
const int maxa=1000000;
const int root=3;
int power(int a,int n){
    int res=1;
    while(n){
        if(n&1) res=res*a%mod;
        a=a*a%mod;n>>=1;
    }
    return res;
}
const int iroot=power(3,mod-2);
const int base=131;

int n,m,A[maxn],S[maxn];
vector<pii> v[maxn];

void solve(){
    cin >> n >> m;
    for(int i=1;i<=m;i++){
        int a,b,c;cin >> a >> b >> c;
        if(a>b) swap(a,b);
        A[a]++;A[b]--;
        v[a].push_back({b,c});
    }
    for(int i=1;i<=n;i++) A[i]+=A[i-1];
    int pos=max_element(A+1,A+n+1)-A,mx=A[pos];
    //cout << pos << ' ' << mx << '\n';

    auto cal = [&](int N,int m){
        for(int i=1;i<=n;i++) S[i]=0;
        priority_queue<pii> pq;
        int cur=0;
        for(int i=1;i<=pos;i++){
            int X=(A[i]+N-m+1)/2;
            for(auto x:v[i]) if(x.fi>pos) pq.push(x);
            while(cur<X){
                if(pq.empty()) return false;
                pii x=pq.top();pq.pop();
                if(cur+x.se<=X){
                    cur+=x.se;
                    S[x.fi]+=x.se;
                }
                else{
                    S[x.fi]+=(X-cur);
                    x.se-=(X-cur);
                    pq.push(x);cur=X;
                }
            }
        }
        for(int i=pos+1;i<=n;i++){
            cur-=S[i];
            if(A[i]-cur+N-cur>m) return false;
        }
        return true;
    };
    auto check = [&](int m){
        for(int N=mx-m;N<=mx-m+1;N++){
            if(cal(N,m)) return true;
        }
        return false;
    };

    int l=1,r=mx,res=mx;
    while(l<=r){
        int mid=(l+r)>>1;
        if(check(mid)) res=mid,r=mid-1;
        else l=mid+1;
    }
    cout << res << '\n';
}

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);cout.tie(NULL);
    int test=1;//cin >> test;
    while(test--) solve();
}

Subtask #1
10.0 / 10.0

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

Subtask #2
35.0 / 35.0

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

Subtask #3
20.0 / 20.0

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

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 6748 KB Output is correct
2 Correct 2 ms 6748 KB Output is correct
3 Correct 2 ms 6748 KB Output is correct
4 Correct 2 ms 6748 KB Output is correct
5 Correct 2 ms 6748 KB Output is correct
6 Correct 3 ms 6748 KB Output is correct
7 Correct 2 ms 6748 KB Output is correct
8 Correct 2 ms 6748 KB Output is correct
9 Correct 2 ms 6576 KB Output is correct
10 Correct 2 ms 6748 KB Output is correct
11 Correct 2 ms 6748 KB Output is correct
12 Correct 2 ms 6764 KB Output is correct
13 Correct 1 ms 6748 KB Output is correct
14 Correct 2 ms 6756 KB Output is correct
15 Correct 3 ms 6748 KB Output is correct
16 Correct 3 ms 6748 KB Output is correct
17 Correct 2 ms 6748 KB Output is correct
18 Correct 2 ms 6748 KB Output is correct
19 Correct 2 ms 6748 KB Output is correct
20 Correct 2 ms 6748 KB Output is correct
21 Correct 2 ms 6748 KB Output is correct
22 Correct 2 ms 6748 KB Output is correct
23 Correct 2 ms 6748 KB Output is correct
24 Correct 2 ms 6748 KB Output is correct
25 Correct 2 ms 6748 KB Output is correct
26 Correct 2 ms 6748 KB Output is correct
27 Correct 2 ms 6748 KB Output is correct
28 Correct 4 ms 6748 KB Output is correct
29 Correct 4 ms 6748 KB Output is correct
30 Correct 4 ms 6748 KB Output is correct
31 Correct 4 ms 6748 KB Output is correct
32 Correct 4 ms 6748 KB Output is correct
33 Correct 4 ms 6748 KB Output is correct
34 Correct 2 ms 6748 KB Output is correct
35 Correct 4 ms 6748 KB Output is correct
36 Correct 4 ms 6892 KB Output is correct
37 Correct 3 ms 6748 KB Output is correct
38 Correct 2 ms 6748 KB Output is correct
39 Correct 2 ms 6812 KB Output is correct
40 Correct 123 ms 14092 KB Output is correct
41 Correct 144 ms 14308 KB Output is correct
42 Correct 68 ms 13260 KB Output is correct
43 Correct 180 ms 14256 KB Output is correct
44 Correct 122 ms 14220 KB Output is correct
45 Correct 211 ms 14000 KB Output is correct
46 Correct 58 ms 13636 KB Output is correct
47 Correct 35 ms 13256 KB Output is correct
48 Correct 55 ms 13420 KB Output is correct
49 Correct 50 ms 13068 KB Output is correct
50 Correct 35 ms 12028 KB Output is correct
51 Correct 39 ms 12308 KB Output is correct

Subtask #5
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 6748 KB Output is correct
2 Correct 2 ms 6748 KB Output is correct
3 Correct 2 ms 6748 KB Output is correct
4 Correct 2 ms 6748 KB Output is correct
5 Correct 2 ms 6748 KB Output is correct
6 Correct 3 ms 6748 KB Output is correct
7 Correct 2 ms 6748 KB Output is correct
8 Correct 2 ms 6748 KB Output is correct
9 Correct 2 ms 6576 KB Output is correct
10 Correct 2 ms 6748 KB Output is correct
11 Correct 2 ms 6748 KB Output is correct
12 Correct 2 ms 6764 KB Output is correct
13 Correct 1 ms 6748 KB Output is correct
14 Correct 2 ms 6756 KB Output is correct
15 Correct 3 ms 6748 KB Output is correct
16 Correct 3 ms 6748 KB Output is correct
17 Correct 2 ms 6748 KB Output is correct
18 Correct 2 ms 6748 KB Output is correct
19 Correct 2 ms 6748 KB Output is correct
20 Correct 2 ms 6748 KB Output is correct
21 Correct 2 ms 6748 KB Output is correct
22 Correct 2 ms 6748 KB Output is correct
23 Correct 2 ms 6748 KB Output is correct
24 Correct 2 ms 6748 KB Output is correct
25 Correct 2 ms 6748 KB Output is correct
26 Correct 2 ms 6748 KB Output is correct
27 Correct 2 ms 6748 KB Output is correct
28 Correct 4 ms 6748 KB Output is correct
29 Correct 4 ms 6748 KB Output is correct
30 Correct 4 ms 6748 KB Output is correct
31 Correct 4 ms 6748 KB Output is correct
32 Correct 4 ms 6748 KB Output is correct
33 Correct 4 ms 6748 KB Output is correct
34 Correct 2 ms 6748 KB Output is correct
35 Correct 4 ms 6748 KB Output is correct
36 Correct 4 ms 6892 KB Output is correct
37 Correct 3 ms 6748 KB Output is correct
38 Correct 2 ms 6748 KB Output is correct
39 Correct 2 ms 6812 KB Output is correct
40 Correct 123 ms 14092 KB Output is correct
41 Correct 144 ms 14308 KB Output is correct
42 Correct 68 ms 13260 KB Output is correct
43 Correct 180 ms 14256 KB Output is correct
44 Correct 122 ms 14220 KB Output is correct
45 Correct 211 ms 14000 KB Output is correct
46 Correct 58 ms 13636 KB Output is correct
47 Correct 35 ms 13256 KB Output is correct
48 Correct 55 ms 13420 KB Output is correct
49 Correct 50 ms 13068 KB Output is correct
50 Correct 35 ms 12028 KB Output is correct
51 Correct 39 ms 12308 KB Output is correct
52 Incorrect 41 ms 15376 KB Output isn't correct
53 Halted 0 ms 0 KB -