oj.uz

Submission #814660

# Submission time Handle Problem Language Result Execution time Memory
814660 2023-08-08T08:50:53 Z 이동현(#10122) Arranging Tickets (JOI17_arranging_tickets) C++17
85 / 100
 6000 ms 54496 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
using namespace std;

int tr[800004], lazy[800004];

struct Seg{
    int n;

    Seg(int m){
        n = m + 4;
    }

    void push(int x, int s, int e, int ps, int pe, int val){
        if(pe < s || ps > e || ps > pe) return;
        if(ps <= s && pe >= e){
            tr[x] += val;
            lazy[x] += val;
            return;
        }
        if(lazy[x]){
            tr[x * 2] += lazy[x], lazy[x * 2] += lazy[x];
            tr[x * 2 + 1] += lazy[x], lazy[x * 2 + 1] += lazy[x];
            lazy[x] = 0;
        }

        int m = s + e >> 1;
        push(x * 2, s, m, ps, pe, val);
        push(x * 2 + 1, m + 1, e, ps, pe, val);

        tr[x] = max(tr[x * 2], tr[x * 2 + 1]);
    }
};

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);

    int L, n;
    cin >> L >> n;

    int test = 0;

    if(test){
        L = 200000;
        n = 100000;
    }
    Seg trs(L + 4);
    vector<array<int, 4>> a(n), b;
    long long alladd = 0;

    int mn = 24;

    for(int i = 0; i < n; ++i){
        cin >> a[i][0] >> a[i][1] >> a[i][2];
        --a[i][0], --a[i][1];

        if(test){
            a[i][2] = (long long)rand() * rand() % (int)1e9;
            a[i][0] = rand() % L;
            a[i][1] = rand() % L;
        }

        if(a[i][0] > a[i][1]) swap(a[i][0], a[i][1]);

        int sz = min(mn, a[i][2]);
        if(sz % 2 != a[i][2] % 2) ++sz;

        assert(sz <= a[i][2]);

        alladd += (a[i][2] - sz) / 2;
        trs.push(1, 0, L - 1, a[i][0], a[i][1] - 1, sz);

        for(int j = 1; j < sz; ++j){
            a.push_back(a[i]);
        }
    }

    n = (int)a.size();

    auto flip = [&](int id)->void{
        if(a[id][3] == 1){
            trs.push(1, 0, L - 1, a[id][1], L - 1, -1);
            trs.push(1, 0, L - 1, 0, a[id][0] - 1, -1);
            trs.push(1, 0, L - 1, a[id][0], a[id][1] - 1, 1);
        }
        else{
            trs.push(1, 0, L - 1, a[id][1], L - 1, 1);
            trs.push(1, 0, L - 1, 0, a[id][0] - 1, 1);
            trs.push(1, 0, L - 1, a[id][0], a[id][1] - 1, -1);
        }
        a[id][3] ^= 1;
    };

    int ans = (int)1e9;

    // cout << n << endl;
    // for(auto&i:a){
    //     cout << i[0] << ' ' << i[1] << ' ' << i[2] << ' ' << i[3] << endl;
    // }

    // cout << alladd << endl;

    auto doit = [&]{
        for(int i = 0; i < 1; ++i){
            for(int j = i - 1; j < n; ++j){
                if(j >= 0) flip(j);

                if(j > 0 && n > 300) break;
                
                int nans = tr[1];
                while(true){
                    int now = nans;

                    for(int i = 0; i < n; ++i){
                        flip(i);

                        int prv = now;
                        now = min(now, tr[1]);

                        if(now == prv) flip(i);
                    }

                    if(now == nans) break;

                    nans = now;
                }

                ans = min(ans, nans);
            }
        }
    };
    
    sort(a.begin(), a.end(), [&](array<int, 4>&x, array<int, 4>&y){return x[0] + x[1] < y[0] + y[1];});
    doit();

    cout << ans + alladd << '\n';
    
    return 0;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 372 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 74 ms 340 KB Output is correct
17 Correct 67 ms 340 KB Output is correct
18 Correct 70 ms 340 KB Output is correct
19 Correct 69 ms 340 KB Output is correct
20 Correct 69 ms 340 KB Output is correct
21 Correct 71 ms 340 KB Output is correct
22 Correct 74 ms 340 KB Output is correct
23 Correct 70 ms 340 KB Output is correct
24 Correct 75 ms 340 KB Output is correct
25 Correct 69 ms 340 KB Output is correct
26 Correct 55 ms 340 KB Output is correct
27 Correct 63 ms 340 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 372 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 74 ms 340 KB Output is correct
17 Correct 67 ms 340 KB Output is correct
18 Correct 70 ms 340 KB Output is correct
19 Correct 69 ms 340 KB Output is correct
20 Correct 69 ms 340 KB Output is correct
21 Correct 71 ms 340 KB Output is correct
22 Correct 74 ms 340 KB Output is correct
23 Correct 70 ms 340 KB Output is correct
24 Correct 75 ms 340 KB Output is correct
25 Correct 69 ms 340 KB Output is correct
26 Correct 55 ms 340 KB Output is correct
27 Correct 63 ms 340 KB Output is correct
28 Correct 10 ms 340 KB Output is correct
29 Correct 9 ms 456 KB Output is correct
30 Correct 9 ms 448 KB Output is correct
31 Correct 9 ms 452 KB Output is correct
32 Correct 9 ms 340 KB Output is correct
33 Correct 9 ms 452 KB Output is correct
34 Correct 10 ms 340 KB Output is correct
35 Correct 9 ms 452 KB Output is correct
36 Correct 9 ms 340 KB Output is correct
37 Correct 8 ms 340 KB Output is correct
38 Correct 10 ms 340 KB Output is correct
39 Correct 10 ms 340 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 372 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 74 ms 340 KB Output is correct
17 Correct 67 ms 340 KB Output is correct
18 Correct 70 ms 340 KB Output is correct
19 Correct 69 ms 340 KB Output is correct
20 Correct 69 ms 340 KB Output is correct
21 Correct 71 ms 340 KB Output is correct
22 Correct 74 ms 340 KB Output is correct
23 Correct 70 ms 340 KB Output is correct
24 Correct 75 ms 340 KB Output is correct
25 Correct 69 ms 340 KB Output is correct
26 Correct 55 ms 340 KB Output is correct
27 Correct 63 ms 340 KB Output is correct
28 Correct 10 ms 340 KB Output is correct
29 Correct 9 ms 456 KB Output is correct
30 Correct 9 ms 448 KB Output is correct
31 Correct 9 ms 452 KB Output is correct
32 Correct 9 ms 340 KB Output is correct
33 Correct 9 ms 452 KB Output is correct
34 Correct 10 ms 340 KB Output is correct
35 Correct 9 ms 452 KB Output is correct
36 Correct 9 ms 340 KB Output is correct
37 Correct 8 ms 340 KB Output is correct
38 Correct 10 ms 340 KB Output is correct
39 Correct 10 ms 340 KB Output is correct
40 Correct 488 ms 5972 KB Output is correct
41 Correct 506 ms 5972 KB Output is correct
42 Correct 498 ms 5972 KB Output is correct
43 Correct 474 ms 5972 KB Output is correct
44 Correct 472 ms 5972 KB Output is correct
45 Correct 502 ms 5972 KB Output is correct
46 Correct 434 ms 5844 KB Output is correct
47 Correct 446 ms 5844 KB Output is correct
48 Correct 458 ms 5844 KB Output is correct
49 Correct 361 ms 3964 KB Output is correct
50 Correct 357 ms 3924 KB Output is correct
51 Correct 387 ms 3924 KB Output is correct

Subtask #5
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 372 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 74 ms 340 KB Output is correct
17 Correct 67 ms 340 KB Output is correct
18 Correct 70 ms 340 KB Output is correct
19 Correct 69 ms 340 KB Output is correct
20 Correct 69 ms 340 KB Output is correct
21 Correct 71 ms 340 KB Output is correct
22 Correct 74 ms 340 KB Output is correct
23 Correct 70 ms 340 KB Output is correct
24 Correct 75 ms 340 KB Output is correct
25 Correct 69 ms 340 KB Output is correct
26 Correct 55 ms 340 KB Output is correct
27 Correct 63 ms 340 KB Output is correct
28 Correct 10 ms 340 KB Output is correct
29 Correct 9 ms 456 KB Output is correct
30 Correct 9 ms 448 KB Output is correct
31 Correct 9 ms 452 KB Output is correct
32 Correct 9 ms 340 KB Output is correct
33 Correct 9 ms 452 KB Output is correct
34 Correct 10 ms 340 KB Output is correct
35 Correct 9 ms 452 KB Output is correct
36 Correct 9 ms 340 KB Output is correct
37 Correct 8 ms 340 KB Output is correct
38 Correct 10 ms 340 KB Output is correct
39 Correct 10 ms 340 KB Output is correct
40 Correct 488 ms 5972 KB Output is correct
41 Correct 506 ms 5972 KB Output is correct
42 Correct 498 ms 5972 KB Output is correct
43 Correct 474 ms 5972 KB Output is correct
44 Correct 472 ms 5972 KB Output is correct
45 Correct 502 ms 5972 KB Output is correct
46 Correct 434 ms 5844 KB Output is correct
47 Correct 446 ms 5844 KB Output is correct
48 Correct 458 ms 5844 KB Output is correct
49 Correct 361 ms 3964 KB Output is correct
50 Correct 357 ms 3924 KB Output is correct
51 Correct 387 ms 3924 KB Output is correct
52 Execution timed out 6037 ms 54496 KB Time limit exceeded
53 Halted 0 ms 0 KB -