Submission #137876

#TimeUsernameProblemLanguageResultExecution timeMemory
137876nashAliens (IOI16_aliens)C++14
0 / 100
2 ms256 KiB
#include <bits/stdc++.h> #include "aliens.h" using namespace std; long long int mnsquares = 1000000000; vector<int> r, c; int n; //tehere is no point having overlapping squares //at every point on the diagonal we have 2 choices - start a square here or not //if we do, try making the square any size between 1 and thew max long long int dp(int k, int m, int covered, int idx, vector<int> got){ if (k<0) return 100000000000; if (k==0 || idx==m){ //if (got==0) return 100000000000; for (int i=0;i<n;i++){ if (got[i]==0){ return 100000000000000; } } //cout << k << ' ' << idx << ' ' << covered << endl; return covered; //we made it pat the end } long long int ans = dp(k, m, covered, idx+1, got); //i is size of photo for (int i=1;i<=m-idx;i++){ vector<int> newgot=got; for (int a=0;a<n;a++){ if (r[a]>=idx && r[a]<=idx+i && c[a]>=idx && c[a]<=idx+i){ newgot[a]=1; } } ans=min(ans, dp(k-1, m, covered+((i+1)*(i+1)), idx+1, newgot)); } return ans; } long long int take_photos(int N, int m, int k, vector<int> R, vector<int> C){ n=N; r=R; c=C; return dp(k, m, 0, 0, vector<int> (N, 0)); } /* int main() { //cout << take_photos(5,7,2,vector<int> ({0,4,4,4,4}),vector<int> ({3,4,6,5,6})); //cout << take_photos(2,6,2,vector<int> ({1, 4}),vector<int> ({4, 1})); return 0; } */
#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...