Submission #1173345

#	Time	Username	Problem	Language	Result	Execution time	Memory
1173345		Tsagana	Marathon Race 2 (JOI24_ho_t3)	C++20	7 / 100	0 ms	328 KiB

Main

#include<bits/stdc++.h>

#define IOS ios_base::sync_with_stdio(false);cin.tie();cout.tie();
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define int long long
#define pq priority_queue
#define eb emplace_back
#define lb lower_bound
#define ub upper_bound
#define pb push_back
#define pp pop_back
#define F first
#define S second

using namespace std;

void solve () {
	int n, l;
	cin >> n >> l;
	vector<int> a(n);
	for (auto &i: a) cin >> i;
	sort(all(a));
	int c1 = 0, c2 = 0;
	for (int i = 1; i < n; i++) {
		c1 += (a[i] - a[i-1]) * (i + 1);
		c2 += (a[i] - a[i-1]) * (n + 1 - i);
	}
	int q; cin >> q;
	while (q--) {
		int s, e, t;
		cin >> s >> e >> t;
		if (min(abs(s - a[0]) + abs(e - a[n-1]) * (n + 1) + c1,
		        abs(s - a[n-1]) + abs(e - a[0]) * (n + 1) + c2) + n <= t) cout << "Yes\n";
		else cout << "No\n";
	}
}
signed main() {IOS solve(); return 0;}

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