Submission #200887

#	Time	Username	Problem	Language	Result	Execution time	Memory
200887		balbit	Rope (JOI17_rope)	C++14	80 / 100	981 ms	96512 KiB

rope

#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 / 15
• Subtask 2: 30 / 30
• Subtask 3: 10 / 10
• Subtask 4: 25 / 25
• Subtask 5: 0 / 20