oj.uz

답안 #964802

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
964802 2024-04-17T15:07:27 Z efedmrlr Rope (JOI17_rope) C++17
80 / 100
 2500 ms 174108 KB 
// #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> cnt;
vector<vector<int> > pr1, pr2;
set<array<int,2> > st;

void upd(int ind, int val, bool f) {
    if(!f) {
        auto tmp = st.lower_bound({cnt[ind], ind});
        st.erase(tmp);
        cnt[ind] += val;
        st.insert({cnt[ind], ind});

    }
    else {
        auto tmp = st.lower_bound({cnt[ind], ind});
        st.erase(tmp);
        cnt[ind] += val;
        st.insert({cnt[ind], ind});
        
    }
}


inline void solve() {
    cin>>n>>m;
    a.resize(n + 5);
    cnt.assign(m + 5, 0);
    pr1.assign(m + 5, vector<int>());
    pr2.assign(m + 5, vector<int>());
    st.insert({0, 0});
    for(int i = 1; i<=n; i++) {
        cin >> a[i];
    } 
    for(int i = 1; i<=n; i++) {
        cnt[a[i]]++;
    }
    for(int i = 1; i<n; i+=2) {
        if(a[i] == a[i + 1]) continue;
        pr1[a[i]].pb(a[i + 1]);
        pr1[a[i + 1]].pb(a[i]);
    }
    for(int i = 2; i<n; i+=2) {
        if(a[i] == a[i + 1]) continue; 
        pr2[a[i]].pb(a[i + 1]);
        pr2[a[i + 1]].pb(a[i]);
        
    }
    for(int i = 1; i<=m; i++) {
        st.insert({cnt[i], i});
    }
    vector<int> res(m + 1, INF);
    for(int i = 1; i<=m; i++) {
        res[i] = n - cnt[i];
    }
    
    for(int i = 1; i<=m; i++) {
        // Case 1
        for(auto c : pr1[i]) {
            upd(c, -1, 0);
        }
        st.erase({cnt[i], i});
        res[i] = min(res[i], n - (cnt[i] + (*prev(st.end()))[0]));

        for(auto c : pr1[i]) {
            upd(c, 1, 0);
        }

        // Case 2
        for(auto c : pr2[i]) {
            upd(c, -1, 1);
        }
        res[i] = min(res[i], n - (cnt[i] + (*prev(st.end()))[0]));
        st.insert({cnt[i], i});
        for(auto c : pr2[i]) {
            upd(c, 1, 1);
        }
    }
    for(int i = 1; i<=m; i++) {
        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 0 ms 348 KB Output is correct
2 Correct 1 ms 676 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 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 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 360 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 344 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct

Subtask #2
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 676 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 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 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 360 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 344 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 33 ms 2136 KB Output is correct
28 Correct 23 ms 1984 KB Output is correct
29 Correct 30 ms 1880 KB Output is correct
30 Correct 23 ms 1876 KB Output is correct
31 Correct 32 ms 2136 KB Output is correct
32 Correct 21 ms 1884 KB Output is correct
33 Correct 31 ms 1880 KB Output is correct
34 Correct 23 ms 1796 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 676 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 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 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 360 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 344 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 33 ms 2136 KB Output is correct
28 Correct 23 ms 1984 KB Output is correct
29 Correct 30 ms 1880 KB Output is correct
30 Correct 23 ms 1876 KB Output is correct
31 Correct 32 ms 2136 KB Output is correct
32 Correct 21 ms 1884 KB Output is correct
33 Correct 31 ms 1880 KB Output is correct
34 Correct 23 ms 1796 KB Output is correct
35 Correct 92 ms 2364 KB Output is correct
36 Correct 87 ms 2376 KB Output is correct
37 Correct 86 ms 2332 KB Output is correct
38 Correct 90 ms 2140 KB Output is correct
39 Correct 97 ms 2360 KB Output is correct
40 Correct 75 ms 2532 KB Output is correct
41 Correct 85 ms 2540 KB Output is correct
42 Correct 76 ms 2264 KB Output is correct
43 Correct 79 ms 2392 KB Output is correct
44 Correct 81 ms 2520 KB Output is correct
45 Correct 77 ms 2396 KB Output is correct
46 Correct 75 ms 2648 KB Output is correct
47 Correct 81 ms 2392 KB Output is correct

Subtask #4
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 676 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 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 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 360 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 344 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 33 ms 2136 KB Output is correct
28 Correct 23 ms 1984 KB Output is correct
29 Correct 30 ms 1880 KB Output is correct
30 Correct 23 ms 1876 KB Output is correct
31 Correct 32 ms 2136 KB Output is correct
32 Correct 21 ms 1884 KB Output is correct
33 Correct 31 ms 1880 KB Output is correct
34 Correct 23 ms 1796 KB Output is correct
35 Correct 92 ms 2364 KB Output is correct
36 Correct 87 ms 2376 KB Output is correct
37 Correct 86 ms 2332 KB Output is correct
38 Correct 90 ms 2140 KB Output is correct
39 Correct 97 ms 2360 KB Output is correct
40 Correct 75 ms 2532 KB Output is correct
41 Correct 85 ms 2540 KB Output is correct
42 Correct 76 ms 2264 KB Output is correct
43 Correct 79 ms 2392 KB Output is correct
44 Correct 81 ms 2520 KB Output is correct
45 Correct 77 ms 2396 KB Output is correct
46 Correct 75 ms 2648 KB Output is correct
47 Correct 81 ms 2392 KB Output is correct
48 Correct 1103 ms 22044 KB Output is correct
49 Correct 1125 ms 22044 KB Output is correct
50 Correct 1123 ms 22060 KB Output is correct
51 Correct 1032 ms 21624 KB Output is correct
52 Correct 969 ms 18740 KB Output is correct
53 Correct 971 ms 20400 KB Output is correct
54 Correct 953 ms 18460 KB Output is correct
55 Correct 940 ms 18124 KB Output is correct
56 Correct 914 ms 17636 KB Output is correct

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 676 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 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 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 360 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 344 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 33 ms 2136 KB Output is correct
28 Correct 23 ms 1984 KB Output is correct
29 Correct 30 ms 1880 KB Output is correct
30 Correct 23 ms 1876 KB Output is correct
31 Correct 32 ms 2136 KB Output is correct
32 Correct 21 ms 1884 KB Output is correct
33 Correct 31 ms 1880 KB Output is correct
34 Correct 23 ms 1796 KB Output is correct
35 Correct 92 ms 2364 KB Output is correct
36 Correct 87 ms 2376 KB Output is correct
37 Correct 86 ms 2332 KB Output is correct
38 Correct 90 ms 2140 KB Output is correct
39 Correct 97 ms 2360 KB Output is correct
40 Correct 75 ms 2532 KB Output is correct
41 Correct 85 ms 2540 KB Output is correct
42 Correct 76 ms 2264 KB Output is correct
43 Correct 79 ms 2392 KB Output is correct
44 Correct 81 ms 2520 KB Output is correct
45 Correct 77 ms 2396 KB Output is correct
46 Correct 75 ms 2648 KB Output is correct
47 Correct 81 ms 2392 KB Output is correct
48 Correct 1103 ms 22044 KB Output is correct
49 Correct 1125 ms 22044 KB Output is correct
50 Correct 1123 ms 22060 KB Output is correct
51 Correct 1032 ms 21624 KB Output is correct
52 Correct 969 ms 18740 KB Output is correct
53 Correct 971 ms 20400 KB Output is correct
54 Correct 953 ms 18460 KB Output is correct
55 Correct 940 ms 18124 KB Output is correct
56 Correct 914 ms 17636 KB Output is correct
57 Execution timed out 2541 ms 174108 KB Time limit exceeded
58 Halted 0 ms 0 KB -