oj.uz

답안 #348176

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
348176 2021-01-14T10:17:33 Z Markomafko972 Fence (CEOI08_fence) C++14
100 / 100
 2 ms 364 KB 
#include <bits/stdc++.h>
#define X first
#define Y second
#define pb push_back
#define pii pair<int, int>
typedef long long ll;
using namespace std;

const int MOD = 1e9 + 7;
const ll INF = 1e18;
const int OFF = (1 << 20);

int n, m;
pii holes[105];
pii trees[105];
int dist[105][105];
vector<pii> ljuska;
vector<pii> drva;

int ccw(pii a, pii b, pii c) {
	return a.X * (b.Y - c.Y) + b.X * (c.Y - a.Y) + c.X * (a.Y - b.Y);
}

int main () {

	cin >> n >> m;
	for (int i = 0; i < n; i++) cin >> holes[i].X >> holes[i].Y;
	for (int i = 0; i < m; i++) cin >> trees[i].X >> trees[i].Y;
	
	
	sort(holes, holes + n);
	ljuska.push_back(holes[0]);
	ljuska.push_back(holes[1]);
	for (int i = 2; i < n; i++) {
		while (ljuska.size() > 1 && ccw(ljuska[(int)ljuska.size()-2], ljuska.back(), holes[i]) >= 0) ljuska.pop_back();
		ljuska.push_back(holes[i]);
	}
	
	int kol = ljuska.size();
	for (int i = n-2; i >= 0; i--) {
		while (ljuska.size() > kol && ccw(ljuska[(int)ljuska.size()-2], ljuska.back(), holes[i]) >= 0) ljuska.pop_back();
		if (i > 0) ljuska.push_back(holes[i]);
	}
	
	for (int i = 0; i < m; i++) {
		int da = 1;
		if (ccw(ljuska.back(), ljuska[0], trees[i]) >= 0) da = 0;
		
		for (int j = 1; j < ljuska.size(); j++) {
			if (ccw(ljuska[j-1], ljuska[j], trees[i]) >= 0) {
				da = 0;
				break;
			}
		}
		
		if (da) drva.push_back(trees[i]);
	}
	
	if (drva.size() == 0) {
		cout << m*111;
		return 0;
	}
	
	//for (int i = 0; i < ljuska.size(); i++) cout << ljuska[i].X << " " << ljuska[i].Y << endl;
	
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < n; j++) {
			int da = 1;
			for (int k = 0; k < drva.size(); k++) {
				if (ccw(holes[i], holes[j], drva[k]) >= 0) {
					da = 0;
					break;
				}
			}
			
			if (i != j && da) {
				dist[i][j] = 1;
			}
			else {
				dist[i][j] = 1e6;
			}
		}
	}
	
	for (int k = 0; k < n; k++) {
		for (int i = 0; i < n; i++) {
			for (int j = 0; j < n; j++) {
				dist[i][j] = min(dist[i][j], dist[i][k]+dist[k][j]);
			}
		}
	}
	
	int mini = 1e9;
	for (int i = 0; i < n; i++) mini = min(mini, dist[i][i]);
	
	cout << 111*(m-drva.size())+mini*20;

	return 0;
}

Compilation message

fence.cpp: In function 'int main()':
fence.cpp:41:24: warning: comparison of integer expressions of different signedness: 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   41 |   while (ljuska.size() > kol && ccw(ljuska[(int)ljuska.size()-2], ljuska.back(), holes[i]) >= 0) ljuska.pop_back();
      |          ~~~~~~~~~~~~~~^~~~~
fence.cpp:49:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   49 |   for (int j = 1; j < ljuska.size(); j++) {
      |                   ~~^~~~~~~~~~~~~~~
fence.cpp:69:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   69 |    for (int k = 0; k < drva.size(); k++) {
      |                    ~~^~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct

Subtask #5
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct

Subtask #6
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct

Subtask #7
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct

Subtask #8
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct

Subtask #9
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct

Subtask #10
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct