제출 #1232994

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1232994		Lemser	Roller Coaster Railroad (IOI16_railroad)	C++20	34 / 100	33 ms	11192 KiB

railroad

#include "railroad.h"
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx2")
#pragma GCC target("popcnt")
using namespace std;
 
using ll = long long;
using ull = unsigned long long;
using lld = long double;
using ii = pair<int,int>;
using pll = pair<ll, ll>;
 
using vi = vector<int>;
using vll = vector<ll>;
using vii = vector<ii>;
using vpll = vector<pll>;
using vlld = vector<lld>;
 
#define all(x) x.begin(),x.end()
#define lsb(x) x&(-x)
#define gcd(a,b) __gcd(a,b)
#define sz(x) (int)x.size()
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define fls cout.flush()
 
#define fore(i, l, r) for (auto i = l; i < r; i++)
#define fo(i, n) fore (i, 0, n)
#define forex(i, r, l) for (auto i = r-1; i >= l; i--)
#define ffo(i, n) forex (i, n, 0)
 
bool cmin(ll &a, ll b) { if (b < a) { a=b; return 1; } return 0; }
bool cmax(ll &a, ll b) { if (b > a) { a=b; return 1; } return 0; }
 
const ll INF = 1e18;
const int mod = 1e9 + 7, LOG = 20;

long long plan_roller_coaster(vector<int> s, vector<int> t) {
    int n = s.size();
    vector<vll> dp(1<<n, vll(n, INF));
    fo (i, n) dp[1<<i][i] = 0;
    fore (msk, 1, 1<<n) {
        fo (i, n) {
            if (msk&(1<<i)) {
                fo (j, n) {
                    if (msk&(1<<j)) continue; 
                    dp[msk^(1<<j)][j] = min(dp[msk^(1<<j)][j], dp[msk][i] + max(ll(t[i]-s[j]), 0ll));
                }
            }
        }
    }
    return *min_element(all(dp[(1<<n)-1]));
}

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

railroad.h:1:9: warning: #pragma once in main file
    1 | #pragma once
      |         ^~~~
railroad_c.h:1:9: warning: #pragma once in main file
    1 | #pragma once
      |         ^~~~

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