oj.uz

Submission #986862

# Submission time Handle Problem Language Result Execution time Memory
986862 2024-05-21T12:46:13 Z GrindMachine Arranging Tickets (JOI17_arranging_tickets) C++17
45 / 100
 6000 ms 592 KB 
#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

/*



*/

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};
    }

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

        rep1(i,n) diff[i] += diff[i-1];
        rep1(i,n) diff[i] = max(diff[i]-d,0ll);

        ll k = 0;
        vector<bool> done(m+5);

        while(true){
            if(*max_element(all(diff)) == 0) break;
            k++;
            pll best = {-inf2,-inf2};

            rep1(i,m){
                if(done[i]) conts;
                ll cost = 0;
                for(int j = a[i].ff; j < a[i].ss; ++j){
                    cost += min(diff[j],2ll);
                }
                pll px = {cost,i};
                amax(best,px);
            }

            ll i = best.ss;
            assert(i != -inf2);
            done[i] = 1;

            for(int j = a[i].ff; j < a[i].ss; ++j){
                diff[j] -= 2;
                amax(diff[j],0ll);
            }
        }

        return k;
    };

    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 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 516 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 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 460 KB Output is correct
10 Correct 0 ms 456 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 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 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 516 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 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 460 KB Output is correct
10 Correct 0 ms 456 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 408 ms 440 KB Output is correct
17 Correct 425 ms 444 KB Output is correct
18 Correct 373 ms 448 KB Output is correct
19 Correct 442 ms 440 KB Output is correct
20 Correct 471 ms 444 KB Output is correct
21 Correct 390 ms 448 KB Output is correct
22 Correct 408 ms 444 KB Output is correct
23 Correct 462 ms 348 KB Output is correct
24 Correct 215 ms 592 KB Output is correct
25 Correct 218 ms 440 KB Output is correct
26 Correct 377 ms 592 KB Output is correct
27 Correct 325 ms 348 KB Output is correct

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 516 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 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 460 KB Output is correct
10 Correct 0 ms 456 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 408 ms 440 KB Output is correct
17 Correct 425 ms 444 KB Output is correct
18 Correct 373 ms 448 KB Output is correct
19 Correct 442 ms 440 KB Output is correct
20 Correct 471 ms 444 KB Output is correct
21 Correct 390 ms 448 KB Output is correct
22 Correct 408 ms 444 KB Output is correct
23 Correct 462 ms 348 KB Output is correct
24 Correct 215 ms 592 KB Output is correct
25 Correct 218 ms 440 KB Output is correct
26 Correct 377 ms 592 KB Output is correct
27 Correct 325 ms 348 KB Output is correct
28 Execution timed out 6039 ms 344 KB Time limit exceeded
29 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 516 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 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 460 KB Output is correct
10 Correct 0 ms 456 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 408 ms 440 KB Output is correct
17 Correct 425 ms 444 KB Output is correct
18 Correct 373 ms 448 KB Output is correct
19 Correct 442 ms 440 KB Output is correct
20 Correct 471 ms 444 KB Output is correct
21 Correct 390 ms 448 KB Output is correct
22 Correct 408 ms 444 KB Output is correct
23 Correct 462 ms 348 KB Output is correct
24 Correct 215 ms 592 KB Output is correct
25 Correct 218 ms 440 KB Output is correct
26 Correct 377 ms 592 KB Output is correct
27 Correct 325 ms 348 KB Output is correct
28 Execution timed out 6039 ms 344 KB Time limit exceeded
29 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 516 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 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 460 KB Output is correct
10 Correct 0 ms 456 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 408 ms 440 KB Output is correct
17 Correct 425 ms 444 KB Output is correct
18 Correct 373 ms 448 KB Output is correct
19 Correct 442 ms 440 KB Output is correct
20 Correct 471 ms 444 KB Output is correct
21 Correct 390 ms 448 KB Output is correct
22 Correct 408 ms 444 KB Output is correct
23 Correct 462 ms 348 KB Output is correct
24 Correct 215 ms 592 KB Output is correct
25 Correct 218 ms 440 KB Output is correct
26 Correct 377 ms 592 KB Output is correct
27 Correct 325 ms 348 KB Output is correct
28 Execution timed out 6039 ms 344 KB Time limit exceeded
29 Halted 0 ms 0 KB -