Submission #1014773

#	Time	Username	Problem	Language	Result	Execution time	Memory
1014773		Ausp3x	Roller Coaster Railroad (IOI16_railroad)	C++17	Compilation error	0 ms	0 KiB

railroad

// 人外有人，天外有天
// author: Ausp3x

#pragma GCC optimize("O1, O2, O3, Ofast, unroll-loops")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include "railroad.h"
using namespace std;
using namespace __gnu_pbds;

#define fi first
#define se second
#define pb push_back
// #define DEBUG
typedef long long         lng;
typedef pair<int, int>    pi;
typedef vector<int>       vi;
typedef pair<lng, lng>    pl;
typedef vector<lng>       vl;

int const INF32 = 0x3f3f3f3f;
lng const INF64 = 0x3f3f3f3f3f3f3f3f;

lng plan_roller_coaster(vi s, vi t) {
    int n = s.size();
    
    if (n <= 16) {
        vector<vi> cnts(n + 1);
        for (int i = 0; i < (1 << n); i++) {
            int cnt = 0;
            for (int j = 0; j < n; j++)
                if (i & (1 << j))
                    cnt++;

            cnts[cnt].push_back(i);
        }

        vector<vl> dp(1 << n, vl(n, INF64));
        for (int i = 0; i < n; i++) 
            dp[1 << i][i] = 0;
        for (int i = 2; i <= n; i++)
            for (int x : cnts[i])
                for (int j = 0; j < n; j++) {
                    if (!(x & (1 << j)))
                        continue;

                    for (int k = 0; k < n; k++)
                        if ((x & (1 << k)) && k != j)
                            dp[x][j] = min(dp[x][j], dp[x ^ (1 << j)][k] + max(s[j] - t[k], 0))
                }
    
        lng ans = INF64;
        for (int i = 0; i < n; i++)
            ans = min(ans, dp[(1 << n) - 1][i]);
        return ans;
    }
    
    return -1;
}

#ifdef DEBUG
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    int t = 1;
    cin >> t;
    while (t--) {
    }

    return 0;
}
#endif

Compilation message (stderr)

railroad.cpp:4:55: warning: bad option '-f O2' to pragma 'optimize' [-Wpragmas]
    4 | #pragma GCC optimize("O1, O2, O3, Ofast, unroll-loops")
      |                                                       ^
railroad.cpp:4:55: warning: bad option '-f O3' to pragma 'optimize' [-Wpragmas]
railroad.cpp:4:55: warning: bad option '-f Ofast' to pragma 'optimize' [-Wpragmas]
railroad.cpp:4:55: warning: bad option '-f unroll-loops' to pragma 'optimize' [-Wpragmas]
In file included from railroad.cpp:7:
railroad.h:5:69: warning: bad option '-f O2' to attribute 'optimize' [-Wattributes]
    5 | long long plan_roller_coaster(std::vector<int> s, std::vector<int> t);
      |                                                                     ^
railroad.h:5:69: warning: bad option '-f O3' to attribute 'optimize' [-Wattributes]
railroad.h:5:69: warning: bad option '-f Ofast' to attribute 'optimize' [-Wattributes]
railroad.h:5:69: warning: bad option '-f unroll-loops' to attribute 'optimize' [-Wattributes]
railroad.h:5:69: warning: bad option '-f O2' to attribute 'optimize' [-Wattributes]
railroad.h:5:69: warning: bad option '-f O3' to attribute 'optimize' [-Wattributes]
railroad.h:5:69: warning: bad option '-f Ofast' to attribute 'optimize' [-Wattributes]
railroad.h:5:69: warning: bad option '-f unroll-loops' to attribute 'optimize' [-Wattributes]
railroad.cpp:24:35: warning: bad option '-f O2' to attribute 'optimize' [-Wattributes]
   24 | lng plan_roller_coaster(vi s, vi t) {
      |                                   ^
railroad.cpp:24:35: warning: bad option '-f O3' to attribute 'optimize' [-Wattributes]
railroad.cpp:24:35: warning: bad option '-f Ofast' to attribute 'optimize' [-Wattributes]
railroad.cpp:24:35: warning: bad option '-f unroll-loops' to attribute 'optimize' [-Wattributes]
railroad.cpp: In function 'lng plan_roller_coaster(vi, vi)':
railroad.cpp:49:96: error: expected ';' before '}' token
   49 |                             dp[x][j] = min(dp[x][j], dp[x ^ (1 << j)][k] + max(s[j] - t[k], 0))
      |                                                                                                ^
      |                                                                                                ;
   50 |                 }
      |                 ~