# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
761764 |
2023-06-20T09:01:54 Z |
Dan4Life |
Aliens (IOI16_aliens) |
C++17 |
|
0 ms |
212 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;
int diag(int i){ return v[i][0]-v[i][1]; }
ll sq(int i, int j){
ll x = v[i][0]-v[i][1]+1; if(diag(i) < diag(j)-1) x=0;
return 1ll*(v[j][0]-v[i][1]+1)*(v[j][0]-v[i][1]+1)-x*(x+1)/2;
}
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({c[i],r[i]});
sort(begin(w),end(w),[&](ar a, ar b){
if(a[0]!=b[0]) return a[0]<b[0];
return a[1]>b[1];
});
int mn=m;
for(int i = n-1; i >=0; i--){
if(mn>w[i][1]) v.pb(w[i]);
mn = min(mn,w[i][1]);
}
n = sz(v); ll dp[k+1][n+1], ans = (ll)4e18;
memset(dp,63,sizeof(dp)); sort(begin(v),end(v));
for(int i = 1; i <= n; i++) dp[1][i] = sq(0,i-1);
for(int j = 2; j <= k; j++)
for(int i = 1; i <= n; i++)
for(int x = 1; x < i; x++)
dp[j][i] = min(dp[j][i], dp[j-1][x]+sq(x,i-1));
for(int i = 1; i <= k; i++) ans = min(ans, dp[i][n]);
return ans;
}
# |
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 = 0, expected = 1 |
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 |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
212 KB |
Wrong answer: output = 1, expected = 4 |
2 |
Halted |
0 ms |
0 KB |
- |