Submission #1276879

#	Time	Username	Problem	Language	Result	Execution time	Memory
1276879		danglayloi1	Coin Collecting (JOI19_ho_t4)	C++20	0 / 100	1 ms	576 KiB

joi2019_ho_t4

#include <bits/stdc++.h>
#define ii pair<int, int>
#define fi first
#define se second
#define inf 0x3f3f3f3f3f3f3f3f
using namespace std;
using ll = long long;
const ll mod=1e9+7;
const int nx=2e5+5;
bool cmp(ii a, ii b)
{
    return a.se<b.se;
}
int n;
ii a[nx];
ll ans=0, res=inf, pre[nx];
vector<int> ve;
int main()
{
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    cin>>n;
    for(int i = 1; i <= 2*n; i++)
        cin>>a[i].fi>>a[i].se;
    sort(a+1, a+2*n+1);
    for(int i = 1; i <= n; i++)
    {
        ans+=abs(i-a[i*2-1].fi);
        ans+=abs(i-a[i*2].fi);
        if(a[i*2-1].se<=a[i*2].se)
            ans+=abs(a[i*2-1].se-1), ans+=abs(a[i*2].se-2);
        else ans+=abs(a[i*2].se-1), ans+=abs(a[i*2-1].se-2);
    }
    cout<<ans;
}

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