제출 #1222911

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1222911		Malix	Aliens (IOI16_aliens)	C++20	25 / 100	48 ms	2376 KiB

aliens

#include "aliens.h"
#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vii;
typedef pair<int,int> pi;
typedef vector<pi> pii;
typedef tuple<int,int,int> ti;
typedef vector<ll> li;
typedef vector<li> lii;
 
#define REP(i,a,b) for(int i=a;i<b;i++)
#define F first
#define S second
#define PB push_back
#define LSOne(s) ((s)&(-s))
#define all(x) (x).begin(),(x).end()
 
ll INF=1000000000000000010;
int inf=1e9+10;
ll M=1e9+7;

ll dp[500][501];
vector<pi> a;

ll dist(int p,int q){
    ll x=a[p].F,y=a[q].S;
    ll val=(y-x+1)*(y-x+1);
    if(p!=0){
        ll z=a[p-1].S-a[p].F+1;
        if(z>0)val-=z*z;
    }
    return val;
}

long long take_photos(int n, int m, int k, std::vector<int> r, std::vector<int> c) {
    REP(i,0,n)a.PB({max(r[i],c[i]),min(r[i],c[i])});
    sort(all(a));reverse(all(a));
    int pos=0;
    while(pos+1<a.size()){
        if(a[pos].S<=a[pos+1].S)a.erase(a.begin()+pos+1);
        else pos++;
    }
    pos=0;
    REP(i,0,n)swap(a[i].F,a[i].S);
    reverse(all(a));
    while(pos+1<a.size()){
        if(a[pos].S==a[pos+1].S&&a[pos].F<=a[pos+1].S)a.erase(a.begin()+pos+1);
        else pos++;
    }
    n=a.size();
    REP(i,0,500)REP(j,0,501)dp[i][j]=INF;
    REP(i,0,n)dp[i][1]=dist(0,i);
    REP(i,0,n-1)REP(j,1,k)if(dp[i][j]!=INF)REP(x,i+1,n)dp[x][j+1]=min(dp[x][j+1],dp[i][j]+dist(i+1,x));
    ll ans=INF;
    REP(i,1,k+1)ans=min(ans,dp[n-1][i]);
    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
      |         ^~~~

• Subtask 1: 4 / 4
• Subtask 2: 12 / 12
• Subtask 3: 9 / 9
• Subtask 4: 0 / 16
• Subtask 5: 0 / 19
• Subtask 6: 0 / 40