제출 #1212803

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1212803		Zbyszek99	Aliens (IOI16_aliens)	C++20	0 / 100	0 ms	328 KiB

aliens

#include "aliens.h"
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long
#define ld long double
#define ull unsigned long long
#define ff first
#define ss second
#define pii pair<int,int>
#define pll pair<long long, long long>
#define vi vector<int>
#define vl vector<long long>
#define pb push_back
#define rep(i, b) for(int i = 0; i < (b); ++i)
#define rep2(i,a,b) for(int i = a; i <= (b); ++i)
#define rep3(i,a,b,c) for(int i = a; i <= (b); i+=c)
#define count_bits(x) __builtin_popcountll((x))
#define all(x) (x).begin(),(x).end()
#define siz(x) (int)(x).size()
#define forall(it,x) for(auto& it:(x))
using namespace __gnu_pbds;
using namespace std;
typedef tree<int, null_type, less<int>, rb_tree_tag,tree_order_statistics_node_update> ordered_set;
mt19937 mt;void random_start(){mt.seed(chrono::time_point_cast<chrono::milliseconds>(chrono::high_resolution_clock::now()).time_since_epoch().count());}
ll los(ll a, ll b) {return a + (mt() % (b-a+1));}
const int INF = 1e9+50;
const ll INF_L = 1e18+40;
const ll MOD = 1e9+7;

ll dp[501][501];

vector<pll> get_real_points(vector<pll> p)
{
    rep(i,siz(p)) p[i].ss *= -1;
    sort(all(p));
    rep(i,siz(p)) p[i].ss *= -1;
    int cur_max = -1e9;
    vector<pll> ans = {{-1,-1}};
    forall(it,p)
    {
        if(it.ss > cur_max)
        {
            ans.pb(it);
            cur_max = it.ss;
        }
    }
    return ans;
}

ll take_photos(int n, int m, int k, vi r, vi c) 
{
    vector<pll> points;
    rep(i,n)
    {
        if(c[i] - r[i] < 0)
        {
            points.pb({c[i],r[i]});
        }
        else
        {
            points.pb({r[i],c[i]});
        }
    }
    points = get_real_points(points);
    n = siz(points)-1;
    rep2(i,1,n) dp[i][0] = 1e17;
    dp[0][0] = 0;
    rep2(kk,1,k)
    {
        rep2(i,1,n)
        {
            dp[i][kk] = (points[i].ss - points[1].ff+1) * (points[i].ss - points[1].ff+1);
            for(int prev = i-1; prev >= 1; prev--)
            {
                dp[i][kk] = min(dp[i][kk],dp[prev][kk-1] + (points[i].ss - points[prev+1].ff+1) * (points[prev+1].ss - points[prev+1].ff+1) - max(0LL,(points[prev].ss - points[prev+1].ff+1) * (points[prev].ss - points[prev+1].ff+1)));
            }
        }
    }
    return dp[n][k];
}

컴파일 시 표준 에러 (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: 0 / 4
• Subtask 2: 0 / 12
• Subtask 3: 0 / 9
• Subtask 4: 0 / 16
• Subtask 5: 0 / 19
• Subtask 6: 0 / 40