oj.uz

답안 #314441

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
314441 2020-10-19T23:17:18 Z MetB Dragon 2 (JOI17_dragon2) C++14
60 / 100
 4000 ms 34984 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) {
	t1 = BIT (n);
	t2 = BIT (n);

	for (int i = 0; i < n; i++) {
		if (g[i] == to && !refl[i]) t2.update (find_e (pe[i]), 1);
	}

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

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

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

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

	for (int i = 0; i < n; i++) {
		int cur = find_e (pe[i]);
		if (t1.get (cur, cur)) t1.update (cur, -1);
		if (t2.get (cur, cur)) t2.update (cur, -1);
	}
}

void attack_from (int from) {
	t1 = BIT (n);
	t2 = BIT (n);

	for (int i = 0; i < n; i++) {
		if (g[i] == from) t2.update (find_e (pe[i]), 1);
	}

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

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

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

		if (refl[x]) {
			qu[x][tribe] += t2.get (0, ind - 1);
		} else {
			qu[x][tribe] += t1.get (ind, n - 1);
		}
	}

	for (int i = 0; i < n; i++) {
		int cur = find_e (pe[i]);
		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[i].x << ' ' << pe[i].y << ' ' << find_e (pe[i]) << 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);
	}
 
	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] = i;
	}

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

Subtask #1
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 25 ms 27256 KB Output is correct
2 Correct 34 ms 27264 KB Output is correct
3 Correct 120 ms 27392 KB Output is correct
4 Correct 528 ms 32696 KB Output is correct
5 Correct 435 ms 32492 KB Output is correct
6 Correct 31 ms 27384 KB Output is correct
7 Correct 32 ms 27392 KB Output is correct
8 Correct 26 ms 27264 KB Output is correct
9 Correct 23 ms 27264 KB Output is correct
10 Correct 24 ms 27264 KB Output is correct

Subtask #2
45.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 97 ms 28940 KB Output is correct
2 Correct 197 ms 29100 KB Output is correct
3 Correct 113 ms 28972 KB Output is correct
4 Correct 94 ms 28980 KB Output is correct
5 Correct 99 ms 29228 KB Output is correct
6 Correct 96 ms 28844 KB Output is correct
7 Correct 94 ms 28972 KB Output is correct
8 Correct 97 ms 28976 KB Output is correct
9 Correct 80 ms 28972 KB Output is correct
10 Correct 80 ms 28972 KB Output is correct

Subtask #3
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 25 ms 27256 KB Output is correct
2 Correct 34 ms 27264 KB Output is correct
3 Correct 120 ms 27392 KB Output is correct
4 Correct 528 ms 32696 KB Output is correct
5 Correct 435 ms 32492 KB Output is correct
6 Correct 31 ms 27384 KB Output is correct
7 Correct 32 ms 27392 KB Output is correct
8 Correct 26 ms 27264 KB Output is correct
9 Correct 23 ms 27264 KB Output is correct
10 Correct 24 ms 27264 KB Output is correct
11 Correct 97 ms 28940 KB Output is correct
12 Correct 197 ms 29100 KB Output is correct
13 Correct 113 ms 28972 KB Output is correct
14 Correct 94 ms 28980 KB Output is correct
15 Correct 99 ms 29228 KB Output is correct
16 Correct 96 ms 28844 KB Output is correct
17 Correct 94 ms 28972 KB Output is correct
18 Correct 97 ms 28976 KB Output is correct
19 Correct 80 ms 28972 KB Output is correct
20 Correct 80 ms 28972 KB Output is correct
21 Correct 97 ms 28972 KB Output is correct
22 Correct 191 ms 28972 KB Output is correct
23 Correct 1332 ms 29504 KB Output is correct
24 Correct 2916 ms 34456 KB Output is correct
25 Correct 713 ms 34404 KB Output is correct
26 Correct 573 ms 34984 KB Output is correct
27 Correct 159 ms 30636 KB Output is correct
28 Correct 160 ms 30508 KB Output is correct
29 Execution timed out 4034 ms 34344 KB Time limit exceeded
30 Halted 0 ms 0 KB -