oj.uz

답안 #814401

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
814401 2023-08-08T07:17:43 Z 이동현(#10122) Arranging Tickets (JOI17_arranging_tickets) C++17
85 / 100
 5896 ms 8920 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
using namespace std;

struct Seg{
    int n;
    vector<int> tr, lazy;

    Seg(int m){
        n = m + 4;
        tr.resize(n * 4 + 4);
        lazy.resize(n * 4 + 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 tr(L + 4);
    vector<array<int, 4>> a(n);
    long long alladd = 0;
    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] = 1;
            a[i][0] = rand() % 3000;
            a[i][1] = rand() % 3000;
        }

        alladd += a[i][2] / 2;
        a[i][2] %= 2;

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

        tr.push(1, 0, L - 1, a[i][0], a[i][1] - 1, a[i][2]);
    }

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

    int ans = (int)1e9;

    // assert(n <= 300);

    auto doit = [&]{
        for(int i = 0; i < 1; ++i){
            for(int j = i - 1; j < n; ++j){
                // cout << j << ' ' << ans << endl;
                if(j >= 0) flip(j);
                
                if(n < 300 || j % 5000 == 0){
                    int nans = tr.tr[1];
                    while(true){
                        int now = nans;

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

                            int prv = now;
                            now = min(now, tr.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 make_pair(x[1], x[0]) < make_pair(y[1], y[0]);});
    // doit();
    // sort(a.begin(), a.end(), [&](array<int, 4>&x, array<int, 4>&y){return make_pair(x[1], x[0] + x[1]) < make_pair(y[1], y[0] + y[1]);});
    // doit();
    // sort(a.begin(), a.end(), [&](array<int, 4>&x, array<int, 4>&y){return make_pair(x[1], x[0] - x[1]) < make_pair(y[1], y[0] - y[1]);});
    // doit();
    // sort(a.begin(), a.end(), [&](array<int, 4>&x, array<int, 4>&y){return make_pair(x[0], x[1]) < make_pair(y[0], y[1]);});
    // doit();
    // sort(a.begin(), a.end(), [&](array<int, 4>&x, array<int, 4>&y){return make_pair(x[0], x[0] + x[1]) < make_pair(y[0], y[0] + y[1]);});
    // doit();
    // sort(a.begin(), a.end(), [&](array<int, 4>&x, array<int, 4>&y){return make_pair(x[0], x[0] - x[1]) < make_pair(y[0], y[0] - y[1]);});
    // doit();
    sort(a.begin(), a.end(), [&](array<int, 4>&x, array<int, 4>&y){return x[0] + x[1] < y[0] + y[1];});
    doit();
    // sort(a.begin(), a.end(), [&](array<int, 4>&x, array<int, 4>&y){return x[0] < y[0];});
    // doit();
    // sort(a.begin(), a.end(), [&](array<int, 4>&x, array<int, 4>&y){return x[0] - x[1] < y[0] - y[1];});
    // doit();
    // sort(a.begin(), a.end(), [&](array<int, 4>&x, array<int, 4>&y){return x[1] < y[1];});
    // doit();

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

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 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 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct

Subtask #2
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 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 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 68 ms 316 KB Output is correct
27 Correct 77 ms 212 KB Output is correct

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 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 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 68 ms 316 KB Output is correct
27 Correct 77 ms 212 KB Output is correct
28 Correct 7 ms 340 KB Output is correct
29 Correct 7 ms 340 KB Output is correct
30 Correct 11 ms 448 KB Output is correct
31 Correct 10 ms 456 KB Output is correct
32 Correct 7 ms 340 KB Output is correct
33 Correct 10 ms 444 KB Output is correct
34 Correct 7 ms 340 KB Output is correct
35 Correct 7 ms 340 KB Output is correct
36 Correct 7 ms 460 KB Output is correct
37 Correct 6 ms 340 KB Output is correct
38 Correct 10 ms 448 KB Output is correct
39 Correct 7 ms 340 KB Output is correct

Subtask #4
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 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 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 68 ms 316 KB Output is correct
27 Correct 77 ms 212 KB Output is correct
28 Correct 7 ms 340 KB Output is correct
29 Correct 7 ms 340 KB Output is correct
30 Correct 11 ms 448 KB Output is correct
31 Correct 10 ms 456 KB Output is correct
32 Correct 7 ms 340 KB Output is correct
33 Correct 10 ms 444 KB Output is correct
34 Correct 7 ms 340 KB Output is correct
35 Correct 7 ms 340 KB Output is correct
36 Correct 7 ms 460 KB Output is correct
37 Correct 6 ms 340 KB Output is correct
38 Correct 10 ms 448 KB Output is correct
39 Correct 7 ms 340 KB Output is correct
40 Correct 5427 ms 8152 KB Output is correct
41 Correct 5354 ms 8912 KB Output is correct
42 Correct 5287 ms 8912 KB Output is correct
43 Correct 5251 ms 8916 KB Output is correct
44 Correct 5283 ms 8916 KB Output is correct
45 Correct 5217 ms 8920 KB Output is correct
46 Correct 4780 ms 8764 KB Output is correct
47 Correct 4775 ms 8764 KB Output is correct
48 Correct 4840 ms 8784 KB Output is correct
49 Correct 4154 ms 5776 KB Output is correct
50 Correct 4106 ms 5784 KB Output is correct
51 Correct 4465 ms 5776 KB Output is correct

Subtask #5
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 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 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 68 ms 316 KB Output is correct
27 Correct 77 ms 212 KB Output is correct
28 Correct 7 ms 340 KB Output is correct
29 Correct 7 ms 340 KB Output is correct
30 Correct 11 ms 448 KB Output is correct
31 Correct 10 ms 456 KB Output is correct
32 Correct 7 ms 340 KB Output is correct
33 Correct 10 ms 444 KB Output is correct
34 Correct 7 ms 340 KB Output is correct
35 Correct 7 ms 340 KB Output is correct
36 Correct 7 ms 460 KB Output is correct
37 Correct 6 ms 340 KB Output is correct
38 Correct 10 ms 448 KB Output is correct
39 Correct 7 ms 340 KB Output is correct
40 Correct 5427 ms 8152 KB Output is correct
41 Correct 5354 ms 8912 KB Output is correct
42 Correct 5287 ms 8912 KB Output is correct
43 Correct 5251 ms 8916 KB Output is correct
44 Correct 5283 ms 8916 KB Output is correct
45 Correct 5217 ms 8920 KB Output is correct
46 Correct 4780 ms 8764 KB Output is correct
47 Correct 4775 ms 8764 KB Output is correct
48 Correct 4840 ms 8784 KB Output is correct
49 Correct 4154 ms 5776 KB Output is correct
50 Correct 4106 ms 5784 KB Output is correct
51 Correct 4465 ms 5776 KB Output is correct
52 Incorrect 5896 ms 8912 KB Output isn't correct
53 Halted 0 ms 0 KB -