제출 #603776

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
603776		CyberCow	카니발 티켓 (IOI20_tickets)	C++17	11 / 100	3 ms	596 KiB

tickets

#include "tickets.h"
#include <vector>
#include <cmath>
using namespace std;
using ll = long long;
ll n;
ll qaq(vector<ll> qaqa)
{
	ll polni = 1000000000000000000LL;
	for (int i = 0; i < qaqa.size(); i++)
	{
		ll chsh = 0;
		for (int j = 0; j < qaqa.size(); j++)
		{
			chsh += abs(qaqa[i] - qaqa[j]);
		}
		polni = min(polni, chsh);
	}
	return polni;
}

long long find_maximum(int k, vector<vector<int>> x) {
	n = x.size();
	vector<ll>zibil;
	vector<vector<int>>ans(n, vector<int>(1, 0));
	for (int i = 0; i < n; i++) {
		zibil.push_back(x[i][0]);
	}
	allocate_tickets(ans);
	return qaq(zibil);
}

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

tickets.cpp: In function 'll qaq(std::vector<long long int>)':
tickets.cpp:10:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   10 |  for (int i = 0; i < qaqa.size(); i++)
      |                  ~~^~~~~~~~~~~~~
tickets.cpp:13:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   13 |   for (int j = 0; j < qaqa.size(); j++)
      |                   ~~^~~~~~~~~~~~~

• Subtask 1: 11 / 11
• Subtask 2: 0 / 16
• Subtask 3: 0 / 14
• Subtask 4: 0 / 14
• Subtask 5: 0 / 12
• Subtask 6: 0 / 23
• Subtask 7: 0 / 10