Submission #399806

#TimeUsernameProblemLanguageResultExecution timeMemory
399806Dremix10Aliens (IOI16_aliens)C++17
0 / 100
2075 ms332 KiB
#include "aliens.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef pair<int,int> pi;
typedef pair<ll,ll> pl;
#define F first
#define S second
#define endl '\n'
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).size()
#ifdef dremix
    #define p(x) cerr<<#x<<" = "<<x<<endl;
    #define p2(x,y) cerr<<#x<<" , "<<#y<<" = "<<x<<" , "<<y<<endl;
    #define pp(x) cerr<<#x<<" = ("<<x.F<<" , "<<x.S<<")"<<endl;
    #define pv(x) cerr<<#x<<" = {";for(auto u : x)cerr<<u<<", ";cerr<<"}"<<endl;
    #define ppv(x) cerr<<#x<<" = {";for(auto u : x)cerr<<u.F<<"-"<<u.S<<", ";cerr<<"}"<<endl;
#else
    #define p(x) {}
    #define p2(x,y) {}
    #define pp(x) {}
    #define pv(x) {}
    #define ppv(x) {}
#endif
#define fastio ios_base::sync_with_stdio(false);cin.tie(nullptr);
const int maxp = 22;
const ld EPS = 1e-18;
const ll INF = 2e18;
const int MOD = 1e9+7;
const int N = 3e5+1;


int cnt;
int shuld;
int maxi;
int m;
bool cells[100][100] = {};
int pts[100][100] = {};

int solve(int k){
    if(shuld == cnt)
        return 0;
    if(k == maxi)
        return MOD;
    int i,j,ii,jj;
    int best = MOD;
    for(i=0;i<m;i++){
        /// point i,i start
        int cost = 0;
        vector<pi> used;
        for(j=i;j<m;j++){
            /// point j,j end
            for(ii=i;ii<=j;ii++){
                jj = j;
                if(!cells[ii][jj]){
                    cost++;
                    cells[ii][jj] = true;
                    used.push_back({ii,jj});
                    cnt += pts[ii][jj];
                }
            }
            for(jj=i;jj<=j;jj++){
                ii = j;
                if(!cells[ii][jj]){
                    cost++;
                    cells[ii][jj] = true;
                    used.push_back({ii,jj});
                    cnt += pts[ii][jj];
                }
            }
            best = min(best,solve(k+1) + cost);

        }
        for(auto x : used){
            cells[x.F][x.S] = false;
            cnt -= pts[x.F][x.S];
        }
    }
    return best;
}

long long take_photos(int n, int mm, int k, vector<int> r, vector<int> c) {
    int i,j;
    maxi = k;
    m = mm;
    shuld = n;
    for(i=0;i<n;i++){
        pts[r[i]][c[i]] ++;
    }
    return solve(0);

}

Compilation message (stderr)

aliens.cpp: In function 'long long int take_photos(int, int, int, std::vector<int>, std::vector<int>)':
aliens.cpp:85:11: warning: unused variable 'j' [-Wunused-variable]
   85 |     int i,j;
      |           ^
#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...