제출 #828509

#제출 시각아이디문제언어결과실행 시간메모리
828509caganyanmazAliens (IOI16_aliens)C++14
컴파일 에러
0 ms0 KiB
#include <bits/stdc++.h> #define pb push_back #define int int64_t using namespace std; #ifdef DEBUGGING #include "../debug.h" #else #define debug(x...) void(42) #endif constexpr static int MXN = 505; constexpr static int INF = 1e17; int dp[MXN][MXN]; long long take_photos(int32_t n, int32_t m, int32_t k, vector<int32_t> r, vector<int32_t> c) { vector<array<int, 2>> v; for (int i = 0; i < n; i++) { if (c[i] > r[i]) swap(r[i], c[i]); v.pb({c[i], r[i]}); } sort(v.begin(), v.end()); debug(n, v); int last = 0; set<int> s; s.insert(0); for (int i = 1; i < n; i++) { debug(last, v[last]); if (v[last][1] >= v[i][1]) continue;#include <bits/stdc++.h> #define pb push_back #define int int64_t using namespace std; #define DEBUGGING #ifdef DEBUGGING #include "../debug.h" #else #define debug(x...) void(42) #endif constexpr static int MXN = 505; constexpr static int INF = 1e17; int dp[MXN][MXN]; long long take_photos(int32_t n, int32_t m, int32_t k, vector<int32_t> r, vector<int32_t> c) { vector<array<int, 2>> v; for (int i = 0; i < n; i++) { if (c[i] > r[i]) swap(r[i], c[i]); v.pb({c[i], r[i]}); } sort(v.begin(), v.end()); debug(n, v); int last = 0; set<int> s; s.insert(0); for (int i = 1; i < n; i++) { debug(last, v[last]); if (v[last][1] >= v[i][1]) continue; s.insert(i); if (v[last][0] == v[i][0] && v[i][1] >= v[last][1]) { debug(last, i, v[last][0], v[i][0]); s.erase(last); } last = i; } debug(s); vector<array<int, 2>> pos; for (int nv : s) pos.pb(v[nv]); debug(pos); for (int i = 0; i <= n; i++) for (int j = 0; j <= n; j++) dp[i][j] = INF; dp[0][0] = 0; for (int i = 1; i <= pos.size(); i++) { for (int j = 1; j <= k; j++) { for (int l = 0; l < i; l++) { dp[i][j] = min(dp[i][j], dp[l][j-1] + (1 + pos[i-1][1] - pos[l][0]) * (1 + pos[i-1][1] - pos[l][0])); debug(l, i,j, dp[i][j]); } } } int best = INF; for (int i = 0; i <= k; i++) { debug(pos.size(), i, dp[pos.size()][i]); best = min(best, dp[pos.size()][i]); } return best; } s.insert(i); if (v[last][0] == v[i][0] && v[i][1] >= v[last][1]) { debug(last, i, v[last][0], v[i][0]); s.erase(last); } last = i; } debug(s); vector<array<int, 2>> pos; for (int nv : s) pos.pb(v[nv]); debug(pos); for (int i = 0; i <= n; i++) for (int j = 0; j <= n; j++) dp[i][j] = INF; dp[0][0] = 0; for (int i = 1; i <= pos.size(); i++) { for (int j = 1; j <= k; j++) { for (int l = 0; l < i; l++) { dp[i][j] = min(dp[i][j], dp[l][j-1] + (1 + pos[i-1][1] - pos[l][0]) * (1 + pos[i-1][1] - pos[l][0])); debug(l, i,j, dp[i][j]); } } } int best = INF; for (int i = 0; i <= k; i++) { debug(pos.size(), i, dp[pos.size()][i]); best = min(best, dp[pos.size()][i]); } return best; }

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

aliens.cpp:34:13: error: stray '#' in program
   34 |    continue;#include <bits/stdc++.h>
      |             ^
aliens.cpp:42:10: fatal error: ../debug.h: No such file or directory
   42 | #include "../debug.h"
      |          ^~~~~~~~~~~~
compilation terminated.