oj.uz

Submission #907230

# Submission time Handle Problem Language Result Execution time Memory
907230 2024-01-15T09:50:47 Z bachhoangxuan Rope (JOI17_rope) C++17
80 / 100
 2500 ms 142692 KB 
// Judges with GCC >= 12 only needs Ofast
// #pragma GCC optimize("O3,no-stack-protector,fast-math,unroll-loops,tree-vectorize")
// MLE optimization
// #pragma GCC optimize("conserve-stack")
// Old judges
// #pragma GCC target("sse4.2,popcnt,lzcnt,abm,mmx,fma,bmi,bmi2")
// New judges. Test with assert(__builtin_cpu_supports("avx2"));
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma,tune=native")
// Atcoder
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma")
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
- insert(x),erase(x)
- find_by_order(k): return iterator to the k-th smallest element
- order_of_key(x): the number of elements that are strictly smaller
*/

#include<bits/stdc++.h>
using namespace std;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
uniform_real_distribution<> pp(0.0,1.0);
#define int long long
#define ld long double
#define pii pair<int,int>
#define piii pair<int,pii>
#define mpp make_pair
#define fi first
#define se second
const int inf=1e18;
const int mod=998244353;
const int maxn=1000005;
const int bl=650;
const int maxs=655;
const int maxm=200005;
const int maxq=1000005;
const int maxl=25;
const int maxa=1000000;
const int root=3;
int power(int a,int n){
    int res=1;
    while(n){
        if(n&1) res=res*a%mod;
        a=a*a%mod;n>>=1;
    }
    return res;
}
const int iroot=power(3,mod-2);
const int base=131;

int n,m,c[maxn],num[maxn];
vector<int> pos[maxn];

void solve(){
    cin >> n >> m;
    for(int i=0;i<n;i++) cin >> c[i],pos[c[i]].push_back(i);
    set<pii> s;
    for(int i=1;i<=m;i++){
        num[i]=(int)pos[i].size();
        s.insert({num[i],i});
    }
    auto add = [&](int x,int val){
        s.erase({num[x],x});
        num[x]+=val;
        s.insert({num[x],x});
    };
    for(int i=1;i<=m;i++){
        int res=0,cnt=num[i];
        add(i,-cnt);
        {//Even
            for(int x:pos[i]) if((x^1)<n && c[x^1]!=i) add(c[x^1],-1);
            res=max(res,cnt+s.rbegin()->fi);
            for(int x:pos[i]) if((x^1)<n && c[x^1]!=i) add(c[x^1],1);
        }
        {//Odd
            for(int x:pos[i]){
                int y=((x+1)^1)-1;
                if(y<n && y>=0 && c[y]!=i) add(c[y],-1);
            }
            res=max(res,cnt+s.rbegin()->fi);
            for(int x:pos[i]){
                int y=((x+1)^1)-1;
                if(y<n && y>=0 && c[y]!=i) add(c[y],1);
            }
        }
        add(i,cnt);
        cout << n-res << '\n';
    }
}

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);cout.tie(NULL);
    int test=1;//cin >> test;
    while(test--) solve();
}

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 29280 KB Output is correct
2 Correct 10 ms 29332 KB Output is correct
3 Correct 9 ms 29276 KB Output is correct
4 Correct 10 ms 29268 KB Output is correct
5 Correct 9 ms 29276 KB Output is correct
6 Correct 10 ms 29332 KB Output is correct
7 Correct 11 ms 29340 KB Output is correct
8 Correct 10 ms 29532 KB Output is correct
9 Correct 10 ms 29276 KB Output is correct
10 Correct 10 ms 29276 KB Output is correct
11 Correct 10 ms 29340 KB Output is correct
12 Correct 8 ms 29340 KB Output is correct
13 Correct 10 ms 29276 KB Output is correct
14 Correct 8 ms 29276 KB Output is correct
15 Correct 9 ms 29276 KB Output is correct
16 Correct 9 ms 29276 KB Output is correct
17 Correct 9 ms 29272 KB Output is correct
18 Correct 9 ms 29276 KB Output is correct
19 Correct 9 ms 29276 KB Output is correct
20 Correct 9 ms 29340 KB Output is correct
21 Correct 9 ms 29276 KB Output is correct
22 Correct 9 ms 29304 KB Output is correct
23 Correct 9 ms 29348 KB Output is correct
24 Correct 9 ms 29288 KB Output is correct
25 Correct 8 ms 29352 KB Output is correct
26 Correct 9 ms 29288 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 29280 KB Output is correct
2 Correct 10 ms 29332 KB Output is correct
3 Correct 9 ms 29276 KB Output is correct
4 Correct 10 ms 29268 KB Output is correct
5 Correct 9 ms 29276 KB Output is correct
6 Correct 10 ms 29332 KB Output is correct
7 Correct 11 ms 29340 KB Output is correct
8 Correct 10 ms 29532 KB Output is correct
9 Correct 10 ms 29276 KB Output is correct
10 Correct 10 ms 29276 KB Output is correct
11 Correct 10 ms 29340 KB Output is correct
12 Correct 8 ms 29340 KB Output is correct
13 Correct 10 ms 29276 KB Output is correct
14 Correct 8 ms 29276 KB Output is correct
15 Correct 9 ms 29276 KB Output is correct
16 Correct 9 ms 29276 KB Output is correct
17 Correct 9 ms 29272 KB Output is correct
18 Correct 9 ms 29276 KB Output is correct
19 Correct 9 ms 29276 KB Output is correct
20 Correct 9 ms 29340 KB Output is correct
21 Correct 9 ms 29276 KB Output is correct
22 Correct 9 ms 29304 KB Output is correct
23 Correct 9 ms 29348 KB Output is correct
24 Correct 9 ms 29288 KB Output is correct
25 Correct 8 ms 29352 KB Output is correct
26 Correct 9 ms 29288 KB Output is correct
27 Correct 46 ms 30684 KB Output is correct
28 Correct 33 ms 30424 KB Output is correct
29 Correct 43 ms 30568 KB Output is correct
30 Correct 33 ms 30440 KB Output is correct
31 Correct 45 ms 30820 KB Output is correct
32 Correct 31 ms 30476 KB Output is correct
33 Correct 51 ms 30676 KB Output is correct
34 Correct 36 ms 30456 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 29280 KB Output is correct
2 Correct 10 ms 29332 KB Output is correct
3 Correct 9 ms 29276 KB Output is correct
4 Correct 10 ms 29268 KB Output is correct
5 Correct 9 ms 29276 KB Output is correct
6 Correct 10 ms 29332 KB Output is correct
7 Correct 11 ms 29340 KB Output is correct
8 Correct 10 ms 29532 KB Output is correct
9 Correct 10 ms 29276 KB Output is correct
10 Correct 10 ms 29276 KB Output is correct
11 Correct 10 ms 29340 KB Output is correct
12 Correct 8 ms 29340 KB Output is correct
13 Correct 10 ms 29276 KB Output is correct
14 Correct 8 ms 29276 KB Output is correct
15 Correct 9 ms 29276 KB Output is correct
16 Correct 9 ms 29276 KB Output is correct
17 Correct 9 ms 29272 KB Output is correct
18 Correct 9 ms 29276 KB Output is correct
19 Correct 9 ms 29276 KB Output is correct
20 Correct 9 ms 29340 KB Output is correct
21 Correct 9 ms 29276 KB Output is correct
22 Correct 9 ms 29304 KB Output is correct
23 Correct 9 ms 29348 KB Output is correct
24 Correct 9 ms 29288 KB Output is correct
25 Correct 8 ms 29352 KB Output is correct
26 Correct 9 ms 29288 KB Output is correct
27 Correct 46 ms 30684 KB Output is correct
28 Correct 33 ms 30424 KB Output is correct
29 Correct 43 ms 30568 KB Output is correct
30 Correct 33 ms 30440 KB Output is correct
31 Correct 45 ms 30820 KB Output is correct
32 Correct 31 ms 30476 KB Output is correct
33 Correct 51 ms 30676 KB Output is correct
34 Correct 36 ms 30456 KB Output is correct
35 Correct 102 ms 30812 KB Output is correct
36 Correct 107 ms 30852 KB Output is correct
37 Correct 107 ms 30812 KB Output is correct
38 Correct 102 ms 30812 KB Output is correct
39 Correct 104 ms 30840 KB Output is correct
40 Correct 86 ms 31004 KB Output is correct
41 Correct 87 ms 30812 KB Output is correct
42 Correct 86 ms 30940 KB Output is correct
43 Correct 86 ms 31012 KB Output is correct
44 Correct 97 ms 30968 KB Output is correct
45 Correct 95 ms 30812 KB Output is correct
46 Correct 88 ms 30812 KB Output is correct
47 Correct 89 ms 30812 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 29280 KB Output is correct
2 Correct 10 ms 29332 KB Output is correct
3 Correct 9 ms 29276 KB Output is correct
4 Correct 10 ms 29268 KB Output is correct
5 Correct 9 ms 29276 KB Output is correct
6 Correct 10 ms 29332 KB Output is correct
7 Correct 11 ms 29340 KB Output is correct
8 Correct 10 ms 29532 KB Output is correct
9 Correct 10 ms 29276 KB Output is correct
10 Correct 10 ms 29276 KB Output is correct
11 Correct 10 ms 29340 KB Output is correct
12 Correct 8 ms 29340 KB Output is correct
13 Correct 10 ms 29276 KB Output is correct
14 Correct 8 ms 29276 KB Output is correct
15 Correct 9 ms 29276 KB Output is correct
16 Correct 9 ms 29276 KB Output is correct
17 Correct 9 ms 29272 KB Output is correct
18 Correct 9 ms 29276 KB Output is correct
19 Correct 9 ms 29276 KB Output is correct
20 Correct 9 ms 29340 KB Output is correct
21 Correct 9 ms 29276 KB Output is correct
22 Correct 9 ms 29304 KB Output is correct
23 Correct 9 ms 29348 KB Output is correct
24 Correct 9 ms 29288 KB Output is correct
25 Correct 8 ms 29352 KB Output is correct
26 Correct 9 ms 29288 KB Output is correct
27 Correct 46 ms 30684 KB Output is correct
28 Correct 33 ms 30424 KB Output is correct
29 Correct 43 ms 30568 KB Output is correct
30 Correct 33 ms 30440 KB Output is correct
31 Correct 45 ms 30820 KB Output is correct
32 Correct 31 ms 30476 KB Output is correct
33 Correct 51 ms 30676 KB Output is correct
34 Correct 36 ms 30456 KB Output is correct
35 Correct 102 ms 30812 KB Output is correct
36 Correct 107 ms 30852 KB Output is correct
37 Correct 107 ms 30812 KB Output is correct
38 Correct 102 ms 30812 KB Output is correct
39 Correct 104 ms 30840 KB Output is correct
40 Correct 86 ms 31004 KB Output is correct
41 Correct 87 ms 30812 KB Output is correct
42 Correct 86 ms 30940 KB Output is correct
43 Correct 86 ms 31012 KB Output is correct
44 Correct 97 ms 30968 KB Output is correct
45 Correct 95 ms 30812 KB Output is correct
46 Correct 88 ms 30812 KB Output is correct
47 Correct 89 ms 30812 KB Output is correct
48 Correct 1304 ms 51196 KB Output is correct
49 Correct 1259 ms 51216 KB Output is correct
50 Correct 1252 ms 51468 KB Output is correct
51 Correct 1068 ms 50772 KB Output is correct
52 Correct 1025 ms 48252 KB Output is correct
53 Correct 979 ms 49656 KB Output is correct
54 Correct 956 ms 47724 KB Output is correct
55 Correct 935 ms 47196 KB Output is correct
56 Correct 902 ms 46944 KB Output is correct

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 29280 KB Output is correct
2 Correct 10 ms 29332 KB Output is correct
3 Correct 9 ms 29276 KB Output is correct
4 Correct 10 ms 29268 KB Output is correct
5 Correct 9 ms 29276 KB Output is correct
6 Correct 10 ms 29332 KB Output is correct
7 Correct 11 ms 29340 KB Output is correct
8 Correct 10 ms 29532 KB Output is correct
9 Correct 10 ms 29276 KB Output is correct
10 Correct 10 ms 29276 KB Output is correct
11 Correct 10 ms 29340 KB Output is correct
12 Correct 8 ms 29340 KB Output is correct
13 Correct 10 ms 29276 KB Output is correct
14 Correct 8 ms 29276 KB Output is correct
15 Correct 9 ms 29276 KB Output is correct
16 Correct 9 ms 29276 KB Output is correct
17 Correct 9 ms 29272 KB Output is correct
18 Correct 9 ms 29276 KB Output is correct
19 Correct 9 ms 29276 KB Output is correct
20 Correct 9 ms 29340 KB Output is correct
21 Correct 9 ms 29276 KB Output is correct
22 Correct 9 ms 29304 KB Output is correct
23 Correct 9 ms 29348 KB Output is correct
24 Correct 9 ms 29288 KB Output is correct
25 Correct 8 ms 29352 KB Output is correct
26 Correct 9 ms 29288 KB Output is correct
27 Correct 46 ms 30684 KB Output is correct
28 Correct 33 ms 30424 KB Output is correct
29 Correct 43 ms 30568 KB Output is correct
30 Correct 33 ms 30440 KB Output is correct
31 Correct 45 ms 30820 KB Output is correct
32 Correct 31 ms 30476 KB Output is correct
33 Correct 51 ms 30676 KB Output is correct
34 Correct 36 ms 30456 KB Output is correct
35 Correct 102 ms 30812 KB Output is correct
36 Correct 107 ms 30852 KB Output is correct
37 Correct 107 ms 30812 KB Output is correct
38 Correct 102 ms 30812 KB Output is correct
39 Correct 104 ms 30840 KB Output is correct
40 Correct 86 ms 31004 KB Output is correct
41 Correct 87 ms 30812 KB Output is correct
42 Correct 86 ms 30940 KB Output is correct
43 Correct 86 ms 31012 KB Output is correct
44 Correct 97 ms 30968 KB Output is correct
45 Correct 95 ms 30812 KB Output is correct
46 Correct 88 ms 30812 KB Output is correct
47 Correct 89 ms 30812 KB Output is correct
48 Correct 1304 ms 51196 KB Output is correct
49 Correct 1259 ms 51216 KB Output is correct
50 Correct 1252 ms 51468 KB Output is correct
51 Correct 1068 ms 50772 KB Output is correct
52 Correct 1025 ms 48252 KB Output is correct
53 Correct 979 ms 49656 KB Output is correct
54 Correct 956 ms 47724 KB Output is correct
55 Correct 935 ms 47196 KB Output is correct
56 Correct 902 ms 46944 KB Output is correct
57 Execution timed out 2557 ms 142692 KB Time limit exceeded
58 Halted 0 ms 0 KB -