제출 #1147132

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1147132		wood	Roller Coaster Railroad (IOI16_railroad)	C++17	0 / 100	291 ms	589824 KiB

railroad

#include "railroad.h"
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int,int> p32;
typedef pair<ll,ll> p64;
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define vi vector<int>
#define vp32 vector<p32>
#define fast_cin() ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define MOD %1000000007
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
template <class T>
using Tree =
    tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
//never guess
//never debug without reviewing code
//never try adding ones or subtracting them
//only step by step debug when necessary

ll bit(ll x){
    int k = 0;
    while((1<<k)<x) k++;
    return k;
}

long long plan_roller_coaster(std::vector<int> s, std::vector<int> t) {
    int n = s.size();
    ll dp[(int)1e5][n]; memset(dp,1,sizeof dp);
    memset(dp[0],0,sizeof dp[0]);
    for(int i = 1; i<(1<<n); i++){
	int cnt = 0;
	while((1<<cnt)<=i){
	    if((1<<cnt)&i){
		ll mn  =1e12;
		for(int j = 0; j<n; j++){
		    mn = min(mn,dp[i-(1<<cnt)][j] + max(0,-t[j]+s[cnt]));
		}
		dp[i][bit(i)] = min(dp[i][bit(i)],mn);
	    }
	    cnt++;
	}
    }
    return *min_element(dp[(1<<n)-1],dp[1<<n]);
}

컴파일 시 표준 에러 (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: 0 / 11
• Subtask 2: 0 / 23
• Subtask 3: 0 / 30
• Subtask 4: 0 / 36