제출 #1069713

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1069713		TheQuantiX	Roller Coaster Railroad (IOI16_railroad)	C++17	34 / 100	2059 ms	11352 KiB

railroad

#include <bits/stdc++.h>

using namespace std;
using ll = long long;

constexpr ll INF = 1000000000000000000LL;

ll n, m, q, k, x, y, a, b, c;

long long plan_roller_coaster(vector<int> s, vector<int> t) {
    n = (int) s.size();
    if (n <= 16) {
        vector< vector<ll> > dp((1 << n), vector<ll>(n, INF));
        ll ans = INF;
        for (int i = 1; i < (1 << n); i++) {
            vector<int> v;
            for (int j = 0; j < n; j++) {
                if ((i >> j) & 1) {
                    v.push_back(j);
                }
            }
            for (auto j : v) {
                if (v.size() == 1) {
                    dp[i][j] = 0;
                }
                else {
                    for (int k = 0; k < n; k++) {
                        if (!((i >> k) & 1) || j == k) {
                            continue;
                        }
                        dp[i][j] = min(dp[i][j], dp[i - (1 << j)][k] + max(0, t[k] - s[j]));
                    }
                }
                if (v.size() == n) {
                    ans = min(ans, dp[i][j]);
                }
                // cout << bitset<4>(i) << ' ' << j << ' ' << dp[i][j] << '\n';
            }
        }
        return ans;
    }
    vector< pair<ll, ll> > v;
    for (int i = 0; i < n; i++) {
        v.push_back({t[i], s[i]});
    }
    sort(v.rbegin(), v.rend());
    sort(s.rbegin(), s.rend());
    ll e = 0;
    for (int i = 0; i < n; i++) {
        while (e < n && s[e] >= v[i].first) {

        }
        if (e - (v[i].second >= v[i].first ? 1 : 0) < i) {
            return 1;
        }
    }
    return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

railroad.cpp: In function 'long long int plan_roller_coaster(std::vector<int>, std::vector<int>)':
railroad.cpp:34:30: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'll' {aka 'long long int'} [-Wsign-compare]
   34 |                 if (v.size() == n) {
      |                     ~~~~~~~~~^~~~

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