제출 #1138876

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1138876		PlayVoltz	Coin Collecting (JOI19_ho_t4)	C++20	0 / 100	1 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;
	vector<pii> vect(2*n);
	for (int i=0; i<2*n; ++i)cin>>vect[i].fi>>vect[i].se;
	sort(vect.begin(), vect.end());
	multiset<pii> s;
	int i=1, p=0;
	for (;i<=n; ++i){
		while (s.size()<2&&vect[p].fi<=i)s.insert(mp(vect[p].se, vect[p].fi)), ++p;
		while (p<2*n&&vect[p].fi==vect[p-1].fi)s.insert(mp(vect[p].se, vect[p].fi)), ++p;
		if (s.size()<2){
			--p;
			break;
		}
		//cout<<"["<<i<<" "<<s.begin()->fi<<" "<<s.begin()->se<<" "<<(--s.end())->fi<<" "<<(--s.end())->se<<"]\n";
		ans+=abs(s.begin()->fi-1)+abs(s.begin()->se-i);
		ans+=abs((--s.end())->fi-2)+abs((--s.end())->se-i);
		s.erase(s.begin());
		s.erase((--s.end()));
	}
	int temp=i;
	p=2*n-1;
	for (int i=n; i>=temp; --i){
		while (s.size()<2)s.insert(mp(vect[p].se, vect[p].fi)), --p;
		while (p&&vect[p].fi==vect[p+1].fi)s.insert(mp(vect[p].se, vect[p].fi)), --p;
		//cout<<"["<<i<<" "<<s.begin()->fi<<" "<<s.begin()->se<<" "<<(--s.end())->fi<<" "<<(--s.end())->se<<"]\n";
		ans+=abs(s.begin()->fi-1)+abs(s.begin()->se-i);
		ans+=abs((--s.end())->fi-2)+abs((--s.end())->se-i);
		s.erase(s.begin());
		s.erase((--s.end()));
	}
	cout<<ans;
}

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