# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
773627 | 2023-07-05T07:22:09 Z | PoonYaPat | Aliens (IOI16_aliens) | C++14 | 78 ms | 1332 KB |
#include "aliens.h" #include <bits/stdc++.h> using namespace std; typedef long long ll; typedef pair<int,int> pii; int n,m,k; int dp[505][505]; //n,k vector<pii> v; set<pii> h; long long take_photos(int N, int M, int K, vector<int> y, vector<int> x) { n=N; m=M; k=K; for (int i=0; i<n; ++i) h.insert(pii(x[i],y[i])); for (auto u : h) v.push_back(u); sort(v.begin(),v.end()); for (int i=0; i<n; ++i) for (int j=0; j<=k; ++j) dp[i][j]=1e9; for (int j=1; j<=k; ++j) dp[0][j]=1; for (int i=1; i<v.size(); ++i) { for (int j=1; j<=k; ++j) { //find dp[i][j] if (j==1) { dp[i][j]=min(dp[i][j],(v[i].first-v[0].first+1)*(v[i].first-v[0].first+1)); } else { for (int x=1; x<=i; ++x) { //capture i to x dp[i][j]=min(dp[i][j],dp[x-1][j-1]+(v[i].first-v[x].first+1)*(v[i].first-v[x].first+1)); } } } } return dp[v.size()-1][k]; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 212 KB | Wrong answer: output = 1, expected = 4 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 212 KB | Correct answer: answer = 1 |
2 | Correct | 0 ms | 212 KB | Correct answer: answer = 4 |
3 | Correct | 1 ms | 312 KB | Correct answer: answer = 1 |
4 | Correct | 1 ms | 212 KB | Correct answer: answer = 5 |
5 | Correct | 1 ms | 308 KB | Correct answer: answer = 41 |
6 | Correct | 1 ms | 308 KB | Correct answer: answer = 71923 |
7 | Correct | 1 ms | 596 KB | Correct answer: answer = 77137 |
8 | Correct | 25 ms | 1236 KB | Correct answer: answer = 764 |
9 | Correct | 1 ms | 1236 KB | Correct answer: answer = 250000 |
10 | Correct | 78 ms | 1236 KB | Correct answer: answer = 500 |
11 | Correct | 0 ms | 212 KB | Correct answer: answer = 32 |
12 | Correct | 1 ms | 1236 KB | Correct answer: answer = 130050 |
13 | Correct | 8 ms | 1328 KB | Correct answer: answer = 5110 |
14 | Correct | 2 ms | 724 KB | Correct answer: answer = 2626 |
15 | Correct | 4 ms | 724 KB | Correct answer: answer = 796 |
16 | Correct | 6 ms | 1236 KB | Correct answer: answer = 7580 |
17 | Correct | 21 ms | 1236 KB | Correct answer: answer = 1904 |
18 | Correct | 1 ms | 1332 KB | Correct answer: answer = 996004 |
19 | Correct | 3 ms | 1328 KB | Correct answer: answer = 38817 |
20 | Correct | 10 ms | 1328 KB | Correct answer: answer = 4096 |
21 | Correct | 1 ms | 1236 KB | Correct answer: answer = 1 |
22 | Correct | 1 ms | 1236 KB | Correct answer: answer = 1 |
23 | Correct | 19 ms | 1332 KB | Correct answer: answer = 2040 |
24 | Correct | 1 ms | 1236 KB | Correct answer: answer = 2 |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 212 KB | Wrong answer: output = 1, expected = 4 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 212 KB | Wrong answer: output = 1, expected = 4 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 212 KB | Wrong answer: output = 1, expected = 4 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 212 KB | Wrong answer: output = 1, expected = 4 |
2 | Halted | 0 ms | 0 KB | - |