oj.uz

답안 #170689

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
170689 2019-12-26T05:12:48 Z isvara 화살표 그리기 (KOI18_arrowH) C++14
100 / 100
 45 ms 6008 KB 
#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;
}

Compilation message

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.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 2680 KB Output is correct
2 Correct 4 ms 2680 KB Output is correct
3 Correct 4 ms 2680 KB Output is correct
4 Correct 4 ms 2680 KB Output is correct
5 Correct 4 ms 2680 KB Output is correct
6 Correct 4 ms 2680 KB Output is correct
7 Correct 4 ms 2680 KB Output is correct
8 Correct 4 ms 2680 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 2680 KB Output is correct
2 Correct 4 ms 2680 KB Output is correct
3 Correct 4 ms 2680 KB Output is correct
4 Correct 4 ms 2680 KB Output is correct
5 Correct 4 ms 2680 KB Output is correct
6 Correct 4 ms 2680 KB Output is correct
7 Correct 4 ms 2680 KB Output is correct
8 Correct 4 ms 2680 KB Output is correct
9 Correct 4 ms 2680 KB Output is correct
10 Correct 4 ms 2680 KB Output is correct
11 Correct 4 ms 2808 KB Output is correct
12 Correct 4 ms 2808 KB Output is correct
13 Correct 5 ms 2680 KB Output is correct
14 Correct 4 ms 2680 KB Output is correct
15 Correct 4 ms 2808 KB Output is correct
16 Correct 5 ms 2808 KB Output is correct

Subtask #3
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 2680 KB Output is correct
2 Correct 4 ms 2680 KB Output is correct
3 Correct 4 ms 2680 KB Output is correct
4 Correct 4 ms 2680 KB Output is correct
5 Correct 4 ms 2680 KB Output is correct
6 Correct 4 ms 2680 KB Output is correct
7 Correct 4 ms 2680 KB Output is correct
8 Correct 4 ms 2680 KB Output is correct
9 Correct 4 ms 2680 KB Output is correct
10 Correct 4 ms 2680 KB Output is correct
11 Correct 4 ms 2808 KB Output is correct
12 Correct 4 ms 2808 KB Output is correct
13 Correct 5 ms 2680 KB Output is correct
14 Correct 4 ms 2680 KB Output is correct
15 Correct 4 ms 2808 KB Output is correct
16 Correct 5 ms 2808 KB Output is correct
17 Correct 7 ms 2936 KB Output is correct
18 Correct 7 ms 2936 KB Output is correct
19 Correct 8 ms 2940 KB Output is correct
20 Correct 7 ms 2936 KB Output is correct
21 Correct 6 ms 2940 KB Output is correct
22 Correct 6 ms 2936 KB Output is correct
23 Correct 7 ms 2936 KB Output is correct
24 Correct 7 ms 2936 KB Output is correct

Subtask #4
38.0 / 38.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 2680 KB Output is correct
2 Correct 4 ms 2680 KB Output is correct
3 Correct 4 ms 2680 KB Output is correct
4 Correct 4 ms 2680 KB Output is correct
5 Correct 4 ms 2680 KB Output is correct
6 Correct 4 ms 2680 KB Output is correct
7 Correct 4 ms 2680 KB Output is correct
8 Correct 4 ms 2680 KB Output is correct
9 Correct 4 ms 2680 KB Output is correct
10 Correct 4 ms 2680 KB Output is correct
11 Correct 4 ms 2808 KB Output is correct
12 Correct 4 ms 2808 KB Output is correct
13 Correct 5 ms 2680 KB Output is correct
14 Correct 4 ms 2680 KB Output is correct
15 Correct 4 ms 2808 KB Output is correct
16 Correct 5 ms 2808 KB Output is correct
17 Correct 7 ms 2936 KB Output is correct
18 Correct 7 ms 2936 KB Output is correct
19 Correct 8 ms 2940 KB Output is correct
20 Correct 7 ms 2936 KB Output is correct
21 Correct 6 ms 2940 KB Output is correct
22 Correct 6 ms 2936 KB Output is correct
23 Correct 7 ms 2936 KB Output is correct
24 Correct 7 ms 2936 KB Output is correct
25 Correct 45 ms 6008 KB Output is correct
26 Correct 35 ms 5212 KB Output is correct
27 Correct 41 ms 5596 KB Output is correct
28 Correct 34 ms 5240 KB Output is correct
29 Correct 41 ms 5624 KB Output is correct
30 Correct 37 ms 5108 KB Output is correct
31 Correct 35 ms 5240 KB Output is correct
32 Correct 43 ms 5672 KB Output is correct