제출 #170689

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
170689		isvara	화살표 그리기 (KOI18_arrowH)	C++14	100 / 100	45 ms	6008 KiB

arrow

#include<iostream>
#include<algorithm>
#include<queue>
#include<set>
#include<map>
#include<vector>
#include<string.h>
#include<math.h>
#include<stack>
#include<assert.h>
using namespace std;
typedef long long ll;

const int max_n =1e5+1;
 
int N;
vector<ll>points[max_n];
ll ans;
int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);

	cin >> N;

	for (int i = 0; i < N; i++)
	{
		ll coor, color;
		cin >> coor >> color;
		points[color].push_back(coor);
	}
	for (int i = 1; i <= N; i++)
		sort(points[i].begin(), points[i].end());
	
	for (int i = 1; i <= N; i++)
	{
		if (points[i].size() == 1 || points[i].size()==0)
			continue;

		for (int j = 1; j < points[i].size()-1; j++)
		{
			ll l = points[i][j - 1];
			ll r = points[i][j + 1];

			ans += min(r - points[i][j], points[i][j] - l);
		}
 		int e = points[i].size() - 1;
		ans += points[i][1] - points[i][0];
		ans += points[i][e] - points[i][e - 1];
	}
	cout << ans;
}

 

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

arrow.cpp: In function 'int main()':
arrow.cpp:41:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int j = 1; j < points[i].size()-1; j++)
                   ~~^~~~~~~~~~~~~~~~~~~~

• Subtask 1: 21 / 21
• Subtask 2: 12 / 12
• Subtask 3: 29 / 29
• Subtask 4: 38 / 38