oj.uz

Submission #200888

# Submission time Handle Problem Language Result Execution time Memory
200888 2020-02-08T11:43:00 Z balbit Rope (JOI17_rope) C++11
100 / 100
 1008 ms 89820 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int, int>
#define ull unsigned ll
#define f first
#define s second
#define FOR(i,a,b) for (int i=(a); i<(b); ++i)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) for (int i=(n-1); i>=0; --i)
#define REP1(i,n) FOR(i,1,n+1)
#define ALL(x) x.begin(),x.end()
#define SZ(x) (int)x.size()
#define SQ(x) (x)*(x)
#define MN(a,b) a = min(a,(__typeof__(a))(b))
#define MX(a,b) a = max(a,(__typeof__(a))(b))
#define pb push_back
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#ifdef BALBIT
#define IOS()
#define bug(...) fprintf(stderr,"#%d (%s) = ",__LINE__,#__VA_ARGS__),_do(__VA_ARGS__);
template<typename T> void _do(T &&x){cerr<<x<<endl;}
template<typename T, typename ...S> void _do(T &&x, S &&...y){cerr<<x<<", ";_do(y...);}
#else
#define IOS() ios_base::sync_with_stdio(0);cin.tie(0);
#define endl '\n'
#define bug(...)
#endif

const int iinf = 1<<29;
const ll inf = 1ll<<60;
const ll mod = 1e9+7;


void GG(){cout<<"-1\n"; exit(0);}

ll mpow(ll a, ll n, ll mo = mod){ // a^n % mod
    ll re=1;
    while (n>0){
        if (n&1) re = re*a %mo;
        a = a*a %mo;
        n>>=1;
    }
    return re;
}

ll inv (ll b){
    return b==1?1:(mod-mod/b) * inv(mod%b) % mod;
}

const int maxn = 1e6+5;

int ans[maxn];
int t1[maxn], t2[maxn];
int nof[maxn], A[maxn];
vector<int> pos[maxn]; // Where each of you are

signed main(){
    IOS();
    int n;cin>>n;
    int m; cin>>m;
    REP(i,n) {
        cin>>A[i];
        A[i]--;
        nof[A[i]]++;
        pos[A[i]].pb(i);
    }
    vector<pii> vn;
    REP(i,m){
        vn.pb({nof[i],i});
    }
    sort(ALL(vn),greater<pii>());
    bug(m);
//    return 0;
    REP(i,m){
        bug("HI");
        for (int j : pos[i]){
            if (j&1){
                if(j) t1[A[j-1]]++;
                if(j<n-1)t2[A[j+1]]++;
            }else{
                if(j) t2[A[j-1]]++;
                if(j<n-1)t1[A[j+1]]++;
            }
        }
//        REP(j,3){
//            bug(t1[j],t2[j]);
//        }
        ans[i] = n-nof[i];
        REP(it, m){
            int j = vn[it].s;
            if (j == i) continue;
            if (t1[j] && t2[j]) {
                MN(ans[i],n-nof[i]-nof[j]+min(t1[j],t2[j]));
            }else{
                MN(ans[i],n-nof[i]-nof[j]); break;
            }
        }

        for (int j : pos[i]){
            if (j&1){
                if(j) t1[A[j-1]]--;
                if(j<n-1)t2[A[j+1]]--;
            }else{
                if(j) t2[A[j-1]]--;
                if(j<n-1)t1[A[j+1]]--;
            }
        }
//        REP(j,3){
//            bug(t1[j],t2[j]);
//        }
        cout<<ans[i]<<endl;
    }
    // Check your array bounds!
    // Think about corner cases (smallest or biggest?)
}

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 23928 KB Output is correct
2 Correct 18 ms 23804 KB Output is correct
3 Correct 19 ms 23900 KB Output is correct
4 Correct 18 ms 23928 KB Output is correct
5 Correct 19 ms 23800 KB Output is correct
6 Correct 18 ms 23800 KB Output is correct
7 Correct 20 ms 23800 KB Output is correct
8 Correct 18 ms 23800 KB Output is correct
9 Correct 19 ms 23932 KB Output is correct
10 Correct 18 ms 23800 KB Output is correct
11 Correct 18 ms 23800 KB Output is correct
12 Correct 18 ms 23800 KB Output is correct
13 Correct 18 ms 23800 KB Output is correct
14 Correct 18 ms 23800 KB Output is correct
15 Correct 18 ms 23928 KB Output is correct
16 Correct 18 ms 23800 KB Output is correct
17 Correct 18 ms 23932 KB Output is correct
18 Correct 18 ms 23800 KB Output is correct
19 Correct 19 ms 23800 KB Output is correct
20 Correct 18 ms 23804 KB Output is correct
21 Correct 18 ms 23800 KB Output is correct
22 Correct 18 ms 23800 KB Output is correct
23 Correct 18 ms 23800 KB Output is correct
24 Correct 20 ms 23800 KB Output is correct
25 Correct 18 ms 23800 KB Output is correct
26 Correct 18 ms 23800 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 23928 KB Output is correct
2 Correct 18 ms 23804 KB Output is correct
3 Correct 19 ms 23900 KB Output is correct
4 Correct 18 ms 23928 KB Output is correct
5 Correct 19 ms 23800 KB Output is correct
6 Correct 18 ms 23800 KB Output is correct
7 Correct 20 ms 23800 KB Output is correct
8 Correct 18 ms 23800 KB Output is correct
9 Correct 19 ms 23932 KB Output is correct
10 Correct 18 ms 23800 KB Output is correct
11 Correct 18 ms 23800 KB Output is correct
12 Correct 18 ms 23800 KB Output is correct
13 Correct 18 ms 23800 KB Output is correct
14 Correct 18 ms 23800 KB Output is correct
15 Correct 18 ms 23928 KB Output is correct
16 Correct 18 ms 23800 KB Output is correct
17 Correct 18 ms 23932 KB Output is correct
18 Correct 18 ms 23800 KB Output is correct
19 Correct 19 ms 23800 KB Output is correct
20 Correct 18 ms 23804 KB Output is correct
21 Correct 18 ms 23800 KB Output is correct
22 Correct 18 ms 23800 KB Output is correct
23 Correct 18 ms 23800 KB Output is correct
24 Correct 20 ms 23800 KB Output is correct
25 Correct 18 ms 23800 KB Output is correct
26 Correct 18 ms 23800 KB Output is correct
27 Correct 31 ms 24952 KB Output is correct
28 Correct 27 ms 24824 KB Output is correct
29 Correct 27 ms 24824 KB Output is correct
30 Correct 27 ms 24896 KB Output is correct
31 Correct 28 ms 24952 KB Output is correct
32 Correct 29 ms 24952 KB Output is correct
33 Correct 29 ms 24824 KB Output is correct
34 Correct 27 ms 24824 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 23928 KB Output is correct
2 Correct 18 ms 23804 KB Output is correct
3 Correct 19 ms 23900 KB Output is correct
4 Correct 18 ms 23928 KB Output is correct
5 Correct 19 ms 23800 KB Output is correct
6 Correct 18 ms 23800 KB Output is correct
7 Correct 20 ms 23800 KB Output is correct
8 Correct 18 ms 23800 KB Output is correct
9 Correct 19 ms 23932 KB Output is correct
10 Correct 18 ms 23800 KB Output is correct
11 Correct 18 ms 23800 KB Output is correct
12 Correct 18 ms 23800 KB Output is correct
13 Correct 18 ms 23800 KB Output is correct
14 Correct 18 ms 23800 KB Output is correct
15 Correct 18 ms 23928 KB Output is correct
16 Correct 18 ms 23800 KB Output is correct
17 Correct 18 ms 23932 KB Output is correct
18 Correct 18 ms 23800 KB Output is correct
19 Correct 19 ms 23800 KB Output is correct
20 Correct 18 ms 23804 KB Output is correct
21 Correct 18 ms 23800 KB Output is correct
22 Correct 18 ms 23800 KB Output is correct
23 Correct 18 ms 23800 KB Output is correct
24 Correct 20 ms 23800 KB Output is correct
25 Correct 18 ms 23800 KB Output is correct
26 Correct 18 ms 23800 KB Output is correct
27 Correct 31 ms 24952 KB Output is correct
28 Correct 27 ms 24824 KB Output is correct
29 Correct 27 ms 24824 KB Output is correct
30 Correct 27 ms 24896 KB Output is correct
31 Correct 28 ms 24952 KB Output is correct
32 Correct 29 ms 24952 KB Output is correct
33 Correct 29 ms 24824 KB Output is correct
34 Correct 27 ms 24824 KB Output is correct
35 Correct 32 ms 24856 KB Output is correct
36 Correct 30 ms 24824 KB Output is correct
37 Correct 31 ms 24824 KB Output is correct
38 Correct 31 ms 24824 KB Output is correct
39 Correct 30 ms 24824 KB Output is correct
40 Correct 31 ms 24952 KB Output is correct
41 Correct 30 ms 24952 KB Output is correct
42 Correct 30 ms 24952 KB Output is correct
43 Correct 31 ms 24952 KB Output is correct
44 Correct 31 ms 24824 KB Output is correct
45 Correct 29 ms 24952 KB Output is correct
46 Correct 30 ms 24824 KB Output is correct
47 Correct 30 ms 24828 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 23928 KB Output is correct
2 Correct 18 ms 23804 KB Output is correct
3 Correct 19 ms 23900 KB Output is correct
4 Correct 18 ms 23928 KB Output is correct
5 Correct 19 ms 23800 KB Output is correct
6 Correct 18 ms 23800 KB Output is correct
7 Correct 20 ms 23800 KB Output is correct
8 Correct 18 ms 23800 KB Output is correct
9 Correct 19 ms 23932 KB Output is correct
10 Correct 18 ms 23800 KB Output is correct
11 Correct 18 ms 23800 KB Output is correct
12 Correct 18 ms 23800 KB Output is correct
13 Correct 18 ms 23800 KB Output is correct
14 Correct 18 ms 23800 KB Output is correct
15 Correct 18 ms 23928 KB Output is correct
16 Correct 18 ms 23800 KB Output is correct
17 Correct 18 ms 23932 KB Output is correct
18 Correct 18 ms 23800 KB Output is correct
19 Correct 19 ms 23800 KB Output is correct
20 Correct 18 ms 23804 KB Output is correct
21 Correct 18 ms 23800 KB Output is correct
22 Correct 18 ms 23800 KB Output is correct
23 Correct 18 ms 23800 KB Output is correct
24 Correct 20 ms 23800 KB Output is correct
25 Correct 18 ms 23800 KB Output is correct
26 Correct 18 ms 23800 KB Output is correct
27 Correct 31 ms 24952 KB Output is correct
28 Correct 27 ms 24824 KB Output is correct
29 Correct 27 ms 24824 KB Output is correct
30 Correct 27 ms 24896 KB Output is correct
31 Correct 28 ms 24952 KB Output is correct
32 Correct 29 ms 24952 KB Output is correct
33 Correct 29 ms 24824 KB Output is correct
34 Correct 27 ms 24824 KB Output is correct
35 Correct 32 ms 24856 KB Output is correct
36 Correct 30 ms 24824 KB Output is correct
37 Correct 31 ms 24824 KB Output is correct
38 Correct 31 ms 24824 KB Output is correct
39 Correct 30 ms 24824 KB Output is correct
40 Correct 31 ms 24952 KB Output is correct
41 Correct 30 ms 24952 KB Output is correct
42 Correct 30 ms 24952 KB Output is correct
43 Correct 31 ms 24952 KB Output is correct
44 Correct 31 ms 24824 KB Output is correct
45 Correct 29 ms 24952 KB Output is correct
46 Correct 30 ms 24824 KB Output is correct
47 Correct 30 ms 24828 KB Output is correct
48 Correct 176 ms 34552 KB Output is correct
49 Correct 193 ms 34552 KB Output is correct
50 Correct 180 ms 34588 KB Output is correct
51 Correct 175 ms 34424 KB Output is correct
52 Correct 162 ms 33292 KB Output is correct
53 Correct 162 ms 33784 KB Output is correct
54 Correct 146 ms 32760 KB Output is correct
55 Correct 142 ms 32504 KB Output is correct
56 Correct 139 ms 32248 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 23928 KB Output is correct
2 Correct 18 ms 23804 KB Output is correct
3 Correct 19 ms 23900 KB Output is correct
4 Correct 18 ms 23928 KB Output is correct
5 Correct 19 ms 23800 KB Output is correct
6 Correct 18 ms 23800 KB Output is correct
7 Correct 20 ms 23800 KB Output is correct
8 Correct 18 ms 23800 KB Output is correct
9 Correct 19 ms 23932 KB Output is correct
10 Correct 18 ms 23800 KB Output is correct
11 Correct 18 ms 23800 KB Output is correct
12 Correct 18 ms 23800 KB Output is correct
13 Correct 18 ms 23800 KB Output is correct
14 Correct 18 ms 23800 KB Output is correct
15 Correct 18 ms 23928 KB Output is correct
16 Correct 18 ms 23800 KB Output is correct
17 Correct 18 ms 23932 KB Output is correct
18 Correct 18 ms 23800 KB Output is correct
19 Correct 19 ms 23800 KB Output is correct
20 Correct 18 ms 23804 KB Output is correct
21 Correct 18 ms 23800 KB Output is correct
22 Correct 18 ms 23800 KB Output is correct
23 Correct 18 ms 23800 KB Output is correct
24 Correct 20 ms 23800 KB Output is correct
25 Correct 18 ms 23800 KB Output is correct
26 Correct 18 ms 23800 KB Output is correct
27 Correct 31 ms 24952 KB Output is correct
28 Correct 27 ms 24824 KB Output is correct
29 Correct 27 ms 24824 KB Output is correct
30 Correct 27 ms 24896 KB Output is correct
31 Correct 28 ms 24952 KB Output is correct
32 Correct 29 ms 24952 KB Output is correct
33 Correct 29 ms 24824 KB Output is correct
34 Correct 27 ms 24824 KB Output is correct
35 Correct 32 ms 24856 KB Output is correct
36 Correct 30 ms 24824 KB Output is correct
37 Correct 31 ms 24824 KB Output is correct
38 Correct 31 ms 24824 KB Output is correct
39 Correct 30 ms 24824 KB Output is correct
40 Correct 31 ms 24952 KB Output is correct
41 Correct 30 ms 24952 KB Output is correct
42 Correct 30 ms 24952 KB Output is correct
43 Correct 31 ms 24952 KB Output is correct
44 Correct 31 ms 24824 KB Output is correct
45 Correct 29 ms 24952 KB Output is correct
46 Correct 30 ms 24824 KB Output is correct
47 Correct 30 ms 24828 KB Output is correct
48 Correct 176 ms 34552 KB Output is correct
49 Correct 193 ms 34552 KB Output is correct
50 Correct 180 ms 34588 KB Output is correct
51 Correct 175 ms 34424 KB Output is correct
52 Correct 162 ms 33292 KB Output is correct
53 Correct 162 ms 33784 KB Output is correct
54 Correct 146 ms 32760 KB Output is correct
55 Correct 142 ms 32504 KB Output is correct
56 Correct 139 ms 32248 KB Output is correct
57 Correct 1008 ms 89820 KB Output is correct
58 Correct 841 ms 65208 KB Output is correct
59 Correct 833 ms 64976 KB Output is correct
60 Correct 885 ms 71168 KB Output is correct
61 Correct 878 ms 71120 KB Output is correct
62 Correct 412 ms 49628 KB Output is correct
63 Correct 598 ms 63064 KB Output is correct
64 Correct 492 ms 58844 KB Output is correct
65 Correct 262 ms 47336 KB Output is correct