제출 #743815

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
743815		baojiaopisu	Aliens (IOI16_aliens)	C++14	25 / 100	138 ms	4436 KiB

aliens

#include "aliens.h"
#include<bits/stdc++.h>

using namespace std;

using ll = long long;
using ld = long double;
using ull = unsigned long long;

using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pld = pair<ld, ld>;

#define fi first
#define se second
#define left BAO
#define right ANH
#define pb push_back
#define pf push_front
#define mp make_pair
#define ins insert
#define btpc __builtin_popcount
#define btclz __builtin_clz

#define sz(x) (int)(x.size());
#define all(x) x.begin(), x.end()
#define debug(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

int d4x[4] = {1, 0, -1, 0}; int d4y[4] = {0, 1, 0, -1};
int d8x[8] = {0, 1, 1, 1, 0, -1, -1, -1};
int d8y[8] = {1, 1, 0, -1, -1, -1, 0, 1};

template<class X, class Y>
    bool minimize(X &x, const Y &y) {
        if (x > y)
        {
            x = y;
            return true;
        }
        return false;
    }
template<class X, class Y>
    bool maximize(X &x, const Y &y) {
        if (x < y)
        {
            x = y;
            return true;
        }
        return false;
    }

const int MOD = 1e9 + 7; //998244353

template<class X, class Y>
	void add(X &x, const Y &y) {
		x = (x + y);
		if(x >= MOD) x -= MOD;
	}

template<class X, class Y> 
	void sub(X &x, const Y &y) {
		x = (x - y);
		if(x < 0) x += MOD;
	}

/* Author : Le Ngoc Bao Anh, 12A5, LQD High School for Gifted Student*/

const ll INF = 1e9;
const int N = 1e6 + 10;

ll dp[505][505];
int g[N];

ll take_photos(int n, int m, int k, vector<int> x, vector<int> y) {
	vector<pii> point, npoint;
	for(int i = 0; i < m; i++) g[i] = INF;

	for(int i = 0; i < n; i++) {
		if(y[i] > x[i]) swap(x[i], y[i]);
		minimize(g[x[i]], y[i]);
	}

	for(int i = 0; i < m; i++) if(g[i] <= m) point.pb({i, g[i]}); 

	sort(all(point));

	int D = INF;
	for(int i = point.size() - 1; i >= 0; i--) {
		if(point[i].se >= D) continue;
		npoint.pb(point[i]);
		D = point[i].se;
	}

	point = npoint;
	sort(all(point));
	for(int i = 0; i <= point.size(); i++) {
		for(int j = 0; j <= k; j++) dp[i][j] = INF;
	}
	
	ll ans = INF;
	for(int i = 0; i < point.size(); i++) {
		if(i == 0) {
			ll d = (point[i].fi - point[i].se + 1);
			dp[i][1] = d * d;
			if(i == point.size() - 1) minimize(ans, d * d);
			continue;
		}	

		for(int j = 1; j <= k; j++) {
			for(int t = i; t >= 0; t--) {
				ll d = point[i].fi - point[i].se + 1 + point[i].se - point[t].se;
				ll cost = d * d;
				if(t > 0) {
					if(point[t - 1].fi >= point[t].se) {
						ll d = point[t - 1].fi - point[t].se + 1;
						cost -= d * d;
					} 
					cost += dp[t - 1][j - 1];
				} 
				minimize(dp[i][j], cost);
				if(i == point.size() - 1) minimize(ans, cost);
			}
		}
	}

	return ans;
}

컴파일 시 표준 에러 (stderr) 메시지

aliens.cpp: In function 'll take_photos(int, int, int, std::vector<int>, std::vector<int>)':
aliens.cpp:98:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   98 |  for(int i = 0; i <= point.size(); i++) {
      |                 ~~^~~~~~~~~~~~~~~
aliens.cpp:103:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  103 |  for(int i = 0; i < point.size(); i++) {
      |                 ~~^~~~~~~~~~~~~~
aliens.cpp:107:9: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  107 |    if(i == point.size() - 1) minimize(ans, d * d);
      |       ~~^~~~~~~~~~~~~~~~~~~
aliens.cpp:123:10: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  123 |     if(i == point.size() - 1) minimize(ans, cost);
      |        ~~^~~~~~~~~~~~~~~~~~~

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