Submission #1303285

#TimeUsernameProblemLanguageResultExecution timeMemory
1303285Mamikonm1Aliens (IOI16_aliens)C++17
Compilation error
0 ms0 KiB
#include<bits//stdc++.h>
//#include "aliens.h"
using namespace std;
using ll = long long;
#define mk make_pair
#define V vector
const ll inf=1e18;
long long take_photos(int n, int m, int k, std::vector<int> r, std::vector<int> c) {
    V<int>ind(n);
    for(int i=0;i<n;++i)ind[i]=i;
    auto cmp=[&](int i,int j){
      if(max(r[i],c[i])==max(r[j],c[j]))return min(r[i],c[i])<min(r[j],c[j]);
      return max(r[i],c[i])<max(r[j],c[j]);
    };
    sort(begin(ind),end(ind),cmp);
    ind.insert(begin(ind),n);
    r.push_back(-1);
    c.push_back(-1);
    V<V<ll>>dp(n+1,V<ll>(k+1,inf));
    dp[0][0]=0;
    for(int it=1,ni,mx;it<=n;++it){
        ni=ind[it];
        for(int j=0;j<k;++j){
            mx=0;
            for(int t=it,nt;t<=n;++t){
                nt=ind[t];
                mx=max({mx,r[nt],c[nt]});
                dp[t][j+1]=min(dp[t][j+1],dp[it-1][j]+(ll)pow(mx-min(r[ni],c[ni])+1,2)+(mk(r[nt],c[nt])==mk(r[ni],c[ni]?-1:0)));
            }
        }
    }
    return *min_element(begin(dp[n]),end(dp[n]));
}

int main() {
    int n, m, k;
    assert(3 == scanf("%d %d %d", &n, &m, &k));
    std::vector<int> r(n), c(n);
    for (int i = 0; i < n; i++) {
        assert(2 == scanf("%d %d", &r[i], &c[i]));
    }
    long long ans = take_photos(n, m, k, r, c);
    
    
    printf("%lld\n", ans);
    return 0;
}

Compilation message (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
      |         ^~~~
/usr/bin/ld: /tmp/ccwMAwX2.o: in function `main':
grader.cpp:(.text.startup+0x0): multiple definition of `main'; /tmp/ccT3RG8A.o:aliens.cpp:(.text.startup+0x0): first defined here
collect2: error: ld returned 1 exit status