제출 #302387

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
302387		square1001	도시들 (IOI15_towns)	C++14	0 / 100	19 ms	512 KiB

towns

#include "towns.h"
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
int hubDistance(int N, int sub) {
	if(sub <= 2) {
		vector<int> da(N);
		for(int i = 1; i < N; ++i) {
			da[i] = getDistance(0, i);
		}
		int ma = max_element(da.begin(), da.end()) - da.begin();
		vector<int> db(N);
		for(int i = 0; i < N; ++i) {
			if(i != ma) {
				db[i] = getDistance(ma, i);
			}
		}
		int mb = max_element(db.begin(), db.end()) - db.begin();
		return db[mb];
	}
	else {
		// write code here
	}
	return 0;
}

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

towns.cpp: In function 'int hubDistance(int, int)':
towns.cpp:12:46: warning: conversion from '__gnu_cxx::__normal_iterator<int*, std::vector<int> >::difference_type' {aka 'long int'} to 'int' may change value [-Wconversion]
   12 |   int ma = max_element(da.begin(), da.end()) - da.begin();
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
towns.cpp:19:46: warning: conversion from '__gnu_cxx::__normal_iterator<int*, std::vector<int> >::difference_type' {aka 'long int'} to 'int' may change value [-Wconversion]
   19 |   int mb = max_element(db.begin(), db.end()) - db.begin();
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~

• Subtask 1: 0 / 13
• Subtask 2: 0 / 12
• Subtask 3: 0 / 13
• Subtask 4: 0 / 10
• Subtask 5: 0 / 13
• Subtask 6: 0 / 39