Submission #1214683

#	Time	Username	Problem	Language	Result	Execution time	Memory
1214683		trimkus	Marathon Race 2 (JOI24_ho_t3)	C++20	14 / 100	1593 ms	2376 KiB

Main

#include <bits/stdc++.h>
using namespace std;
using ll = long long;

int brute(int s, int g, vector<int> a) {
	sort(begin(a), end(a));
	int res = INT_MAX;
	do {
		int total = 0;
		int pos = s, now = 1;
		for (auto& u : a) {
			total += abs(pos - u) * now;
			total += 1;
			now += 1;
			pos = u;
		}
		//~ for (auto& u : a) {
			//~ cout <<  u << " ";
		//~ }
		//~ cout << "bef = " << total << " -> ";
		total += abs(pos - g) * now;
		//~ cout << "got = " << total << "\n";
		res = min(res, total);
	} while (next_permutation(begin(a), end(a)));
	return res;
}

int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	int n, l;
	cin >> n >> l;
	int left = l, right = 0;
	vector<int> cnt(l + 1);
	vector<int> a(n);
	for (int i = 0; i < n; ++i) {
		int x;
		cin >> x;
		cnt[x] += 1;
		a[i] = x;
		left = min(left, x);
		right = max(right, x);
	}
	int q;
	cin >> q;
	while (q--) {
		int s, g, t;
		cin >> s >> g >> t;
		int exp = brute(s, g, a);
		int total = exp;
		cout << (total <= t ? "Yes\n" : "No\n");
	}
}

• Subtask 1: 7 / 7
• Subtask 2: 7 / 7
• Subtask 3: 0 / 10
• Subtask 4: 0 / 28
• Subtask 5: 0 / 10
• Subtask 6: 0 / 19
• Subtask 7: 0 / 19