제출 #599356

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
599356		gromperen	Aliens (IOI16_aliens)	C++14	0 / 100	1 ms	212 KiB

aliens

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

const int INF = 1e9+7;

using namespace std;

long long take_photos(int n, int m, int k, vector<int> r, vector<int> c) {
	/*
	vector<vector<int>> vis(m+1, vector<int>(m+1));
	int ans = 0;
	for (int i = 0; i < n; ++i) {
		for (int x = r[i]; x <= c[i]; ++x) {
			for (int y = r[i]; y <= c[i]; ++y) {
				if (vis[x][y]) continue;
				ans++;
				vis[x][y] = 1;
			}
		}
	}
	*/

	vector<pair<int,int>> tmpcords;
	vector<pair<int,int>> cords;
	for (int i = 0; i < n; ++i) {
		tmpcords.push_back({r[i], c[i]});
	}
	sort(tmpcords.begin(), tmpcords.end());
	for (int i = 0; i < n; ++i) {
		if (i > 0 && tmpcords[i].first == cords[i-1].first && tmpcords[i].second == cords[i-1].second) continue;
		cords.push_back(tmpcords[i]);
	}
	
	vector<vector<int>> dp(n+1, vector<int>(k+1, INF));
	n = cords.size();
	for (int i = 0; i < cords.size(); ++i) {
		dp[0][i] = 0;
	}

	for (int i = 1; i <= cords.size(); ++i) {
		for (int j =1; j <= k; ++j) {

			for (int p = 0; p < i; ++p) {
				dp[i][j] = min(dp[i][j], 
						dp[p][j-1] + 
						(cords[p].first - cords[i-1].second + 1) * (cords[p].first - cords[i-1].second + 1));
			}

		}
	}


    return dp[cords.size()][k];
}

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

aliens.cpp: In function 'long long int take_photos(int, int, int, std::vector<int>, std::vector<int>)':
aliens.cpp:36:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   36 |  for (int i = 0; i < cords.size(); ++i) {
      |                  ~~^~~~~~~~~~~~~~
aliens.cpp:40:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   40 |  for (int i = 1; i <= cords.size(); ++i) {
      |                  ~~^~~~~~~~~~~~~~~

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