답안 #964791

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
964791	2024-04-17T14:36:46 Z	efedmrlr	Rope (JOI17_rope)	C++17	80 / 100	130 ms	262144 KB

rope

// #pragma GCC optimize("O3,Ofast,unroll-loops")
// #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#include <bits/stdc++.h>

using namespace std;


#define lli long long int
#define MP make_pair
#define pb push_back
#define REP(i,n) for(int i = 0; (i) < (n); (i)++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()


void fastio() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
}


const double EPS = 0.00001;
const int INF = 1e9+500;
const int N = 3e5+5;
const int ALPH = 26;
const int LGN = 25;
constexpr int MOD = 1e9+7;
int n,m,q;
vector<int> a;
vector<int> cnt1, cnt2;
vector<vector<int> > mpp1, mpp2;
inline void solve() {
    cin>>n>>m;
    a.resize(n + 5);
    cnt1.assign(m + 5, 0);
    cnt2.assign(m + 5, 0);
    mpp1.assign(m + 5, vector<int>(m + 5, 0));
    mpp2.assign(m + 5, vector<int>(m + 5, 0));
    for(int i = 1; i<=n; i++) {
        cin >> a[i];
    } 
    for(int i = 1; i<n; i+=2) {
        cnt1[a[i]]++;
        cnt1[a[i + 1]]++;  
        mpp1[min(a[i], a[i + 1])][max(a[i], a[i + 1])]++;

    }
    for(int i = 2; i<n; i+=2) {
        cnt2[a[i]]++;
        cnt2[a[i + 1]]++;  
        mpp2[min(a[i], a[i + 1])][max(a[i], a[i + 1])]++;
        
    }
    vector<int> res(m + 1, INF);
    for(int i = 1; i <= m; i++) {
        for(int j = i + 1; j <= m; j++) {
            int ret = n;
            if((n & 1) && (a[n] == i || a[n] == j)) {
                ret--;
            }
            ret -= cnt1[i] + cnt1[j];
            ret += mpp1[i][j];
            res[i] = min(res[i], ret);
            res[j] = min(res[j], ret);
            ret = n;
            if(!(n & 1) && (a[n] == i || a[n] == j)) {
                ret--;
            }
            if(a[1] == i || a[1] == j) {
                ret--;
            }
            ret -= cnt2[i] + cnt2[j];
            ret += mpp2[i][j];
            res[i] = min(res[i], ret);
            res[j] = min(res[j], ret);
        }
    }
    for(int i = 1; i<=m; i++) {
        int ret = n - cnt1[i];
        if((n & 1) && a[n] == i) ret--;
        res[i] = min(res[i], ret);
        cout << res[i] << "\n"; 
    }
}
 
signed main() {

    fastio();
    int test = 1;
    //cin>>test;
    while(test--) {
        solve();
    }
    
}

Subtask #1
15.0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	348 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	1 ms	344 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	344 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	1 ms	344 KB	Output is correct
13	Correct	1 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	1 ms	348 KB	Output is correct
16	Correct	0 ms	456 KB	Output is correct
17	Correct	1 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	456 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	0 ms	348 KB	Output is correct
23	Correct	1 ms	348 KB	Output is correct
24	Correct	1 ms	348 KB	Output is correct
25	Correct	1 ms	460 KB	Output is correct
26	Correct	1 ms	348 KB	Output is correct

Subtask #2
30.0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	348 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	1 ms	344 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	344 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	1 ms	344 KB	Output is correct
13	Correct	1 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	1 ms	348 KB	Output is correct
16	Correct	0 ms	456 KB	Output is correct
17	Correct	1 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	456 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	0 ms	348 KB	Output is correct
23	Correct	1 ms	348 KB	Output is correct
24	Correct	1 ms	348 KB	Output is correct
25	Correct	1 ms	460 KB	Output is correct
26	Correct	1 ms	348 KB	Output is correct
27	Correct	5 ms	1116 KB	Output is correct
28	Correct	6 ms	860 KB	Output is correct
29	Correct	6 ms	972 KB	Output is correct
30	Correct	5 ms	860 KB	Output is correct
31	Correct	5 ms	940 KB	Output is correct
32	Correct	5 ms	860 KB	Output is correct
33	Correct	5 ms	860 KB	Output is correct
34	Correct	5 ms	860 KB	Output is correct

Subtask #3
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	348 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	1 ms	344 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	344 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	1 ms	344 KB	Output is correct
13	Correct	1 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	1 ms	348 KB	Output is correct
16	Correct	0 ms	456 KB	Output is correct
17	Correct	1 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	456 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	0 ms	348 KB	Output is correct
23	Correct	1 ms	348 KB	Output is correct
24	Correct	1 ms	348 KB	Output is correct
25	Correct	1 ms	460 KB	Output is correct
26	Correct	1 ms	348 KB	Output is correct
27	Correct	5 ms	1116 KB	Output is correct
28	Correct	6 ms	860 KB	Output is correct
29	Correct	6 ms	972 KB	Output is correct
30	Correct	5 ms	860 KB	Output is correct
31	Correct	5 ms	940 KB	Output is correct
32	Correct	5 ms	860 KB	Output is correct
33	Correct	5 ms	860 KB	Output is correct
34	Correct	5 ms	860 KB	Output is correct
35	Correct	7 ms	3160 KB	Output is correct
36	Correct	7 ms	3164 KB	Output is correct
37	Correct	7 ms	2960 KB	Output is correct
38	Correct	7 ms	3160 KB	Output is correct
39	Correct	10 ms	3028 KB	Output is correct
40	Correct	7 ms	3164 KB	Output is correct
41	Correct	8 ms	3160 KB	Output is correct
42	Correct	8 ms	2508 KB	Output is correct
43	Correct	6 ms	1880 KB	Output is correct
44	Correct	7 ms	3216 KB	Output is correct
45	Correct	7 ms	3164 KB	Output is correct
46	Correct	7 ms	2340 KB	Output is correct
47	Correct	6 ms	1884 KB	Output is correct

Subtask #4
25.0 / 25.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	348 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	1 ms	344 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	344 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	1 ms	344 KB	Output is correct
13	Correct	1 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	1 ms	348 KB	Output is correct
16	Correct	0 ms	456 KB	Output is correct
17	Correct	1 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	456 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	0 ms	348 KB	Output is correct
23	Correct	1 ms	348 KB	Output is correct
24	Correct	1 ms	348 KB	Output is correct
25	Correct	1 ms	460 KB	Output is correct
26	Correct	1 ms	348 KB	Output is correct
27	Correct	5 ms	1116 KB	Output is correct
28	Correct	6 ms	860 KB	Output is correct
29	Correct	6 ms	972 KB	Output is correct
30	Correct	5 ms	860 KB	Output is correct
31	Correct	5 ms	940 KB	Output is correct
32	Correct	5 ms	860 KB	Output is correct
33	Correct	5 ms	860 KB	Output is correct
34	Correct	5 ms	860 KB	Output is correct
35	Correct	7 ms	3160 KB	Output is correct
36	Correct	7 ms	3164 KB	Output is correct
37	Correct	7 ms	2960 KB	Output is correct
38	Correct	7 ms	3160 KB	Output is correct
39	Correct	10 ms	3028 KB	Output is correct
40	Correct	7 ms	3164 KB	Output is correct
41	Correct	8 ms	3160 KB	Output is correct
42	Correct	8 ms	2508 KB	Output is correct
43	Correct	6 ms	1880 KB	Output is correct
44	Correct	7 ms	3216 KB	Output is correct
45	Correct	7 ms	3164 KB	Output is correct
46	Correct	7 ms	2340 KB	Output is correct
47	Correct	6 ms	1884 KB	Output is correct
48	Correct	121 ms	79700 KB	Output is correct
49	Correct	130 ms	79696 KB	Output is correct
50	Correct	120 ms	79708 KB	Output is correct
51	Correct	77 ms	26172 KB	Output is correct
52	Correct	63 ms	16064 KB	Output is correct
53	Correct	116 ms	79772 KB	Output is correct
54	Correct	110 ms	79804 KB	Output is correct
55	Correct	110 ms	79756 KB	Output is correct
56	Correct	101 ms	79696 KB	Output is correct

Subtask #5
0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	348 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	1 ms	344 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	344 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	1 ms	344 KB	Output is correct
13	Correct	1 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	1 ms	348 KB	Output is correct
16	Correct	0 ms	456 KB	Output is correct
17	Correct	1 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	456 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	0 ms	348 KB	Output is correct
23	Correct	1 ms	348 KB	Output is correct
24	Correct	1 ms	348 KB	Output is correct
25	Correct	1 ms	460 KB	Output is correct
26	Correct	1 ms	348 KB	Output is correct
27	Correct	5 ms	1116 KB	Output is correct
28	Correct	6 ms	860 KB	Output is correct
29	Correct	6 ms	972 KB	Output is correct
30	Correct	5 ms	860 KB	Output is correct
31	Correct	5 ms	940 KB	Output is correct
32	Correct	5 ms	860 KB	Output is correct
33	Correct	5 ms	860 KB	Output is correct
34	Correct	5 ms	860 KB	Output is correct
35	Correct	7 ms	3160 KB	Output is correct
36	Correct	7 ms	3164 KB	Output is correct
37	Correct	7 ms	2960 KB	Output is correct
38	Correct	7 ms	3160 KB	Output is correct
39	Correct	10 ms	3028 KB	Output is correct
40	Correct	7 ms	3164 KB	Output is correct
41	Correct	8 ms	3160 KB	Output is correct
42	Correct	8 ms	2508 KB	Output is correct
43	Correct	6 ms	1880 KB	Output is correct
44	Correct	7 ms	3216 KB	Output is correct
45	Correct	7 ms	3164 KB	Output is correct
46	Correct	7 ms	2340 KB	Output is correct
47	Correct	6 ms	1884 KB	Output is correct
48	Correct	121 ms	79700 KB	Output is correct
49	Correct	130 ms	79696 KB	Output is correct
50	Correct	120 ms	79708 KB	Output is correct
51	Correct	77 ms	26172 KB	Output is correct
52	Correct	63 ms	16064 KB	Output is correct
53	Correct	116 ms	79772 KB	Output is correct
54	Correct	110 ms	79804 KB	Output is correct
55	Correct	110 ms	79756 KB	Output is correct
56	Correct	101 ms	79696 KB	Output is correct
57	Runtime error	117 ms	262144 KB	Execution killed with signal 9
58	Halted	0 ms	0 KB	-

답안 #964791

Compilation message

Subtask #1 15.0 / 15.0

Subtask #2 30.0 / 30.0

Subtask #3 10.0 / 10.0

Subtask #4 25.0 / 25.0

Subtask #5 0 / 20.0

Subtask #1
15.0 / 15.0

Subtask #2
30.0 / 30.0

Subtask #3
10.0 / 10.0

Subtask #4
25.0 / 25.0

Subtask #5
0 / 20.0