#include <bits/stdc++.h>
using namespace std;
#define lli long long int
const int N = 1010;
int t, n, m, a, b;
const int INF = 1e5;
vector<pair<pair<int, int>, int> > holes, trees;
vector<pair<int, int> > holesOG;
vector<int>lowHull, upHull, possApples, all;
int ccw (pair<int, int>a, pair<int, int>b, pair<int, int>c) {
return (a.first*(b.second-c.second)+b.first*(c.second-a.second)+c.first*(a.second-b.second));
}
int dist[N][N];
void mHull () {
sort (holes.begin(), holes.end());
for (int i = 0; i < holes.size(); i++) {
while (lowHull.size() > 1 && ccw (holesOG[lowHull[lowHull.size()-2]], holesOG[lowHull[lowHull.size()-1]], holes[i].first) <= 0) {
lowHull.pop_back();
}
lowHull.push_back(holes[i].second);
}
reverse (holes.begin(), holes.end());
for (int i = 0; i < holes.size(); i++) {
while (upHull.size() > 1 && ccw (holesOG[upHull[upHull.size()-2]], holesOG[upHull[upHull.size()-1]], holes[i].first) <= 0) {
upHull.pop_back();
}
upHull.push_back(holes[i].second);
}
}
void checkApples () {
for (int j = 0; j < trees.size(); j++) {
int p1, p2;
int l=0;
for (int i = 0; i < lowHull.size()-1; i++) {
p1 = lowHull[i], p2 = lowHull[i+1];
if (ccw(holesOG[p1], holesOG[p2], trees[j].first) <= 0) {
l=1;
break;
}
}
for (int i = 0; i < upHull.size()-1; i++) {
p1 = upHull[i], p2 = upHull[i+1];
if (ccw(holesOG[p1], holesOG[p2], trees[j].first) <= 0) {
l=1;
break;
}
}
if (!l) possApples.push_back(j);
}
return;
}
bool allIn (int x, int y) {
int br1=0, br2=0;
for (int i = 0; i < possApples.size(); i++) {
if (ccw (holesOG[x], holesOG[y], trees[possApples[i]].first) <= 0) return false;
}
return true;
}
void checkEdges () {
for (int i = 0; i < all.size(); i++) {
for (int j = 0; j < all.size(); j++) {
if (i!=j && allIn(all[i], all[j])) {
dist[i][j]=1;
}
else {
dist[i][j]=INF;
}
}
}
return;
}
int mini;
void floyd () {
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]);
}
}
}
mini=INF;
for (int i = 0; i < n; i++) {
mini = min(mini, dist[i][i]);
}
return;
}
void solve () {
//cout << ccw (make_pair(800, 300), make_pair(600, 700), make_pair(200, 700));
cin >> n >> m;
for (int i = 0; i < n; i++) {
cin >> a >> b;
holes.push_back(make_pair(make_pair(a, b), i));
holesOG.push_back(make_pair(a, b));
}
for (int i = 0; i < m; i++) {
cin >> a >> b;
trees.push_back(make_pair(make_pair(a, b), i));
}
mHull ();
for (int i = 0; i < lowHull.size()-1; i++) all.push_back(lowHull[i]);
for (int i = 0; i < upHull.size()-1; i++) all.push_back(upHull[i]);
checkApples();
checkEdges();
floyd();
if (possApples.empty()) {
cout << trees.size()*111 << endl;
return;
}
cout << mini*20+(trees.size()-possApples.size())*111 << endl;
return;
}
int main () {
solve();
return 0;
}
Compilation message
fence.cpp: In function 'void mHull()':
fence.cpp:23:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<std::pair<int, int>, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
23 | for (int i = 0; i < holes.size(); i++) {
| ~~^~~~~~~~~~~~~~
fence.cpp:32:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<std::pair<int, int>, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
32 | for (int i = 0; i < holes.size(); i++) {
| ~~^~~~~~~~~~~~~~
fence.cpp: In function 'void checkApples()':
fence.cpp:42:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<std::pair<int, int>, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
42 | for (int j = 0; j < trees.size(); j++) {
| ~~^~~~~~~~~~~~~~
fence.cpp:45:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
45 | for (int i = 0; i < lowHull.size()-1; i++) {
| ~~^~~~~~~~~~~~~~~~~~
fence.cpp:52:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
52 | for (int i = 0; i < upHull.size()-1; i++) {
| ~~^~~~~~~~~~~~~~~~~
fence.cpp: In function 'bool allIn(int, int)':
fence.cpp:66:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
66 | for (int i = 0; i < possApples.size(); i++) {
| ~~^~~~~~~~~~~~~~~~~~~
fence.cpp:65:9: warning: unused variable 'br1' [-Wunused-variable]
65 | int br1=0, br2=0;
| ^~~
fence.cpp:65:16: warning: unused variable 'br2' [-Wunused-variable]
65 | int br1=0, br2=0;
| ^~~
fence.cpp: In function 'void checkEdges()':
fence.cpp:73:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
73 | for (int i = 0; i < all.size(); i++) {
| ~~^~~~~~~~~~~~
fence.cpp:74:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
74 | for (int j = 0; j < all.size(); j++) {
| ~~^~~~~~~~~~~~
fence.cpp: In function 'void solve()':
fence.cpp:116:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
116 | for (int i = 0; i < lowHull.size()-1; i++) all.push_back(lowHull[i]);
| ~~^~~~~~~~~~~~~~~~~~
fence.cpp:117:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
117 | for (int i = 0; i < upHull.size()-1; i++) all.push_back(upHull[i]);
| ~~^~~~~~~~~~~~~~~~~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
364 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
364 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
1 ms |
364 KB |
Output isn't correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
1 ms |
364 KB |
Output isn't correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
364 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
1 ms |
492 KB |
Output isn't correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
1 ms |
492 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
1 ms |
620 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
1 ms |
620 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
3 ms |
748 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
