Submission #1040973

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1040973	2024-08-01T13:14:42 Z	GrindMachine	Arranging Tickets (JOI17_arranging_tickets)	C++17	65 / 100	6000 ms	14444 KB

arranging_tickets

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
 
using namespace std;
using namespace __gnu_pbds;
 
template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
 
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) (int)a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x,y) ((x+y-1)/(y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl
 
#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)
 
template<typename T>
void amin(T &a, T b) {
    a = min(a,b);
}
 
template<typename T>
void amax(T &a, T b) {
    a = max(a,b);
}
 
#ifdef LOCAL
#include "debug.h"
#else
#define debug(...) 42
#endif
 
/*
 
refs:
edi
 
*/
 
const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;
 
void solve(int test_case)
{
    ll n,m; cin >> n >> m;
    vector<pll> a(m+5);
    rep1(i,m){
        ll l,r,c; cin >> l >> r >> c;
        if(l > r) swap(l,r);
        a[i] = {l,r};
    }

    vector<ll> enter[n+5];    
    vector<ll> diff(n+5);
    rep1(i,m){
        auto [l,r] = a[i];
        diff[l]++, diff[r]--;
        enter[l].pb(r);
    }

    rep1(i,n) diff[i] += diff[i-1];

    auto go = [&](ll d){
        vector<ll> close(n+5);
        ll curr = 0;
        priority_queue<ll> pq;
        ll res = 0;

        rep1(i,n){
            trav(r,enter[i]){
                pq.push(r);
            }
            curr -= close[i];
            ll val = diff[i]-curr*2;
            while(val > d){
                ll r = pq.top();
                pq.pop();
                res++;
                curr++;
                val -= 2;
                close[r]++;
            }
        }

        return res;
    };
 
    ll ans = inf2;
    rep(d,m+1){
        amin(ans,go(d)+d);
    }
 
    cout << ans << endl;
}
 
int main()
{
    fastio;
 
    int t = 1;
    // cin >> t;
 
    rep1(i, t) {
        solve(i);
    }
 
    return 0;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
35.0 / 35.0

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

Subtask #3
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	2 ms	344 KB	Output is correct
17	Correct	2 ms	348 KB	Output is correct
18	Correct	2 ms	348 KB	Output is correct
19	Correct	2 ms	348 KB	Output is correct
20	Correct	2 ms	348 KB	Output is correct
21	Correct	2 ms	348 KB	Output is correct
22	Correct	2 ms	348 KB	Output is correct
23	Correct	2 ms	348 KB	Output is correct
24	Correct	2 ms	348 KB	Output is correct
25	Correct	1 ms	348 KB	Output is correct
26	Correct	2 ms	600 KB	Output is correct
27	Correct	1 ms	348 KB	Output is correct
28	Correct	193 ms	604 KB	Output is correct
29	Correct	204 ms	604 KB	Output is correct
30	Correct	186 ms	848 KB	Output is correct
31	Correct	176 ms	732 KB	Output is correct
32	Correct	176 ms	604 KB	Output is correct
33	Correct	175 ms	604 KB	Output is correct
34	Correct	180 ms	724 KB	Output is correct
35	Correct	162 ms	704 KB	Output is correct
36	Correct	170 ms	732 KB	Output is correct
37	Correct	159 ms	600 KB	Output is correct
38	Correct	83 ms	600 KB	Output is correct
39	Correct	89 ms	600 KB	Output is correct

Subtask #4
0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	2 ms	344 KB	Output is correct
17	Correct	2 ms	348 KB	Output is correct
18	Correct	2 ms	348 KB	Output is correct
19	Correct	2 ms	348 KB	Output is correct
20	Correct	2 ms	348 KB	Output is correct
21	Correct	2 ms	348 KB	Output is correct
22	Correct	2 ms	348 KB	Output is correct
23	Correct	2 ms	348 KB	Output is correct
24	Correct	2 ms	348 KB	Output is correct
25	Correct	1 ms	348 KB	Output is correct
26	Correct	2 ms	600 KB	Output is correct
27	Correct	1 ms	348 KB	Output is correct
28	Correct	193 ms	604 KB	Output is correct
29	Correct	204 ms	604 KB	Output is correct
30	Correct	186 ms	848 KB	Output is correct
31	Correct	176 ms	732 KB	Output is correct
32	Correct	176 ms	604 KB	Output is correct
33	Correct	175 ms	604 KB	Output is correct
34	Correct	180 ms	724 KB	Output is correct
35	Correct	162 ms	704 KB	Output is correct
36	Correct	170 ms	732 KB	Output is correct
37	Correct	159 ms	600 KB	Output is correct
38	Correct	83 ms	600 KB	Output is correct
39	Correct	89 ms	600 KB	Output is correct
40	Execution timed out	6034 ms	14444 KB	Time limit exceeded
41	Halted	0 ms	0 KB	-

Subtask #5
0 / 15.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	2 ms	344 KB	Output is correct
17	Correct	2 ms	348 KB	Output is correct
18	Correct	2 ms	348 KB	Output is correct
19	Correct	2 ms	348 KB	Output is correct
20	Correct	2 ms	348 KB	Output is correct
21	Correct	2 ms	348 KB	Output is correct
22	Correct	2 ms	348 KB	Output is correct
23	Correct	2 ms	348 KB	Output is correct
24	Correct	2 ms	348 KB	Output is correct
25	Correct	1 ms	348 KB	Output is correct
26	Correct	2 ms	600 KB	Output is correct
27	Correct	1 ms	348 KB	Output is correct
28	Correct	193 ms	604 KB	Output is correct
29	Correct	204 ms	604 KB	Output is correct
30	Correct	186 ms	848 KB	Output is correct
31	Correct	176 ms	732 KB	Output is correct
32	Correct	176 ms	604 KB	Output is correct
33	Correct	175 ms	604 KB	Output is correct
34	Correct	180 ms	724 KB	Output is correct
35	Correct	162 ms	704 KB	Output is correct
36	Correct	170 ms	732 KB	Output is correct
37	Correct	159 ms	600 KB	Output is correct
38	Correct	83 ms	600 KB	Output is correct
39	Correct	89 ms	600 KB	Output is correct
40	Execution timed out	6034 ms	14444 KB	Time limit exceeded
41	Halted	0 ms	0 KB	-

Submission #1040973

Compilation message

Subtask #1 10.0 / 10.0

Subtask #2 35.0 / 35.0

Subtask #3 20.0 / 20.0

Subtask #4 0 / 20.0

Subtask #5 0 / 15.0

Subtask #1
10.0 / 10.0

Subtask #2
35.0 / 35.0

Subtask #3
20.0 / 20.0

Subtask #4
0 / 20.0

Subtask #5
0 / 15.0