제출 #287332

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
287332		Tangent	Roller Coaster Railroad (IOI16_railroad)	C++17	11 / 100	100 ms	5740 KiB

railroad

#include <bits/stdc++.h>
#include "railroad.h"

using namespace std;

//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
// typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
// find_by_order(), order_of_key()

typedef long long ll;
typedef long double dd;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<dd, dd> pdd;
typedef vector<int> vii;
typedef vector<ll> vll;
typedef vector<dd> vdd;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
typedef vector<pdd> vpdd;
typedef vector<vii> vvii;
typedef vector<vll> vvll;
typedef vector<vdd> vvdd;
typedef vector<vpii> vvpii;
typedef vector<vpll> vvpll;
typedef vector<vpdd> vvpdd;
typedef vector<bool> vb;

const int inf = 1 << 30;

#define rep(i, n) for (ll i = 0; i < n; i++)
#define ffor(i, a, b) for(ll i = a; i < b; i++)
#define forin(x, a) for (auto &x: a)
#define all(x) x.begin(), x.end()

#ifdef TEST
#define dbg(x) cout << #x << ": " << x << '\n';
#define dbgc(x) cout << #x << ":"; forin(a, x) { cout << " " << a; } cout << endl;
#define tassert(x) assert(x);
#else
#define dbg(x)
#define dbgc(x)
#define tassert(x)
#endif

long long plan_roller_coaster(std::vector<int> s, std::vector<int> t) {
    int n = s.size();
    if (n <= 8) {
      vii order(n);
      ll res = numeric_limits<ll>::max();
      iota(all(order), 0);
      do {
        ll curr = 0;
        rep(i, n - 1) {
          curr += max(0, t[order[i]] - s[order[i + 1]]);
        }
        res = min(res, curr);
      } while (next_permutation(all(order)));
      return res;
    } else {
      vpii diffs;
      rep(i, n) {
        diffs.emplace_back(s[i] - t[i], i);
      }
      sort(all(diffs));
      ll res = 0;
      rep(i, n - 1) {
        res += max(0, t[diffs[i].second] - s[diffs[i + 1].second]);
      }
      return res;
    }
    return 0;
}

• Subtask 1: 11 / 11
• Subtask 2: 0 / 23
• Subtask 3: 0 / 30
• Subtask 4: 0 / 36