oj.uz

Submission #894672

# Submission time Handle Problem Language Result Execution time Memory
894672 2023-12-28T16:41:45 Z OAleksa Dragon 2 (JOI17_dragon2) C++14
60 / 100
 4000 ms 3976 KB 
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define f first
#define s second
const int N = 3e4 + 69;
struct point {
	int x, y;
};
point a[N];
point s, e;
int n, m, d1, e1, d2, e2, q, c[N];
vector<point> g[N];
int cross(point a, point b, point c) {
	point v = {b.x - a.x, b.y - a.y};
	point v1 = {c.x - a.x, c.y - a.y};
	int r = v1.x * v.y - v1.y * v.x;
	assert(r != 0);
	if (r > 0)
		return 1; //desno
	return -1; //levo
}
signed main() {
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
  int tt = 1;
  //cin >> tt;
  while (tt--) {
		cin >> n >> m;
		for (int i = 1;i <= n;i++) {
			cin >> a[i].x >> a[i].y >> c[i];
			g[c[i]].push_back(a[i]);
		}
		cin >> s.x >> s.y >> e.x >> e.y;
		cin >> q;
		while (q--) {
			int a, b;
			cin >> a >> b;
			int ans = 0;
			for (auto u : g[a]) {
				int d5 = cross(s, e, u);
				for (auto t : g[b]) {
					//ili je u trouglu
					//ili se seku duzi
					int d = cross(u, s, t);
					int d1 = cross(s, e, t);
					int d2 = cross(e, u ,t);
					int d3 = cross(u, t, s);
					int d4 = cross(u, t, e);
					if (d == d1 && d1 == d2)
						++ans;
					else if (d3 != d4 && d5 != d1)
						++ans;
				}
			}
			cout << ans << '\n';
		}
  }
  return 0;
}

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 1372 KB Output is correct
2 Correct 34 ms 1372 KB Output is correct
3 Correct 41 ms 1368 KB Output is correct
4 Correct 30 ms 2232 KB Output is correct
5 Correct 21 ms 2264 KB Output is correct
6 Correct 2 ms 1372 KB Output is correct
7 Correct 2 ms 1372 KB Output is correct
8 Correct 12 ms 1372 KB Output is correct
9 Correct 11 ms 1372 KB Output is correct
10 Correct 12 ms 1372 KB Output is correct

Subtask #2
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 2015 ms 2976 KB Output is correct
2 Correct 3804 ms 3044 KB Output is correct
3 Correct 79 ms 3300 KB Output is correct
4 Correct 11 ms 3160 KB Output is correct
5 Correct 10 ms 3420 KB Output is correct
6 Correct 1503 ms 3056 KB Output is correct
7 Correct 1481 ms 3028 KB Output is correct
8 Correct 1066 ms 3276 KB Output is correct
9 Correct 1065 ms 2908 KB Output is correct
10 Correct 1064 ms 3080 KB Output is correct

Subtask #3
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 1372 KB Output is correct
2 Correct 34 ms 1372 KB Output is correct
3 Correct 41 ms 1368 KB Output is correct
4 Correct 30 ms 2232 KB Output is correct
5 Correct 21 ms 2264 KB Output is correct
6 Correct 2 ms 1372 KB Output is correct
7 Correct 2 ms 1372 KB Output is correct
8 Correct 12 ms 1372 KB Output is correct
9 Correct 11 ms 1372 KB Output is correct
10 Correct 12 ms 1372 KB Output is correct
11 Correct 2015 ms 2976 KB Output is correct
12 Correct 3804 ms 3044 KB Output is correct
13 Correct 79 ms 3300 KB Output is correct
14 Correct 11 ms 3160 KB Output is correct
15 Correct 10 ms 3420 KB Output is correct
16 Correct 1503 ms 3056 KB Output is correct
17 Correct 1481 ms 3028 KB Output is correct
18 Correct 1066 ms 3276 KB Output is correct
19 Correct 1065 ms 2908 KB Output is correct
20 Correct 1064 ms 3080 KB Output is correct
21 Correct 1985 ms 3068 KB Output is correct
22 Correct 3829 ms 3052 KB Output is correct
23 Correct 3441 ms 3336 KB Output is correct
24 Correct 839 ms 3976 KB Output is correct
25 Correct 48 ms 3716 KB Output is correct
26 Correct 31 ms 3932 KB Output is correct
27 Correct 13 ms 3420 KB Output is correct
28 Correct 11 ms 3584 KB Output is correct
29 Execution timed out 4062 ms 3796 KB Time limit exceeded
30 Halted 0 ms 0 KB -