제출 #100933

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
100933		E869120	The Forest of Fangorn (CEOI14_fangorn)	C++14	80 / 100	3017 ms	64868 KiB

fangorn

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

struct Point {
	long long px, py;
};

int shogen(Point p1) {
	if (p1.px >= 0 && p1.py >= 0) return 1;
	if (p1.px < 0 && p1.py >= 0) return 2;
	if (p1.px < 0 && p1.py < 0) return 3;
	if (p1.px >= 0 && p1.py < 0) return 4;
}

bool operator<(const Point &a1, const Point &a2) {
	int v1 = shogen(a1), v2 = shogen(a2);
	if (v1 < v2) return true;
	if (v1 > v2) return false;

	if (a1.px*a2.py > a1.py*a2.px) return true;
	return false;
}

vector<Point>V[2009]; int H, W, sx, sy, N, C, ex[10009], ey[10009];
Point G[2009];

vector<int> solve(long long cx, long long cy) {
	vector<int>ans;
	for (int i = 1; i <= N; i++) {
		int pos1 = lower_bound(V[i].begin(), V[i].end(), Point{ cx - G[i].px, cy - G[i].py }) - V[i].begin();
		if (pos1 == N - 1) pos1 = 0;
		ans.push_back(pos1);
	}
	return ans;
}

int main() {
	cin >> H >> W >> sx >> sy >> C;
	for (int i = 1; i <= C; i++) cin >> ex[i] >> ey[i];
	cin >> N;
	for (int i = 1; i <= N; i++) cin >> G[i].px >> G[i].py;
	for (int i = 1; i <= N; i++) {
		for (int j = 1; j <= N; j++) {
			if (i == j) continue;
			V[i].push_back(Point{ G[i].px - G[j].px, G[i].py - G[j].py });
		}
		sort(V[i].begin(), V[i].end());
	}

	vector<int>vec = solve(sx, sy);

	vector<int>res;
	for (int i = 1; i <= C; i++) {
		vector<int>vec2 = solve(ex[i], ey[i]);
		if (vec == vec2) res.push_back(i);
	}
	cout << res.size() << endl;
	for (int i = 0; i < res.size(); i++) { if (i) cout << " "; cout << res[i]; } cout << endl;
	return 0;
}

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

fangorn.cpp: In function 'int main()':
fangorn.cpp:60:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < res.size(); i++) { if (i) cout << " "; cout << res[i]; } cout << endl;
                  ~~^~~~~~~~~~~~
fangorn.cpp: In function 'int shogen(Point)':
fangorn.cpp:15:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^

• Subtask 1: 30 / 30
• Subtask 2: 20 / 20
• Subtask 3: 30 / 30
• Subtask 4: 0 / 20