제출 #1325984

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1325984		zyntherix	Marathon Race 2 (JOI24_ho_t3)	C++20	14 / 100	1595 ms	332 KiB

Main

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pi pair<int, int>
#define vi vector<int>
#define vs vector<string>
#define vb vector<bool>
#define vpi vector<pi>
#define pb push_back
#define all(a) (a).begin(), (a).end()
const int mod = 1e18 + 7;

void solve()
{
  int n, l;
  cin >> n >> l;
  vi x(n);
  for (int i = 0; i < n; i++)
    cin >> x[i];
  int q;
  cin >> q;
  while (q--)
  {
    int s, e, t;
    cin >> s >> e >> t;
    vi a;
    for (int i = 0; i < n; i++)
    {
      a.pb(i);
    }
    vi a2 = a;
    int mn = mod;
    do
    {
      int curr = 0;
      int pos = s;
      int ans = 0;
      for (int i = 0; i < a.size(); i++)
      {
        ans += (curr + 1) * abs(pos - x[a[i]]);
        ans++;
        curr++;
        pos = x[a[i]];
      }
      ans += ((curr + 1) * abs(pos - e));
      mn = min(ans, mn);
      next_permutation(all(a));
    } while (a != a2);
    cout << (mn <= t ? "Yes\n" : "No\n");
  }
}

signed main()
{
  ios_base::sync_with_stdio(0);
  cin.tie(NULL);
  cout.tie(NULL);
  int t = 1;
  // cin >> t;
  while (t--)
  {
    solve();
  }
  return 0;
}

• 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