제출 #388583

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
388583		alireza_kaviani	Roller Coaster Railroad (IOI16_railroad)	C++11	0 / 100	1630 ms	25848 KiB

railroad

#include <bits/stdc++.h>
#include "railroad.h"
using namespace std;

typedef long long ll;

#define all(x)		(x).begin() , (x).end()
#define SZ(x)		int(x.size())
#define sep			' '

const int MAXN = 5e5 + 10;

ll ps[MAXN];
vector<ll> compress;

ll plan_roller_coaster(vector<int> s, vector<int> t) {
	int n = (int) s.size();
	for(int i = 0 ; i < n ; i++){
		compress.push_back(s[i]);
		compress.push_back(t[i]);
	}
	sort(all(compress));
	compress.resize(unique(all(compress)) - compress.begin());
	for(int i = 0 ; i < n ; i++){
		cout << s[i] << sep << t[i] << endl;
		s[i] = lower_bound(all(compress) , s[i]) - compress.begin();
		t[i] = lower_bound(all(compress) , t[i]) - compress.begin();
		cout << s[i] << sep << t[i] << endl;
		ps[s[i]]++; ps[t[i]]--;
	}
	ll ans = 0;
	for(int i = 0 ; i + 1 < SZ(compress) ; i++){
		ps[i + 1] += ps[i];
		cout << i << sep << ps[i] << endl;
		ans += max(0ll , ps[i] - 1) * (compress[i + 1] - compress[i]);
	}
	for(int i = 0 ; i < n ; i++){
		if(ps[s[i]] <= 0)	ans++;
	}
	return ans;
}

• Subtask 1: 0 / 11
• Subtask 2: 0 / 23
• Subtask 3: 0 / 30
• Subtask 4: 0 / 36