Submission #1237267

#	Time	Username	Problem	Language	Result	Execution time	Memory
1237267		Geforgs	Coin Collecting (JOI19_ho_t4)	C++20	0 / 100	0 ms	328 KiB

joi2019_ho_t4

#include <iostream>
#include <iomanip>
#include <vector>
#include <cmath>
#include <algorithm>
#include <set>
#include <queue>
#include <map>
#include <unordered_map>
#include <stack>
#include <bitset>
#include <string>
#include <cstring>
#include <iterator>
#include <random>
#define ll long long
#define ld long double
#define inf (ll)(2*1e18)
#define sort(a) sort(a.begin(), a.end())
#define reverse(a) reverse(a.begin(), a.end())
#define pb push_back
#define endl "\n"
using namespace std;

void solve(){
    ll n, i, res=0, x, y;
    cin>>n;
    multiset<ll> s1, s2;
    for(i=0;i<2*n;++i){
        cin>>x>>y;
        if(y >= 2){
            res += y - 2;
            if(1 <= x and x <= n){
                s2.insert(x);
            }else if(x < 1){
                res += 1 - x;
                s2.insert(1);
            }else{
                res += x - n;
                s2.insert(n);
            }
        }else{
            res += 1 - y;
            if(1 <= x and x <= n){
                s1.insert(x);
            }else if(x < 1){
                res += 1 - x;
                s1.insert(1);
            }else{
                res += x - n;
                s1.insert(n);
            }
        }
    }
    for(i=1;i<=n;++i){
        if(s2.empty() or (!s1.empty() and *s1.begin() <= *s2.begin())){
            res += abs(*s1.begin() - i);
            s1.erase(s1.begin());
            if(s2.empty() or (!s1.empty() and abs(*s1.begin() - i) + 1 <= abs(*s2.begin() - i))){
                res += abs(*s1.begin() - i) + 1;
                s1.erase(s1.begin());
            }else{
                res += abs(*s2.begin() - i);
                s2.erase(s2.begin());
            }
        }else{
            res += abs(*s2.begin() - i);
            s2.erase(s2.begin());
            if(s1.empty() or (!s2.empty() and abs(*s2.begin() - i) + 1 <= abs(*s1.begin() - i))){
                res += abs(*s2.begin() - i) + 1;
                s2.erase(s2.begin());
            }else{
                res += abs(*s1.begin() - i);
                s1.erase(s1.begin());
            }
        }
    }
    cout<<res<<endl;
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    srand(time(nullptr));
    ll t=1;
//    cin>>t;
    for(;t>0;--t){
        solve();
    }
    return 0;
}

• Subtask 1: 0 / 8
• Subtask 2: 0 / 29
• Subtask 3: 0 / 63