제출 #1017588

#제출 시각아이디문제언어결과실행 시간메모리
1017588n3rm1nFriend (IOI14_friend)C++17
컴파일 에러
0 ms0 KiB
#include <bits/stdc++.h> #include "holiday.h" using namespace std; const int MAXN = 23, MAXMASK = (1 << 21) + 10; long long dp[MAXN][MAXMASK]; long long sum[MAXMASK]; long long int findMaxAttraction(int n, int start, int d, int attraction[]) { int inf = 1e9; for (int i = 0; i < n; ++ i) { for (int mask = 0; mask < (1 << n); ++ mask) { dp[i][mask] = inf; } } for (int mask = 0; mask < (1 << n); ++ mask) { for (int v = 0; v < n; ++ v) { if((1 << v) & mask)sum[mask] += 1LL * attraction[v]; } } dp[start][0] = 0; long long ans = 0; for (int mask = 0; mask < (1 << n); ++ mask) { for (int v = 0; v < n; ++ v) { if(dp[v][mask] == inf)continue; for (int add = 0; add < n; ++ add) if(!(mask & (1 << add)))dp[add][(mask | (1 << add))] = min(dp[add][(mask | (1 << add))], dp[v][mask] + abs(v - add) + 1); if(dp[v][mask] <= d)ans = max(ans, sum[mask]); } } return ans; }

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

friend.cpp:2:10: fatal error: holiday.h: No such file or directory
    2 | #include "holiday.h"
      |          ^~~~~~~~~~~
compilation terminated.