Submission #240108

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
240108	2020-06-18T05:44:52 Z	MrRobot_28	Go (COCI18_go)	C++17	50 / 100	447 ms	156924 KB

go

#include <bits/stdc++.h>
                  
using namespace std;
bool cmp(pair <pair <int, int>, int> a, pair <pair <int, int>, int> b)
{
	return a.second < b.second;
}
signed main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cout.tie(NULL);
	int n, k, m;
	cin >> n >> k >> m;
	vector <pair <pair <int, int>, int> > mass(m);
	int ind1 = 0, ind2 = -1;
	for(int i = 0; i < m; i++)
	{
		cin >> mass[i].first.first >> mass[i].first.second >> mass[i].second;
		mass[i].second--;
		if(mass[i].first.first <= k)
		{
			ind1 = i;
		}
		if(mass[i].first.first >= k && ind2 == -1)
		{
			ind2 = i;
		}
	}
	int dp[m][m][2000][2];
	for(int i = 0; i < m; i++)
	{
		for(int j = 0; j < m; j++)
		{
			for(int t= 0; t < 2000; t++)
			{
				dp[i][j][t][0] = dp[i][j][t][1] = -1e9;
			}
		}
	}
	int ans = 0;
	for(int t = 0; t < 2000; t++)
	{
		for(int len = 1; len <= m; len++)
		{
			for(int i = 0; i <= m - len; i++)
			{
					if(len == 1)
					{
						if(i == ind1 || i == ind2)
						{
							if(abs(mass[i].first.first - k) <= mass[i].second)
							{
								dp[i][i + len - 1][abs(mass[i].first.first - k)][0] = mass[i].first.second;
								dp[i][i + len - 1][abs(mass[i].first.first - k)][1] = mass[i].first.second;
							}
						}
					}
					else
					{
						if(t >= abs(mass[i].first.first - mass[i + len - 1].first.first))
						{
							dp[i][i + len - 1][t][0] = max(dp[i][i + len - 1][t][0], dp[i + 1][i + len - 1][t - abs(mass[i].first.first - mass[i + len - 1].first.first)][1]);
							dp[i][i + len - 1][t][1] = max(dp[i][i + len - 1][t][1], dp[i][i + len - 2][t - abs(mass[i].first.first - mass[i + len - 1].first.first)][0]);
						}
						if(t >= abs(mass[i].first.first - mass[i + 1].first.first))
						{
							dp[i][i + len - 1][t][0] = max(dp[i][i + len - 1][t][0], dp[i + 1][i + len - 1][t - abs(mass[i].first.first - mass[i + 1].first.first)][0]);
						}
						if(t >= abs(mass[i + len - 2].first.first - mass[i + len - 1].first.first))
						{
							dp[i][i + len - 1][t][1] = max(dp[i][i + len - 1][t][1], dp[i][i + len - 2][t - abs(mass[i + len - 2].first.first - mass[i + len - 1].first.first)][1]);
						}
						if(t <= mass[i].second)
						{
							dp[i][i + len - 1][t][0] += mass[i].first.second;
						}
						if(t <= mass[i + len - 1].second)
						{
							dp[i][i + len - 1][t][1] += mass[i + len - 1].first.second;
						}
					}
					ans = max(ans, dp[i][i + len - 1][t][0]);
					ans = max(ans, dp[i][i + len - 1][t][1]);
			}
		}
	}
	cout << ans;
	return 0;
}

Subtask #1

50.0 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	5 ms	512 KB	Output is correct
2	Incorrect	7 ms	1920 KB	Output isn't correct
3	Incorrect	9 ms	3328 KB	Output isn't correct
4	Correct	16 ms	6528 KB	Output is correct
5	Incorrect	99 ms	39424 KB	Output isn't correct
6	Incorrect	155 ms	56828 KB	Output isn't correct
7	Incorrect	221 ms	77176 KB	Output isn't correct
8	Correct	280 ms	100600 KB	Output is correct
9	Correct	345 ms	127096 KB	Output is correct
10	Correct	447 ms	156924 KB	Output is correct