oj.uz

Submission #551894

# Submission time Handle Problem Language Result Execution time Memory
551894 2022-04-21T20:37:11 Z LucaDantas Dragon 2 (JOI17_dragon2) C++17
60 / 100
 4000 ms 3644 KB 
#include <bits/stdc++.h>
using namespace std;

constexpr int maxn = 30010;

struct Pt {
	int x, y;
	Pt(int _x = 0, int _y = 0) : x(_x), y(_y) {}
	long long operator/(const Pt& o) const { return 1ll * x * o.y - 1ll * y * o.x; }
	Pt operator-(const Pt& o) const { return Pt(x-o.x, y-o.y); }
};

bool cw(Pt a, Pt b, Pt c) { return (b-a)/(c-a) < 0; }
bool ccw(Pt a, Pt b, Pt c) { return (b-a)/(c-a) > 0; }

vector<Pt> tribe[maxn];

Pt v[2];

int main() {
	int n, m; scanf("%d %d", &n, &m);
	for(int i = 0; i < n; i++) {
		int a, b, t; scanf("%d %d %d", &a, &b, &t);
		tribe[t].push_back(Pt(a, b));
	}
	for(int i = 0; i < 2; i++) {
		int a, b; scanf("%d %d", &a, &b);
		v[i] = Pt(a, b);
	}
	int q; scanf("%d", &q);
	while(q--) {
		int a, b; scanf("%d %d", &a, &b);
		int ans = 0;
		for(Pt p1 : tribe[a]) {
			if(ccw(p1, v[0], v[1]))
				swap(v[0], v[1]);
			for(Pt p2 : tribe[b]) {
				ans += cw(p1, v[0], p2) && ccw(p1, v[1], p2);
			}
		}
		printf("%d\n", ans);
	}
}

Compilation message

dragon2.cpp: In function 'int main()':
dragon2.cpp:21:17: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   21 |  int n, m; scanf("%d %d", &n, &m);
      |            ~~~~~^~~~~~~~~~~~~~~~~
dragon2.cpp:23:21: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   23 |   int a, b, t; scanf("%d %d %d", &a, &b, &t);
      |                ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
dragon2.cpp:27:18: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   27 |   int a, b; scanf("%d %d", &a, &b);
      |             ~~~~~^~~~~~~~~~~~~~~~~
dragon2.cpp:30:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   30 |  int q; scanf("%d", &q);
      |         ~~~~~^~~~~~~~~~
dragon2.cpp:32:18: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   32 |   int a, b; scanf("%d %d", &a, &b);
      |             ~~~~~^~~~~~~~~~~~~~~~~

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 1108 KB Output is correct
2 Correct 19 ms 1108 KB Output is correct
3 Correct 24 ms 1168 KB Output is correct
4 Correct 40 ms 2040 KB Output is correct
5 Correct 35 ms 2184 KB Output is correct
6 Correct 2 ms 1148 KB Output is correct
7 Correct 3 ms 1108 KB Output is correct
8 Correct 6 ms 1088 KB Output is correct
9 Correct 5 ms 980 KB Output is correct
10 Correct 6 ms 1108 KB Output is correct

Subtask #2
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 1008 ms 2144 KB Output is correct
2 Correct 1817 ms 2028 KB Output is correct
3 Correct 49 ms 2252 KB Output is correct
4 Correct 11 ms 2060 KB Output is correct
5 Correct 13 ms 2388 KB Output is correct
6 Correct 996 ms 2004 KB Output is correct
7 Correct 987 ms 2004 KB Output is correct
8 Correct 534 ms 2004 KB Output is correct
9 Correct 432 ms 1864 KB Output is correct
10 Correct 494 ms 1876 KB Output is correct

Subtask #3
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 1108 KB Output is correct
2 Correct 19 ms 1108 KB Output is correct
3 Correct 24 ms 1168 KB Output is correct
4 Correct 40 ms 2040 KB Output is correct
5 Correct 35 ms 2184 KB Output is correct
6 Correct 2 ms 1148 KB Output is correct
7 Correct 3 ms 1108 KB Output is correct
8 Correct 6 ms 1088 KB Output is correct
9 Correct 5 ms 980 KB Output is correct
10 Correct 6 ms 1108 KB Output is correct
11 Correct 1008 ms 2144 KB Output is correct
12 Correct 1817 ms 2028 KB Output is correct
13 Correct 49 ms 2252 KB Output is correct
14 Correct 11 ms 2060 KB Output is correct
15 Correct 13 ms 2388 KB Output is correct
16 Correct 996 ms 2004 KB Output is correct
17 Correct 987 ms 2004 KB Output is correct
18 Correct 534 ms 2004 KB Output is correct
19 Correct 432 ms 1864 KB Output is correct
20 Correct 494 ms 1876 KB Output is correct
21 Correct 1002 ms 2004 KB Output is correct
22 Correct 1808 ms 2124 KB Output is correct
23 Correct 1924 ms 2356 KB Output is correct
24 Correct 549 ms 3200 KB Output is correct
25 Correct 54 ms 3396 KB Output is correct
26 Correct 47 ms 3644 KB Output is correct
27 Correct 16 ms 2900 KB Output is correct
28 Correct 16 ms 2840 KB Output is correct
29 Execution timed out 4054 ms 3488 KB Time limit exceeded
30 Halted 0 ms 0 KB -