oj.uz

답안 #163007

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
163007 2019-11-10T19:37:58 Z johutha Salesman (IOI09_salesman) C++14
100 / 100
 760 ms 54052 KB 
#include <map>
#include <vector>
#include <iostream>
#include <algorithm>
 
#define int int64_t
 
using namespace std;
 
struct fair
{
	int x, t, p, num;
};
 
bool faircomp(fair f1, fair f2)
{
	if (f1.t != f2.t) return f1.t < f2.t;
	return f1.x < f2.x;
}
 
struct hull
{
	map<int,int> treasuremap;
	int up;
	int down;
 
	int calcdist(int from, int to)
	{
		int dist = abs(to - from);
		if (from > to) return dist*up;
		return dist*down;
	}
 
	int query(int pos)
	{
		auto next = treasuremap.upper_bound(pos);
		int res = -1e12;
		if (next != treasuremap.end())
		{
			int x = (*next).first;
			int v = (*next).second;
			res = max(res, v - calcdist(x, pos));
		}
		if (next != treasuremap.begin())
		{
			auto bef = prev(next);
			int x = (*bef).first;
			int v = (*bef).second;
			res = max(res, v - calcdist(x, pos));
		}
		return res;
	}
	
	void add(int pos, int val)
	{
		if (query(pos) > val) return;
		treasuremap.insert({pos, val});
		map<int,int>::iterator itn = next(treasuremap.find(pos));
		map<int,int>::iterator itb = treasuremap.find(pos);
 
		while (itn != treasuremap.end())
		{
			if (val - calcdist(pos, (*itn).first) >= (*itn).second)
			{
				itn = treasuremap.erase(itn);
			}
			else break;
		}
 
		while (itb != treasuremap.begin())
		{
			auto it = prev(itb);
			if (val - calcdist(pos, (*it).first) >= (*it).second)
			{
				itb = treasuremap.erase(it);
			}
			else break;
		}
	}
};
 
signed main()
{
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	int n, d, u, s;
	cin >> n >> d >> u >> s;
 
	map<int,int> active;
	vector<fair> ofairs;
 
	for (int i = 0; i < n; i++)
	{
		fair nf;
		nf.num = i;
		cin >> nf.t >> nf.x >> nf.p;
		ofairs.push_back(nf);
	}
 
	sort(ofairs.begin(), ofairs.end(), faircomp);
 
	vector<vector<fair>> fairs;
	int last = -1;
	vector<fair> cf;
	for (auto f : ofairs)
	{
		if (f.t != last)
		{
			if (last != -1)
			{
				fairs.push_back(cf);
				cf.clear();
			}
		}
		last = f.t;
		cf.push_back(f);
	}
	fairs.push_back(cf);
 
	/*
	cout << "\n";
	for (auto fl : fairs)
	{
		for (auto f : fl)
		{
			cout << f.t << " " << f.num << "\n";
		}
		cout << "\n";
	}*/
 
	hull h;
	h.up = u;
	h.down = d;
	h.add(s, 0);
 
	for (auto fl : fairs)
	{
		int cn = fl.size();
		vector<int> cstr(cn);
		vector<int> cstrl(cn);
		int q = -1e12;
		int lp = -1e4;
		for (int i = 0; i < cn; i++)
		{
			cstr[i] = max(q - h.calcdist(lp, fl[i].x), h.query(fl[i].x)) + fl[i].p;
			lp = fl[i].x;
			q = cstr[i];
		}
		q = -1e12;
		lp = 1e8;
		for (int i = cn - 1; i >= 0; i--)
		{
			cstrl[i] = max(q - h.calcdist(lp, fl[i].x), h.query(fl[i].x)) + fl[i].p;
			lp = fl[i].x;
			q = cstrl[i];
		}
 
		for (int i = 0; i < cn; i++)
		{
			h.add(fl[i].x, max(cstr[i], cstrl[i]));
		}
	}
 
	cout << h.query(s) << "\n";
}

Subtask #1
100.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 3 ms 504 KB Output is correct
5 Correct 8 ms 888 KB Output is correct
6 Correct 22 ms 2540 KB Output is correct
7 Correct 67 ms 5608 KB Output is correct
8 Correct 131 ms 10492 KB Output is correct
9 Correct 216 ms 17748 KB Output is correct
10 Correct 435 ms 35264 KB Output is correct
11 Correct 417 ms 35264 KB Output is correct
12 Correct 595 ms 41384 KB Output is correct
13 Correct 573 ms 41176 KB Output is correct
14 Correct 573 ms 51292 KB Output is correct
15 Correct 752 ms 54052 KB Output is correct
16 Correct 760 ms 51448 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 3 ms 504 KB Output is correct
20 Correct 5 ms 504 KB Output is correct
21 Correct 4 ms 504 KB Output is correct
22 Correct 5 ms 760 KB Output is correct
23 Correct 5 ms 760 KB Output is correct
24 Correct 7 ms 760 KB Output is correct
25 Correct 71 ms 6936 KB Output is correct
26 Correct 229 ms 15828 KB Output is correct
27 Correct 363 ms 27840 KB Output is correct
28 Correct 486 ms 26560 KB Output is correct
29 Correct 526 ms 32964 KB Output is correct
30 Correct 406 ms 38056 KB Output is correct