# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
761795 |
2023-06-20T09:42:55 Z |
Dan4Life |
Aliens (IOI16_aliens) |
C++17 |
|
187 ms |
2260 KB |
#include "aliens.h"
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define sz(a) (int)a.size()
using ll = long long;
using ar = array<int,2>;
vector<ar> v,w;
ll sq(ll x){return x*x;}
ll cost(int i, int j){
if(i==j) return 1ll;
ll x = sq(max(0,v[i][1]-v[j][0]+1));
return sq(v[j][1]-v[i][0]+1)-x*!!i;
}
ll take_photos(int n, int m, int k, vector<int> r, vector<int> c) {
for(int i = 0; i < n; i++)
if(r[i]>c[i]) r[i]=m-r[i]-1,c[i]=m-c[i]-1;
for(int i = 0; i < n; i++) w.pb({r[i],c[i]});
sort(begin(w),end(w),[&](ar a, ar b){
if(a[1]!=b[1]) return a[1]<b[1];
return a[0]>b[0];
});
int mn=m;
for(int i = n-1; i >=0; i--){
if(mn>w[i][0]) v.pb(w[i]);
mn = min(mn,w[i][0]);
}
sort(begin(v),end(v),[&](ar a, ar b){return a[1]<b[1];});
n = sz(v); ll dp[k+1][n]; memset(dp,63,sizeof(dp));
for(int i = 0; i < n; i++) dp[1][i] = cost(0,i);
for(int j = 2; j <= k; j++){
for(int i = 0; i < n; i++){
dp[j][i] = dp[j-1][i];
for(int x = 0; x < i; x++){
dp[j][i] = min(dp[j][i], dp[j-1][x]+cost(x+1,i));
}
}
}
return dp[k][n-1];
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
212 KB |
Wrong answer: output = 1, expected = 4 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Correct answer: answer = 1 |
2 |
Correct |
0 ms |
212 KB |
Correct answer: answer = 4 |
3 |
Correct |
0 ms |
212 KB |
Correct answer: answer = 1 |
4 |
Correct |
0 ms |
212 KB |
Correct answer: answer = 5 |
5 |
Correct |
0 ms |
212 KB |
Correct answer: answer = 41 |
6 |
Correct |
0 ms |
212 KB |
Correct answer: answer = 71923 |
7 |
Correct |
1 ms |
292 KB |
Correct answer: answer = 77137 |
8 |
Correct |
65 ms |
1076 KB |
Correct answer: answer = 764 |
9 |
Correct |
0 ms |
212 KB |
Correct answer: answer = 250000 |
10 |
Correct |
187 ms |
2260 KB |
Correct answer: answer = 500 |
11 |
Correct |
0 ms |
212 KB |
Correct answer: answer = 32 |
12 |
Correct |
1 ms |
212 KB |
Correct answer: answer = 130050 |
13 |
Correct |
19 ms |
468 KB |
Correct answer: answer = 5110 |
14 |
Correct |
3 ms |
340 KB |
Correct answer: answer = 2626 |
15 |
Correct |
9 ms |
468 KB |
Correct answer: answer = 796 |
16 |
Correct |
12 ms |
340 KB |
Correct answer: answer = 7580 |
17 |
Correct |
49 ms |
816 KB |
Correct answer: answer = 1904 |
18 |
Correct |
1 ms |
212 KB |
Correct answer: answer = 996004 |
19 |
Correct |
5 ms |
340 KB |
Correct answer: answer = 38817 |
20 |
Correct |
23 ms |
596 KB |
Correct answer: answer = 4096 |
21 |
Correct |
0 ms |
212 KB |
Correct answer: answer = 1 |
22 |
Correct |
0 ms |
212 KB |
Correct answer: answer = 1 |
23 |
Correct |
46 ms |
772 KB |
Correct answer: answer = 2040 |
24 |
Correct |
0 ms |
212 KB |
Correct answer: answer = 2 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
212 KB |
Wrong answer: output = 1, expected = 4 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
212 KB |
Wrong answer: output = 1, expected = 4 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
212 KB |
Wrong answer: output = 1, expected = 4 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
212 KB |
Wrong answer: output = 1, expected = 4 |
2 |
Halted |
0 ms |
0 KB |
- |