제출 #1192750

#제출 시각아이디문제언어결과실행 시간메모리
1192750simona1230Aliens (IOI16_aliens)C++20
0 / 100
2 ms328 KiB
#include "aliens.h" #include <bits/stdc++.h> using namespace std; int num; pair<int,int> p[200001]; bool cmp(pair<int,int> p1,pair<int,int> p2) { if(p1.second==p2.second)return p1.first<p2.first; return p1.second<p2.second; } long long sq(long long x) { return x*x; } long long dp[50001][2]; long long opt[50001][2]; long long take_photos(int n, int m, int k, std::vector<int> r, std::vector<int> c) { for(int i=0; i<n; i++) p[i]= {min(r[i],c[i]),max(r[i],c[i])}; sort(p,p+n,cmp); for(int i=0; i<n; i++) { if(i!=0&&p[i].second==p[i-1].second)continue; while(num!=0&&p[num-1].first>=p[i].first)num--; p[num++]=p[i]; } /*cout<<num<<endl; for(int i=0;i<num;i++) cout<<p[i].first<<" "<<p[i].second<<endl;*/ for(int i=0; i<num; i++) { for(int j=0; j<=k; j++) { dp[i][j]=1e18; } } long long ans=1e18; for(int i=0;i<num;i++) { dp[i][1]=sq(p[i].second-p[0].first+1); opt[i][1]=1; } ans=dp[num-1][1]; int old=0,now=1; for(int j=2; j<=k; j++) { swap(old,now); for(int i=0; i<num; i++) { dp[i][now]=1e18; for(int l=opt[i][old]; l<=i; l++) { long long rem=0; if(p[l].first<=p[l-1].second)rem=sq(p[l-1].second-p[l].first+1); long long h=dp[l-1][old]+sq(p[i].second-p[l].first+1)-rem; h=min(h,(long long)1e18); dp[i][now]=min(dp[i][now],h); //cout<<h<<" "; if(dp[i][now]==h)opt[i][now]=l; //else {opt[i][j]=l-1;break;} } //cout<<maxx<<" !"<<endl;; //cout<<i<<" "<<j<<" "<<dp[i][j]<<endl; if(i==num-1)ans=min(ans,dp[i][now]); } //cout<<endl; } return ans; }

컴파일 시 표준 에러 (stderr) 메시지

aliens.h:1:9: warning: #pragma once in main file
    1 | #pragma once
      |         ^~~~
aliens_c.h:1:9: warning: #pragma once in main file
    1 | #pragma once
      |         ^~~~
#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...