Submission #241316

#TimeUsernameProblemLanguageResultExecution timeMemory
241316sebamarinAliens (IOI16_aliens)C++14
0 / 100
4 ms384 KiB
#include<bits/stdc++.h> using namespace std; typedef long long ll; typedef pair<int,int> ii; #define db(x) cout<<#x<<" = "<<x<<"\n"; #define fore(i,a,b) for(int i=a,ggdem=b;i<ggdem;i++) #define FIN ios::sync_with_stdio(false);cin.tie(0);cout.tie(0) #define SZ(a) ((int)(a).size()) #define ALL(a) a.begin(),a.end() #define mset(a,b) memset(a,b,sizeof(a)); #define pb push_back #define fst first #define snd second mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); const int N=1e6+5,INF=N; int n,m,k,r[N],c[N],dp[256][256]; ll sq(ll x){return x*x;} ll solve(int i,int j,int _k) { if(i==m)return INF*((j!=n) || (_k>k)); if(dp[i][j]!=-1)return dp[i][j]; int to=j; ll res=N; fore(k,i,m) { while((to<n) && i<=c[to] && c[to]<=k && i<=r[to] && r[to]<=k)to++; int add=sq(k-i+1); if(to==j)add=0; res=min(res,add+solve(k+1,to,_k+(add!=0))); } return dp[i][j]=res; } void doit(int _n,int _m,int _k,vector<int>_r,vector<int>_c) { n=_n; m=_m; k=_k; fore(i,0,n)r[i]=_r[i],c[i]=_c[i]; } ll take_photos(int n,int m,int k,vector<int>r,vector<int> c) { doit(n,m,k,r,c); return solve(0,0,0); } /* int main() {FIN; memset(dp,-1,sizeof(dp)); cin>>n>>m>>k; fore(i,0,n)cin>>r[i]>>c[i]; cout<<solve(0,0,0)<<"\n"; } */ /* 5 7 2 0 3 4 4 4 6 4 5 4 6 ---> 25 2 5 2 1 4 4 1 ---> 16 */
#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...