제출 #943215

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
943215		shoryu386	Road Construction (JOI21_road_construction)	C++17	5 / 100	4517 ms	2097152 KiB

road_construction

#include <bits/stdc++.h>
using namespace std;

#define int long long

main(){
	int n, k; cin >> n >> k;
	
	pair<int, int> arr[n];
	for (int x = 0; x < n; x++){
		cin >> arr[x].first >> arr[x].second;
	}
	
	//consider manhattan distance trick?
	for (int x = 0; x < n; x++){
		arr[x] = {arr[x].first + arr[x].second, arr[x].first - arr[x].second};
	}
	
	//now chebyshev distance, dist = max of difference
	
	//I want to bsearch, but bsearch only gives location of boundary; I need sum of boundary
	
	//subtask first ig
	vector<int> clown;
	for (int x = 0; x < n; x++){
		for (int y = x+1; y < n; y++){
			clown.push_back(max( abs(arr[x].first - arr[y].first), abs(arr[x].second - arr[y].second) ));
		}
	}
	
	int ans = 0;
	sort(clown.begin(), clown.end());
	for (int x = 0; x < k; x++) cout << clown[x] << '\n';
}

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

road_construction.cpp:6:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
    6 | main(){
      | ^~~~
road_construction.cpp: In function 'int main()':
road_construction.cpp:31:6: warning: unused variable 'ans' [-Wunused-variable]
   31 |  int ans = 0;
      |      ^~~

• Subtask 1: 5 / 5
• Subtask 2: 0 / 6
• Subtask 3: 0 / 7
• Subtask 4: 0 / 20
• Subtask 5: 0 / 27
• Subtask 6: 0 / 35