# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
135910 | ckodser | Aliens (IOI16_aliens) | C++14 | 98 ms | 3916 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "aliens.h"
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#if __cplusplus >= 201103L
#include <array>
#include <atomic>
#include <chrono>
#include <condition_variable>
#include <forward_list>
#include <future>
#include <initializer_list>
#include <mutex>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <system_error>
#include <thread>
#include <tuple>
#include <typeindex>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#endif
#define ll int
#define pb push_back
#define mp make_pair
#define ld long double
#define F first
#define S second
#define pii pair<ll,ll>
using namespace :: std;
const ll maxn=4100;
const ll maxk=4010;
const ll inf=1e9+900;
ll tav2(ll x){
return x*x;
}
ll dp[maxn][maxk];
vector<pii> vec;
ll XX[maxn];
ll X[maxn];
ll V[maxn];
ll mx[maxn];
long long take_photos(int n, int m, int k, vector<int> r, vector<int> c) {
swap(n,m);
fill(mx,mx+maxn,inf);
for(ll i=0;i<m;i++){
if(c[i]>r[i]){
swap(c[i],r[i]);
}
mx[r[i]]=min(mx[r[i]],(ll)c[i]);
}
stack<ll> stk;
for(ll i=0;i<n;i++){
while(stk.size() && mx[stk.top()]>=mx[i]){
stk.pop();
}
if(mx[i]!=inf){
stk.push(i);
}
}
while(stk.size()){
vec.pb(mp(stk.top(),mx[stk.top()]));
stk.pop();
}
sort(vec.begin(),vec.end());
XX[0]=tav2(vec[0].S);
V[0]=vec[0].S;
for(ll i=0;i+1<vec.size();i++){
XX[i+1]=-tav2(max(0,vec[i].F-vec[i+1].S+1))+tav2(vec[i+1].S);
V[i+1]=vec[i+1].S;
}
for(ll i=0;i<vec.size();i++){
vec[i].F++;
}
for(ll i=0;i<vec.size();i++){
dp[i][0]=inf;
}
for(ll j=1;j<=k;j++){
X[0]=XX[0];
for(ll i=1;i<vec.size();i++){
X[i]=XX[i]+dp[i-1][j-1];
}
for(ll i=0;i<vec.size();i++){
for(ll u=0;u<=i;u++){
dp[i][j]=min(dp[i][j],-2*vec[i].F*V[u]+X[u]);
}
dp[i][j]+=tav2(vec[i].F);
}
}
return dp[vec.size()-1][k];
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |