Submission #771140

#	Time	Username	Problem	Language	Result	Execution time	Memory
771140		bachhoangxuan	Coin Collecting (JOI19_ho_t4)	C++17	0 / 100	1 ms	328 KiB

joi2019_ho_t4

// 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<pii,int>
#define mpp make_pair
#define fi first
#define se second
const int inf=1e18;
const int mod=1e9+7;
const int maxn=100005;
const int bl=650;
const int maxs=655;
const int maxm=200005;
const int maxq=500005;
const int maxl=20;
const int maxa=250000;
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=101;
int n,ans,cnt[maxn][2],p[2];
void f(int i,int j){
    for(int k=0;k<=1;k++) while(cnt[p[k]][k]==0 && p[k]<=n) p[k]++;
    //cout << i << ' ' << j << ' ' << p[0] << ' ' << p[1] << '\n';
    if(p[j^1]<=i){
        ans+=1+i-p[j^1];
        cnt[p[j^1]][j^1]--;
        //cout << p[j^1] << ' ' << (j^1) << '\n';
        return;
    }
    if(p[j]<=p[j^1]){
        ans+=p[j]-i;
        cnt[p[j]][j]--;
        //cout << p[j] << ' ' << j << '\n';
    }
    else{
        ans+=p[j^1]-i+1;
        cnt[p[j^1]][j^1]--;
        //cout << p[j^1] << ' ' << (j^1) << '\n';
    }
}
void solve(){
    cin >> n;
    for(int i=0;i<2*n;i++){
        int x,y;cin >> x >> y;
        if(x<1) ans+=1-x,x=1;
        if(x>n) ans+=x-n,x=n;
        if(y<1) ans+=1-y,y=1;
        if(y>2) ans+=y-2,y=2;
        cnt[x][y-1]++;
    }
    for(int i=1;i<=n;i++){
        for(int k=0;k<=1;k++) while(cnt[p[k]][k]==0 && p[k]<=n) p[k]++;
        if(p[0]<=i && p[1]<=i){
            ans+=2*i-p[0]-p[1];
            cnt[p[0]][0]--;cnt[p[1]][1]--;
        }
        else if(p[0]<=i && p[1]>i){
            ans+=i-p[0];cnt[p[0]][0]--;
            f(i,1);
        }
        else if(p[0]>i && p[1]<=i){
            ans+=i-p[1];cnt[p[1]][1]--;
            f(i,0);
        }
        else{
            if(p[0]<=p[1]) f(i,0),f(i,1);
            else f(i,1),f(i,0);
        }
    }
    cout << ans << '\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: 0 / 8
• Subtask 2: 0 / 29
• Subtask 3: 0 / 63