제출 #1139086

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1139086		PlayVoltz	Coin Collecting (JOI19_ho_t4)	C++20	0 / 100	0 ms	328 KiB

joi2019_ho_t4

#include <cstdio>
#include <stdio.h>
#include <stdbool.h>
#include <iostream>
#include <map>
#include <vector>
#include <climits>
#include <stack>
#include <string>
#include <queue>
#include <algorithm>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <cmath>
#include <cctype>
#include <bitset>
#include <iomanip>
#include <cstring>
#include <numeric>
#include <cassert>
using namespace std;

#define int long long
#define pii pair<int, int>
#define mp make_pair
#define pb push_back
#define fi first
#define se second

int32_t main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	int n, ans=0;
	cin>>n;
	deque<pii> top, down;
	for (int i=0, a, b; i<2*n; ++i){
		cin>>a>>b;
		if (b>=2)down.pb(mp(a, b));
		else top.pb(mp(a, b));
	}
	sort(top.begin(), top.end());
	sort(down.begin(), down.end());
	for (int i=1; i<=n; ++i){
		if (top.size()&&down.size()&&top[0].fi<=i&&down[0].fi<=i){
			ans+=abs(top[0].se-1)+abs(top[0].fi-i);
			ans+=abs(down[0].se-2)+abs(down[0].fi-i);
			down.pop_front();
			top.pop_front();
		}
		else if (down.empty()||(top[0].fi<=i&&top[1].fi<=i)){
			ans+=abs(top[0].se-1)+abs(top[0].fi-i);
			top.pop_front();
			ans+=abs(top[0].se-2)+abs(top[0].fi-i);
			top.pop_front();
		}
		else if (top.empty()||(down[0].fi<=i&&down[1].fi<=i)){
			ans+=abs(down[0].se-1)+abs(down[0].fi-i);
			down.pop_front();
			ans+=abs(down[0].se-2)+abs(down[0].fi-i);
			down.pop_front();
		}
		else{
			ans+=abs(top[0].se-1)+abs(top[0].fi-i);
			ans+=abs(down[0].se-2)+abs(down[0].fi-i);
			down.pop_front();
			top.pop_front();
		}
	}
	cout<<ans;
}

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