Submission #814333

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
814333	2023-08-08T06:55:52 Z	이동현(#10122)	Arranging Tickets (JOI17_arranging_tickets)	C++17	45 / 100	126 ms	724 KB

arranging_tickets

#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#define int long long
using namespace std;

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

    int L, n;
    cin >> L >> n;
    // L = n = 300;
    vector<array<int, 4>> a(n);
    for(int i = 0; i < n; ++i){
        cin >> a[i][0] >> a[i][1] >> a[i][2];
        --a[i][0], --a[i][1];

        // a[i][2] = 1;
        // a[i][0] = rand() % 300;
        // a[i][1] = rand() % 300;

        assert(a[i][2] == 1);

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

    int ans = (int)1e9;
    auto sol = [&](){
        vector<int> pre(L);
        for(int i = 0; i < n; ++i){
            if(!a[i][3]){
                pre[a[i][0]] += 1;
                pre[a[i][1]] -= 1;
            }
            else{
                pre[a[i][1]] += 1;
                pre[0] += 1;
                pre[a[i][0]] -= 1;
            }
        }

        int nans = 0;
        for(int i = 0; i < L; ++i){
            if(i) pre[i] += pre[i - 1];

            nans = max(nans, pre[i]);
        }

        return nans;
    };

    assert(n <= 300);

    auto doit = [&]{
        for(int i = 0; i < 1; ++i){
            for(int j = i - 1; j < n; ++j){
                for(int k = 0; k < n; ++k){
                    a[k][3] = (i <= k && k <= j);
                }
                
                int nans = sol();
                while(true){
                    int now = nans;

                    for(int i = 0; i < n; ++i){
                        a[i][3] ^= 1;

                        int prv = now;
                        now = min(now, sol());

                        if(now == prv) a[i][3] ^= 1;
                    }

                    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 << '\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	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 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	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	0 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

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 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	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	0 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	111 ms	312 KB	Output is correct
17	Correct	116 ms	328 KB	Output is correct
18	Correct	116 ms	324 KB	Output is correct
19	Correct	119 ms	316 KB	Output is correct
20	Correct	116 ms	320 KB	Output is correct
21	Correct	123 ms	320 KB	Output is correct
22	Correct	117 ms	316 KB	Output is correct
23	Correct	126 ms	316 KB	Output is correct
24	Correct	112 ms	316 KB	Output is correct
25	Correct	112 ms	316 KB	Output is correct
26	Correct	95 ms	212 KB	Output is correct
27	Correct	112 ms	324 KB	Output is correct

Subtask #3
0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 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	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	0 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	111 ms	312 KB	Output is correct
17	Correct	116 ms	328 KB	Output is correct
18	Correct	116 ms	324 KB	Output is correct
19	Correct	119 ms	316 KB	Output is correct
20	Correct	116 ms	320 KB	Output is correct
21	Correct	123 ms	320 KB	Output is correct
22	Correct	117 ms	316 KB	Output is correct
23	Correct	126 ms	316 KB	Output is correct
24	Correct	112 ms	316 KB	Output is correct
25	Correct	112 ms	316 KB	Output is correct
26	Correct	95 ms	212 KB	Output is correct
27	Correct	112 ms	324 KB	Output is correct
28	Runtime error	2 ms	724 KB	Execution killed with signal 6
29	Halted	0 ms	0 KB	-

Subtask #4
0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 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	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	0 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	111 ms	312 KB	Output is correct
17	Correct	116 ms	328 KB	Output is correct
18	Correct	116 ms	324 KB	Output is correct
19	Correct	119 ms	316 KB	Output is correct
20	Correct	116 ms	320 KB	Output is correct
21	Correct	123 ms	320 KB	Output is correct
22	Correct	117 ms	316 KB	Output is correct
23	Correct	126 ms	316 KB	Output is correct
24	Correct	112 ms	316 KB	Output is correct
25	Correct	112 ms	316 KB	Output is correct
26	Correct	95 ms	212 KB	Output is correct
27	Correct	112 ms	324 KB	Output is correct
28	Runtime error	2 ms	724 KB	Execution killed with signal 6
29	Halted	0 ms	0 KB	-

Subtask #5
0 / 15.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 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	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	0 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	111 ms	312 KB	Output is correct
17	Correct	116 ms	328 KB	Output is correct
18	Correct	116 ms	324 KB	Output is correct
19	Correct	119 ms	316 KB	Output is correct
20	Correct	116 ms	320 KB	Output is correct
21	Correct	123 ms	320 KB	Output is correct
22	Correct	117 ms	316 KB	Output is correct
23	Correct	126 ms	316 KB	Output is correct
24	Correct	112 ms	316 KB	Output is correct
25	Correct	112 ms	316 KB	Output is correct
26	Correct	95 ms	212 KB	Output is correct
27	Correct	112 ms	324 KB	Output is correct
28	Runtime error	2 ms	724 KB	Execution killed with signal 6
29	Halted	0 ms	0 KB	-

Submission #814333

Compilation message

Subtask #1 10.0 / 10.0

Subtask #2 35.0 / 35.0

Subtask #3 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
0 / 20.0

Subtask #4
0 / 20.0

Subtask #5
0 / 15.0