oj.uz

Submission #27294

# Submission time Handle Problem Language Result Execution time Memory
27294 2017-07-12T07:18:51 Z 구사과(#1145) Dragon 2 (JOI17_dragon2) C++14
100 / 100
 1479 ms 208932 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long lint;
typedef long double llf;
typedef pair<int, int> pi;

struct pnt{
	int x, y, c;
	int r1, r2;
}a[30005], s, e;

lint ccw(pnt a, pnt b, pnt c){
	return 1ll * (b.x - a.x) * (c.y - a.y) - 1ll * (c.x - a.x) * (b.y - a.y);
}

int n, m;
int stx[30005], sty[30005], edx[30005], edy[30005];

void label1(){
	sort(a, a+n, [&](const pnt &p, const pnt &q){
		bool bh1 = ccw(s, e, p) > 0;
		bool bh2 = ccw(s, e, q) > 0;
		if(bh1 != bh2) return bh1 > bh2;
		return ccw(s, p, q) > 0;
	});
	int dv = 0;
	for(int i=0; i<n; i++){
		a[i].r1 = i;
		if(ccw(s, e, a[i]) > 0) dv = i+1;
	}
	int p = 0;
	for(int i=dv; i<n; i++){
		while(p < dv && ccw(s, a[i], a[p]) > 0) p++;
		stx[i] = i;
		edx[i] = p;
	}
	p = dv;
	for(int i=0; i<dv; i++){
		while(p < n && ccw(s, a[i], a[p]) > 0) p++;
		stx[i] = p;
		edx[i] = i;
	}
}

void label2(){
	sort(a, a+n, [&](const pnt &p, const pnt &q){
		bool bh1 = ccw(s, e, p) > 0;
		bool bh2 = ccw(s, e, q) > 0;
		if(bh1 != bh2) return bh1 > bh2;
		return ccw(e, p, q) > 0;
	});
	int dv = 0;
	for(int i=0; i<n; i++){
		a[i].r2 = i;
		if(ccw(s, e, a[i]) > 0) dv = i+1;
	}
	int p = 0;
	for(int i=dv; i<n; i++){
		while(p < dv && ccw(e, a[i], a[p]) > 0) p++;
		sty[i] = p;
		edy[i] = i;
	}
	p = dv;
	for(int i=0; i<dv; i++){
		while(p < n && ccw(e, a[i], a[p]) > 0) p++;
		sty[i] = i;
		edy[i] = p;
	}
}

vector<pi> grp[30005];
map<pi, int> mp;
int refer[100005], ans[100005];

struct sweep1{
	int pos, s, e, dx, idx;
	bool operator<(const sweep1 &c)const{
		return pos < c.pos;
	}
};

struct sweep2{
	int pos, idx;
	bool operator<(const sweep2 &c)const{
		return pos < c.pos;
	}
};

struct sweep3{
	int px, py, idx;
	bool operator<(const sweep3 &c)const{
		return pi(py, px) < pi(c.py, c.px);
	}
};

vector<sweep1> s1[30005];
vector<sweep2> s2[30005];
vector<sweep3> s3[30005];

void add_sweep(int sx, int ex, int sy, int ey, int gnum, int idx){
	if(sx > ex || sy > ey) return;
	s1[gnum].push_back({sx - 1, sy, ey, -1, idx});
	s1[gnum].push_back({ex, sy, ey, 1, idx});
}

void add_sweep2(int y, int gnum, int idx){
	s2[gnum].push_back({y, idx});
}

void add_sweep3(int x, int y, int gnum, int idx){
	s3[gnum].push_back({x, y, idx});
	for(auto &i : grp[gnum]){
		if(edx[i.first] <= x && x < stx[i.first] && sty[i.second] <= y && y < edy[i.second]) ans[idx]--;
	}
}

struct bit{
	int tree[30005];
	void add(int x, int v){
		x += 2;
		while(x <= n+2){
			tree[x] += v;
			x += x & -x;
		}
	}
	int query(int x){
		x += 2;
		int ret = 0;
		while(x){
			ret += tree[x];
			x -= x & -x;
		}
		return ret;
	}
}bit;

void proc_sweep(int gnum){
	sort(s1[gnum].begin(), s1[gnum].end());
	sort(s2[gnum].begin(), s2[gnum].end());
	sort(s3[gnum].begin(), s3[gnum].end());
	sort(grp[gnum].begin(), grp[gnum].end());
	int p = 0;
	for(auto &i : s1[gnum]){
		while(p < grp[gnum].size() && grp[gnum][p].first <= i.pos){
			bit.add(grp[gnum][p++].second, 1);
		}
		ans[i.idx] += i.dx * (bit.query(i.e) - bit.query(i.s - 1));
	}
	while(p > 0){
		bit.add(grp[gnum][--p].second, -1);
	}
	vector<pi> vt;
	for(auto &i : grp[gnum]){
		vt.push_back(pi(sty[i.second], 1));
		vt.push_back(pi(edy[i.second], -1));
	}
	sort(vt.begin(), vt.end());
	int sum = 0;
	for(auto &i : s2[gnum]){
		while(p < vt.size() && vt[p].first <= i.pos){
			sum += vt[p++].second;
		}
		ans[i.idx] += sum;
	}
}

int main(){
	scanf("%d %d",&n,&m);
	for(int i=0; i<n; i++){
		scanf("%d %d %d",&a[i].x,&a[i].y,&a[i].c);
	}
	scanf("%d %d %d %d",&s.x,&s.y,&e.x,&e.y);
	label1();
	label2();
	for(int i=0; i<n; i++){
		grp[a[i].c].push_back(pi(a[i].r1, a[i].r2));
	}
	int q;
	scanf("%d",&q);
	for(int i=1; i<=q; i++){
		int x, y;
		scanf("%d %d",&x,&y);
		if(mp.find(pi(x, y)) != mp.end()){
			refer[i] = mp[pi(x, y)];
			continue;
		}
		if(grp[x].size() < grp[y].size()){
			for(auto &j : grp[x]){
				add_sweep(0, edx[j.first] - 1, sty[j.second], edy[j.second] - 1, y, i);
				add_sweep(stx[j.first], n-1, sty[j.second], edy[j.second] - 1, y, i);
			}
		}
		else{
			for(auto &j : grp[y]){
				add_sweep2(j.second, x, i);
				add_sweep3(j.first, j.second, x, i);
			}
		}
		mp[pi(x, y)] = i;
	}
	for(int i=1; i<=m; i++) proc_sweep(i);
	for(int i=1; i<=q; i++){
		if(refer[i]) printf("%d\n", ans[refer[i]]);
		else printf("%d\n", ans[i]);
	}
}

Compilation message

dragon2.cpp: In function 'void proc_sweep(int)':
dragon2.cpp:144:11: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   while(p < grp[gnum].size() && grp[gnum][p].first <= i.pos){
           ^
dragon2.cpp:160:11: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   while(p < vt.size() && vt[p].first <= i.pos){
           ^
dragon2.cpp: In function 'int main()':
dragon2.cpp:168:22: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d",&n,&m);
                      ^
dragon2.cpp:170:44: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d %d",&a[i].x,&a[i].y,&a[i].c);
                                            ^
dragon2.cpp:172:42: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d %d %d",&s.x,&s.y,&e.x,&e.y);
                                          ^
dragon2.cpp:179:16: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&q);
                ^
dragon2.cpp:182:23: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d",&x,&y);
                       ^

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 6940 KB Output is correct
2 Correct 16 ms 8096 KB Output is correct
3 Correct 59 ms 16672 KB Output is correct
4 Correct 256 ms 25716 KB Output is correct
5 Correct 183 ms 15784 KB Output is correct
6 Correct 3 ms 7072 KB Output is correct
7 Correct 0 ms 7072 KB Output is correct
8 Correct 3 ms 7248 KB Output is correct
9 Correct 6 ms 6940 KB Output is correct
10 Correct 6 ms 6940 KB Output is correct

Subtask #2
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 893 ms 7988 KB Output is correct
2 Correct 1196 ms 17368 KB Output is correct
3 Correct 59 ms 9892 KB Output is correct
4 Correct 29 ms 7336 KB Output is correct
5 Correct 33 ms 7468 KB Output is correct
6 Correct 459 ms 7988 KB Output is correct
7 Correct 519 ms 7988 KB Output is correct
8 Correct 39 ms 9076 KB Output is correct
9 Correct 243 ms 7988 KB Output is correct
10 Correct 239 ms 7988 KB Output is correct

Subtask #3
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 6940 KB Output is correct
2 Correct 16 ms 8096 KB Output is correct
3 Correct 59 ms 16672 KB Output is correct
4 Correct 256 ms 25716 KB Output is correct
5 Correct 183 ms 15784 KB Output is correct
6 Correct 3 ms 7072 KB Output is correct
7 Correct 0 ms 7072 KB Output is correct
8 Correct 3 ms 7248 KB Output is correct
9 Correct 6 ms 6940 KB Output is correct
10 Correct 6 ms 6940 KB Output is correct
11 Correct 893 ms 7988 KB Output is correct
12 Correct 1196 ms 17368 KB Output is correct
13 Correct 59 ms 9892 KB Output is correct
14 Correct 29 ms 7336 KB Output is correct
15 Correct 33 ms 7468 KB Output is correct
16 Correct 459 ms 7988 KB Output is correct
17 Correct 519 ms 7988 KB Output is correct
18 Correct 39 ms 9076 KB Output is correct
19 Correct 243 ms 7988 KB Output is correct
20 Correct 239 ms 7988 KB Output is correct
21 Correct 896 ms 8020 KB Output is correct
22 Correct 1096 ms 19260 KB Output is correct
23 Correct 1479 ms 113036 KB Output is correct
24 Correct 1436 ms 208932 KB Output is correct
25 Correct 326 ms 26348 KB Output is correct
26 Correct 276 ms 16312 KB Output is correct
27 Correct 53 ms 9580 KB Output is correct
28 Correct 63 ms 9580 KB Output is correct
29 Correct 966 ms 16228 KB Output is correct
30 Correct 233 ms 14880 KB Output is correct
31 Correct 209 ms 14884 KB Output is correct
32 Correct 246 ms 18076 KB Output is correct
33 Correct 983 ms 110564 KB Output is correct
34 Correct 213 ms 14596 KB Output is correct
35 Correct 243 ms 15124 KB Output is correct
36 Correct 236 ms 16356 KB Output is correct
37 Correct 269 ms 16312 KB Output is correct
38 Correct 1189 ms 108312 KB Output is correct
39 Correct 953 ms 125224 KB Output is correct
40 Correct 1018 ms 112468 KB Output is correct
41 Correct 949 ms 16552 KB Output is correct
42 Correct 849 ms 20084 KB Output is correct
43 Correct 896 ms 25100 KB Output is correct
44 Correct 1229 ms 8988 KB Output is correct
45 Correct 549 ms 8720 KB Output is correct
46 Correct 373 ms 9068 KB Output is correct
47 Correct 59 ms 10064 KB Output is correct
48 Correct 59 ms 9684 KB Output is correct
49 Correct 43 ms 10516 KB Output is correct