Submission #372637

#	Time	Username	Problem	Language	Result	Execution time	Memory
372637		alishahali1382	Coin Collecting (JOI19_ho_t4)	C++14	0 / 100	1 ms	364 KiB

joi2019_ho_t4

#include <bits/stdc++.h>
#pragma GCC optimize ("O2,unroll-loops")
//#pragma GCC optimize("no-stack-protector,fast-math")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<pii, int> piii;
typedef pair<ll, ll> pll;
#define debug(x) cerr<<#x<<'='<<(x)<<endl;
#define debugp(x) cerr<<#x<<"= {"<<(x.first)<<", "<<(x.second)<<"}"<<endl;
#define debug2(x, y) cerr<<"{"<<#x<<", "<<#y<<"} = {"<<(x)<<", "<<(y)<<"}"<<endl;
#define debugv(v) {cerr<<#v<<" : ";for (auto x:v) cerr<<x<<' ';cerr<<endl;}
#define all(x) x.begin(), x.end()
#define pb push_back
#define kill(x) return cout<<x<<'\n', 0;

const int inf=1000000010;
const ll INF=1000000000000001000LL;
const int mod=1000000007;
const int MAXN=300010, LOG=20;

int n, m, k, u, v, x, y, t, a, b, ans;
int A[MAXN];

struct Solver{
	vector<pii> vec;
	void Add(int x, int val){
		vec.pb({x, val});
	}
	ll Solve(){
		sort(all(vec));
		ll res=0, last=0, sum=0;
		for (pll p:vec){
			res+=(p.first-last)*abs(sum);
			last=p.first;
			sum+=p.second;
		}
		return res;
	}
} X, Y;

int main(){
	ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
	//freopen("input.txt", "r", stdin);
	//freopen("output.txt", "w", stdout);
	cin>>n;
	for (int i=1; i<=2*n; i++){
		cin>>x>>y;
		X.Add(x, +1);
		Y.Add(y, +1);
	}
	for (int i=1; i<=n; i++) X.Add(i, -2);
	Y.Add(1, -n);
	Y.Add(2, -n);
	cout<<X.Solve() + Y.Solve()<<"\n";
	
	return 0;
}

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