Submission #773573

#TimeUsernameProblemLanguageResultExecution timeMemory
773573JomnoiAliens (IOI16_aliens)C++17
0 / 100
53 ms2256 KiB
#include <bits/stdc++.h> #include "aliens.h" using namespace std; const int MAX_K = 1005; const int MAX_N = 1005; const long long INF = 1e18 + 7; int N, M, K; int id[MAX_N]; long long dp[MAX_K][MAX_N]; bool dead[MAX_N]; long long take_photos(int n, int m, int k, vector <int> r, vector <int> c) { N = n, M = m, K = k; if (K == N) { int cnt = N; for (int i = 0; i < N; i++) { for (int j = 0; j < N; j++) { if (i == j) continue; int l1 = r[i] + c[i] - abs(r[i] - c[i]), r1 = r[i] + c[i] + abs(r[i] - c[i]); int l2 = r[j] + c[j] - abs(r[j] - c[j]), r2 = r[j] + c[j] + abs(r[j] - c[j]); if (l1 <= l2 and r2 <= r1) dead[j] = true; } } for (int i = 0; i < N; i++) if (dead[i] == true) cnt--; return cnt; } for (int i = 0; i < N; i++) id[i] = i; sort(id, id + N, [&](const int &a, const int &b) { return r[a] < r[b]; }); for (int i = 1; i <= N; i++) dp[0][i] = INF; for (int k = 1; k <= K; k++) { for (int i = 1; i <= N; i++) { dp[k][i] = INF; for (int j = i; j >= 1; j--) { long long cost = (r[id[i - 1]] - r[id[j - 1]] + 1) * (r[id[i - 1]] - r[id[j - 1]] + 1); dp[k][i] = min(dp[k][i], cost + dp[k - 1][j - 1]); } } } long long ans = INF; for (int k = 1; k <= K; k++) ans = min(ans, dp[k][N]); return ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...