Submission #1152428

#	Time	Username	Problem	Language	Result	Execution time	Memory
1152428		gelastropod	Geometrija (COCI21_geometrija)	C++20	0 / 110	3 ms	328 KiB

geometrija

#include <bits/stdc++.h>
using namespace std;
#define int long long

signed main() {
	int n, a, b;
	cin >> n;
	vector<pair<int, int>> points;
	for (int i = 0; i < n; i++) {
		cin >> a >> b;
		points.push_back({ a, b });
	}
	int ans = 0;
	for (int i = 0; i < n; i++) {
		for (int j = i + 1; j < n; j++) {
			int small = min(points[i].first, points[j].first);
			int big = max(points[i].first, points[j].first);
			bool works = true;
			for (int k = 0; k < n; k++) {
				for (int l = k + 1; l < n; l++) {
					int osmall = min(points[k].first, points[l].first);
					int obig = max(points[k].first, points[l].first);
					if (i == k || j == k || i == l || j == l) continue;
					long double m1 = ((long double)points[j].second - points[i].second) / (points[j].first - points[i].first);
					long double m2 = ((long double)points[l].second - points[k].second) / (points[l].first - points[k].first);
					long double c1 = (long double)points[i].second - m1 * points[i].first;
					long double c2 = (long double)points[k].second - m2 * points[k].first; 
					if (m1 == m2) continue;
					long double x = (c2 - c1) / (m1 - m2);
					if (small < x && x < big && osmall < x && x < obig) {
						works = false;
						break;
					}
				}
				if (!works) break;
			}
			ans += works;
		}
	}
	cout << ans << '\n';
}

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