oj.uz

답안 #314444

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
314444 2020-10-19T23:57:35 Z MetB Dragon 2 (JOI17_dragon2) C++14
60 / 100
 4000 ms 37300 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
 
using namespace __gnu_pbds;
 
#define N 200001
 
using namespace std;
 
 
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
 
const ll INF = 1e18, MOD = 1e9 + 7, MOD2 = 1e6 + 3;
 
struct Pt {
	ll x, y;
 
	Pt (int x, int y) : x (x), y (y) {}
	Pt () : x (0), y (0) {}
 
	ll cross (const Pt& b) const { return x * b.y - b.x * y; }
	bool operator < (const Pt& b) const { return cross (b) < 0; }
	Pt operator - (const Pt& b) const { return Pt (x - b.x, y - b.y); }
	Pt operator - () const { return Pt (-x, -y); }
} s, e;
 
bool OO = true;

vector <int> vs[N];
Pt p[N], pe[N], ps[N];
 
vector < pair <Pt, int> > ords, orde;

unordered_map <int, ll> qu[N];
 
ll big[N], sz[N];
int n, m, q, bl = 400, refl[N], g[N];
 
struct BIT {
	int n;
	vector <int> t;

	BIT () {}
	BIT (int n) : n (n), t (vector <int> (n + 1)) {}
 
	void update (int x, int d) {
		for (; x <= n; x = (x | (x + 1)))
			t[x] += d;
	}
 
	int get (int r) {
		int sum = 0;
 
		for (; r >= 0; r = (r & (r + 1)) - 1)
			sum += t[r];
 
		return sum;
	}
 
	int get (int l, int r) { return get (r) - get (l - 1); }
} t1 (N), t2 (N);

int find_e (Pt x) {
	return lower_bound (orde.begin(), orde.end(), make_pair (x,-1)) - orde.begin ();
}

void attack_to (int to) {
	for (int i : vs[to]) {
		int x = ords[i].second;
		if (!refl[x]) {
			t2.update (find_e (pe[x]), 1);
			if (OO) cout << "t2 Adding " << pe[i].x << ' ' << pe[i].y << ' ' << find_e (pe[i]) << endl;
		}
	}

	for (int i = 0; i < n; i++) {
		int x = ords[i].second, tribe = g[x];
		int ind = find_e (pe[x]);

		if (tribe == to) {
			if (!refl[x]) t2.update (ind, -1);
			else t1.update (ind, 1);
			continue;		
		}

		if (qu[tribe].find (to) == qu[tribe].end ()) continue;

		qu[tribe][to] += t2.get (0, ind - 1) + t1.get (ind, n - 1);

		if (OO) cout << "TO " << tribe << ' ' << to << ' ' << qu[tribe][to] << ' ' << t2.get (0, ind - 1) + t1.get (ind, n - 1) << endl;
	}

	for (int i : vs[to]) {
		int x = ords[i].second, cur = find_e (pe[x]);
		if (t1.get (cur, cur)) t1.update (cur, -1);
		if (t2.get (cur, cur)) t2.update (cur, -1);
	}
}

void attack_from (int from) {
	for (int i : vs[from]) {
		int x = ords[i].second;
		t2.update (find_e (pe[x]), 1);
	}

	for (int i = 0; i < n; i++) {
		int x = ords[i].second, tribe = g[x];
		int ind = find_e (pe[x]);

		if (tribe == from) {
			t1.update (ind, 1);
			t2.update (ind, -1);	
			continue;		
		}

		if (qu[from].find (tribe) == qu[from].end ()) continue;

		if (refl[x]) {
			qu[from][tribe] += t2.get (0, ind - 1);
			if (OO) cout << "FROM " << from << ' ' << tribe << ' ' << t2.get (0, ind - 1) << endl;
		} else {
			qu[from][tribe] += t1.get (ind, n - 1);
			if (OO) cout << "FROM " << from << ' ' << tribe << ' ' << t1.get (ind, n - 1) << endl;
		}
	}

	for (int i : vs[from]) {
		int x = ords[i].second, cur = find_e (pe[x]);
		if (t1.get (cur, cur)) t1.update (cur, -1);
		if (t2.get (cur, cur)) t2.update (cur, -1);
	}
}

int attack_small (int from, int to) {
	ll sum = 0;

	if (OO) cout << "Vectors to:" << endl;
	for (int i : vs[to]) {
		int x = ords[i].second;
		if (!refl[x]) {
			t2.update (find_e (pe[x]), 1);
			if (OO) cout << "t2 Adding " << pe[x].x << ' ' << pe[x].y << ' ' << find_e (pe[x]) << endl;
		}
	}

	int j = 0;

	if (OO) cout << "Vectors from:" << endl;
	for (int i : vs[from]) {
		int x = ords[i].second;
		if (OO) cout << pe[x].x << ' ' << pe[x].y << ' ' << i << endl;
		int ind = find_e (pe[x]);

		while (j < vs[to].size () && vs[to][j] < i) {
			int cur = ords[vs[to][j]].second;
			if (!refl[cur]) {
				t2.update (find_e (pe[cur]), -1);
				if (OO) cout << "t2 Deleting " << pe[cur].x << ' ' << pe[cur].y << ' ' << find_e (pe[cur]) << endl;
			}
			else {
				t1.update (find_e (pe[cur]), 1);
				if (OO) cout << "t1 Adding " << pe[cur].x << ' ' << pe[cur].y << ' ' << find_e (pe[cur]) << endl;
			}
			j++;
		}

		if (OO) cout << "Checking by " << pe[x].x << ' ' << pe[x].y << ' ' << find_e (pe[x]) << endl;
		sum += t1.get (ind, n - 1) + t2.get (0, ind - 1);
	}

	for (int i : vs[to]) {
		int x = ords[i].second, cur = find_e (pe[x]);
		if (t1.get (cur, cur)) t1.update (cur, -1);
		if (t2.get (cur, cur)) t2.update (cur, -1);
	}

	if (OO) {
		for (int i = 0; i < n; i++)
			cout << t2.get (i, i);
		cout << endl;
	}

	return sum;
}
 
int main () {
	OO = false;
	cin >> n >> m;
 
	for (int i = 0; i < n; i++) {
		int a, b, c;
		cin >> a >> b >> c;
		g[i] = c - 1;
		p[i] = Pt (a, b);
		sz[c-1]++;
	}
 
	int x, y;
 
	cin >> x >> y;
	s = Pt (x, y);
 
	cin >> x >> y;
	e = Pt (x, y);
 
	for (int i = 0; i < n; i++) {
		ps[i] = p[i] - s;
		pe[i] = p[i] - e;
		if (ps[i].cross (e - s) > 0) {
			refl[i] = 1;
			ps[i] = -ps[i], pe[i] = -pe[i];
		}
		orde.push_back ({pe[i], i});
		ords.push_back ({ps[i], i});
	}
 
	sort (ords.begin(), ords.end());
	sort (orde.begin(), orde.end());

	for (int i = 0; i < n; i++) {
		vs[g[ords[i].second]].push_back (i);
	}
 
	cin >> q;
 
	vector < pair <int, int> > e;

	for (int i = 0; i < q; i++) {
		int a, b;
		cin >> a >> b;
		a--, b--;
		e.emplace_back (a, b);

		qu[a][b] = 0;
	}

	for (int i = 0; i < m; i++) {
		if (sz[i] > bl) {
			big[i] = 1;
			attack_from (i);
			attack_to (i);
		}
	}

	for (auto [a, b] : e) {
		if (!big[a] && !big[b]) cout << attack_small (a, b) << endl;
		else if (big[a] && big[b]) cout << qu[a][b] / 2 << endl;
		else cout << qu[a][b] << endl;
	}
}

Compilation message

dragon2.cpp: In function 'int attack_small(int, int)':
dragon2.cpp:156:12: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  156 |   while (j < vs[to].size () && vs[to][j] < i) {
      |          ~~^~~~~~~~~~~~~~~~
dragon2.cpp: In function 'int main()':
dragon2.cpp:247:12: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
  247 |  for (auto [a, b] : e) {
      |            ^

Subtask #1
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 30 ms 27392 KB Output is correct
2 Correct 33 ms 27264 KB Output is correct
3 Correct 121 ms 27512 KB Output is correct
4 Correct 519 ms 32876 KB Output is correct
5 Correct 442 ms 32492 KB Output is correct
6 Correct 31 ms 27520 KB Output is correct
7 Correct 32 ms 27256 KB Output is correct
8 Correct 29 ms 27256 KB Output is correct
9 Correct 25 ms 27172 KB Output is correct
10 Correct 25 ms 27264 KB Output is correct

Subtask #2
45.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 131 ms 28972 KB Output is correct
2 Correct 229 ms 29100 KB Output is correct
3 Correct 114 ms 28972 KB Output is correct
4 Correct 95 ms 28972 KB Output is correct
5 Correct 98 ms 29484 KB Output is correct
6 Correct 114 ms 28844 KB Output is correct
7 Correct 113 ms 28972 KB Output is correct
8 Correct 131 ms 28972 KB Output is correct
9 Correct 96 ms 28844 KB Output is correct
10 Correct 98 ms 28844 KB Output is correct

Subtask #3
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 30 ms 27392 KB Output is correct
2 Correct 33 ms 27264 KB Output is correct
3 Correct 121 ms 27512 KB Output is correct
4 Correct 519 ms 32876 KB Output is correct
5 Correct 442 ms 32492 KB Output is correct
6 Correct 31 ms 27520 KB Output is correct
7 Correct 32 ms 27256 KB Output is correct
8 Correct 29 ms 27256 KB Output is correct
9 Correct 25 ms 27172 KB Output is correct
10 Correct 25 ms 27264 KB Output is correct
11 Correct 131 ms 28972 KB Output is correct
12 Correct 229 ms 29100 KB Output is correct
13 Correct 114 ms 28972 KB Output is correct
14 Correct 95 ms 28972 KB Output is correct
15 Correct 98 ms 29484 KB Output is correct
16 Correct 114 ms 28844 KB Output is correct
17 Correct 113 ms 28972 KB Output is correct
18 Correct 131 ms 28972 KB Output is correct
19 Correct 96 ms 28844 KB Output is correct
20 Correct 98 ms 28844 KB Output is correct
21 Correct 131 ms 28972 KB Output is correct
22 Correct 241 ms 28988 KB Output is correct
23 Correct 1311 ms 29356 KB Output is correct
24 Correct 2873 ms 34508 KB Output is correct
25 Correct 727 ms 34600 KB Output is correct
26 Correct 589 ms 34984 KB Output is correct
27 Correct 161 ms 31020 KB Output is correct
28 Correct 162 ms 30764 KB Output is correct
29 Correct 532 ms 35240 KB Output is correct
30 Correct 524 ms 36776 KB Output is correct
31 Correct 548 ms 36776 KB Output is correct
32 Correct 1341 ms 36904 KB Output is correct
33 Correct 3374 ms 37300 KB Output is correct
34 Correct 560 ms 36776 KB Output is correct
35 Correct 543 ms 36652 KB Output is correct
36 Correct 548 ms 36904 KB Output is correct
37 Correct 569 ms 36776 KB Output is correct
38 Execution timed out 4077 ms 36932 KB Time limit exceeded
39 Halted 0 ms 0 KB -