| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1338338 | retarde | Marathon Race 2 (JOI24_ho_t3) | C++20 | 1611 ms | 439068 KiB |
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define pf push_front
#define mp make_pair
#define fi first
#define se second
#define int long long
#define all(x) (x).begin(), (x).end()
typedef long double ld;
typedef long long ll;
typedef pair<ll,ll> pll;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<bool> vb;
typedef vector<vector<int>> vvi;
typedef vector<vector<bool>> vvb;
typedef vector<vector<ll>> vvll;
typedef vector<string> vs;
typedef vector<vector<string>> vvs;
typedef vector<char> vc;
typedef vector<vector<char>> vvc;
typedef map<int, int> mii;
typedef unordered_map<int, int> umii;
const int mod = 1e9 + 7;
const int inf = INTMAX_MAX;
const bool tc = false;
inline void solve() {
int n, l;
cin >> n >> l;
vi a(n); for (int i = 0; i < n; i++) cin >> a[i];
sort(all(a));
int q; cin >> q;
while (q--) {
int s, e, t;
cin >> s >> e >> t;
vi b = a;
// b.pb(s); b.pb(e);
// sort(all(b));
map<int, vvi> anses;
do {
int cur = abs(b[0]-s);
for (int i = 1; i < b.size(); i++) {
cur += abs(b[i]-b[i-1])*(i+1);
}
cur += abs(e-b[b.size()-1])*(n+1);
anses[cur].pb(b);
// cout << cur << '\n';
// for (auto &x : b) cout << x << " ";
// cout << '\n';
} while (next_permutation(all(b)));
if ((*anses.begin()).fi+n > t) {
cout << "No\n";
continue;
} else {
cout << "Yes\n";
}
}
}
void setIO(string s) {
freopen((s + ".in").c_str(), "r", stdin);
freopen((s + ".out").c_str(), "w", stdout);
}
signed main() {
ios::sync_with_stdio(false);
cout.tie(0);
cin.tie(0);
//setIO();
int t = 1;
if (tc) {
cin >> t;
}
while (t--) {
solve();
}
}Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
