oj.uz

답안 #51760

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
51760 2018-06-21T03:30:04 Z model_code 절취선 (JOI14_ho_t5) C++17
100 / 100
 402 ms 13664 KB 
#include<cstdio>
#include<algorithm>
#include<set>
#include<vector>

using namespace std;
const int MAXN = 100020;

struct seg_tree
{
	static const int DEPTH = 19;
	static const int SIZE = 1<<DEPTH;

	int bit[1<<(DEPTH+1)];
	int renew[1<<(DEPTH+1)];

	seg_tree() { } 

	void init()
	{
		for(int i=0;i<2*SIZE;i++) bit[i] = renew[i] = 0;
	}

	void add(int p, int v)
	{
		p += SIZE;
		while(p){
			bit[p] += v;
			p >>= 1;
		}
	}

	int query(int l, int r)
	{
		l += SIZE;
		r += SIZE;
		int ret = 0;

		while(l < r){
			if(l&1) ret += bit[l++];
			if(r&1) ret += bit[--r];
			l >>= 1; r >>= 1;
		}

		return ret;
	}

	void set_renew(int l, int r)
	{
		l += SIZE;
		r += SIZE;

		while(l < r){
			if(l&1) renew[l++] = 1;
			if(r&1) renew[--r] = 1;
			l >>= 1; r >>= 1;
		}
	}

	bool is_renew(int p)
	{
		p += SIZE;
		while(p){
			if(renew[p]) return true;
			p >>= 1;
		}
		return false;
	}

	void unset_renew(int p)
	{
		p += SIZE;
		for(int i=DEPTH-1;i>0;i--){
			if(renew[p >> i]){
				renew[p >> i] = 0;
				renew[(p>>i)*2] = renew[(p>>i)*2+1] = 1;
			}
		}

		renew[p] = 0;
	}
};

struct action
{
	int pos, act, left, right;

	action(int p, int a, int l, int r)
	{
		pos = p; act = a; left = l; right = r;
	}
};

inline bool operator<(const action& a, const action& b)
{
	return a.pos < b.pos || (a.pos == b.pos && a.act < b.act);
}

int W, H, N;
int x1[MAXN], y1[MAXN], x2[MAXN], y2[MAXN];
vector<int> uf;
seg_tree seg;
int target[MAXN*2];

int root(int p)
{
	return (uf[p] < 0) ? p : (uf[p] = root(uf[p]));
}

bool join(int p, int q)
{
	p = root(p);
	q = root(q);

	if(p==q) return false;

	if(uf[p] < uf[q]) swap(p, q);
	uf[p] = uf[q];
	uf[q] = p;

	return true;
}

void adjust(int p)
{
	if(seg.is_renew(p)){
		uf.push_back(-1);
		seg.unset_renew(p);
		target[p] = uf.size() - 1;
	}

}

int main()
{
	scanf("%d%d%d", &W, &H, &N);
	for(int i=0;i<N;i++){
		scanf("%d%d%d%d", x1+i, y1+i, x2+i, y2+i);
		if(x1[i] > x2[i]) swap(x1[i], x2[i]);
		if(y1[i] > y2[i]) swap(y1[i], y2[i]);
	}
	for(int i=0;i<2*N;i++) target[i] = -1;

	x1[N  ] = 0; y1[N  ] = 0; x2[N  ] = W; y2[N  ] = 0;
	x1[N+1] = 0; y1[N+1] = 0; x2[N+1] = 0; y2[N+1] = H;
	x1[N+2] = W; y1[N+2] = 0; x2[N+2] = W; y2[N+2] = H;
	x1[N+3] = 0; y1[N+3] = H; x2[N+3] = W; y2[N+3] = H;
	N += 4;

	vector<int> xs;
	for(int i=0;i<N;i++){
		xs.push_back(x1[i]);
		xs.push_back(x2[i]);
	}
	xs.push_back(-1);
	sort(xs.begin(), xs.end());
	xs.erase(unique(xs.begin(), xs.end()), xs.end());

	for(int i=0;i<N;i++){
		x1[i] = lower_bound(xs.begin(), xs.end(), x1[i]) - xs.begin();
		x2[i] = lower_bound(xs.begin(), xs.end(), x2[i]) - xs.begin();
	}

	set<int> S;
	S.insert(0);
	target[0] = 0;
	uf.push_back(-1);

	vector<action> A;

	for(int i=0;i<N;i++){
		if(x1[i] == x2[i]){
			A.push_back(action(y1[i], 0, x1[i], -1));
			A.push_back(action(y2[i], 2, x1[i], -1));
		}else{
			A.push_back(action(y1[i], 1, x1[i], x2[i]));
		}
	}

	sort(A.begin(), A.end());

	long long ret = 0;
	for(int i=0;i<A.size();i++){
		action V = A[i];

		if(V.act == 0){
			int lf = *--S.lower_bound(V.left);

			adjust(lf); adjust(V.left);
			target[V.left] = target[lf];

			S.insert(V.left);
			seg.add(V.left, 1);
		}else if(V.act == 1){
			int count = seg.query(V.left, V.right+1);
			if(count < 2) continue;
			ret += count - 1;

			seg.set_renew(V.left, *--S.upper_bound(V.right));
		}else if(V.act == 2){
			int lf = *--S.lower_bound(V.left);
			adjust(lf); adjust(V.left);
			if(join(target[lf], target[V.left])) --ret;

			S.erase(V.left);
			seg.add(V.left, -1);
		}
	}

	printf("%lld\n", ret);

	return 0;
}

Compilation message

2014_ho_t5.cpp: In function 'int main()':
2014_ho_t5.cpp:183:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0;i<A.size();i++){
              ~^~~~~~~~~
2014_ho_t5.cpp:136:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d%d", &W, &H, &N);
  ~~~~~^~~~~~~~~~~~~~~~~~~~~~
2014_ho_t5.cpp:138:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d%d%d", x1+i, y1+i, x2+i, y2+i);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 484 KB Output is correct
3 Correct 2 ms 484 KB Output is correct
4 Correct 2 ms 576 KB Output is correct
5 Correct 3 ms 576 KB Output is correct
6 Correct 2 ms 636 KB Output is correct
7 Correct 3 ms 712 KB Output is correct
8 Correct 5 ms 840 KB Output is correct
9 Correct 3 ms 840 KB Output is correct
10 Correct 4 ms 840 KB Output is correct
11 Correct 3 ms 840 KB Output is correct
12 Correct 3 ms 840 KB Output is correct
13 Correct 4 ms 840 KB Output is correct
14 Correct 4 ms 840 KB Output is correct
15 Correct 4 ms 840 KB Output is correct
16 Correct 3 ms 840 KB Output is correct
17 Correct 2 ms 840 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 484 KB Output is correct
3 Correct 2 ms 484 KB Output is correct
4 Correct 2 ms 576 KB Output is correct
5 Correct 3 ms 576 KB Output is correct
6 Correct 2 ms 636 KB Output is correct
7 Correct 3 ms 712 KB Output is correct
8 Correct 5 ms 840 KB Output is correct
9 Correct 3 ms 840 KB Output is correct
10 Correct 4 ms 840 KB Output is correct
11 Correct 3 ms 840 KB Output is correct
12 Correct 3 ms 840 KB Output is correct
13 Correct 4 ms 840 KB Output is correct
14 Correct 4 ms 840 KB Output is correct
15 Correct 4 ms 840 KB Output is correct
16 Correct 3 ms 840 KB Output is correct
17 Correct 2 ms 840 KB Output is correct
18 Correct 2 ms 840 KB Output is correct
19 Correct 2 ms 840 KB Output is correct
20 Correct 2 ms 840 KB Output is correct
21 Correct 4 ms 840 KB Output is correct
22 Correct 4 ms 840 KB Output is correct
23 Correct 5 ms 840 KB Output is correct
24 Correct 4 ms 840 KB Output is correct
25 Correct 5 ms 840 KB Output is correct
26 Correct 3 ms 840 KB Output is correct
27 Correct 4 ms 840 KB Output is correct
28 Correct 4 ms 840 KB Output is correct

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 840 KB Output is correct
2 Correct 3 ms 840 KB Output is correct
3 Correct 3 ms 840 KB Output is correct
4 Correct 4 ms 840 KB Output is correct
5 Correct 24 ms 1592 KB Output is correct
6 Correct 110 ms 5100 KB Output is correct
7 Correct 192 ms 9436 KB Output is correct
8 Correct 207 ms 9436 KB Output is correct
9 Correct 181 ms 9436 KB Output is correct
10 Correct 161 ms 9436 KB Output is correct

Subtask #4
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 9436 KB Output is correct
2 Correct 4 ms 9436 KB Output is correct
3 Correct 22 ms 9436 KB Output is correct
4 Correct 2 ms 9436 KB Output is correct
5 Correct 4 ms 9436 KB Output is correct
6 Correct 279 ms 11496 KB Output is correct
7 Correct 18 ms 11496 KB Output is correct
8 Correct 175 ms 11496 KB Output is correct
9 Correct 190 ms 11496 KB Output is correct
10 Correct 201 ms 11496 KB Output is correct

Subtask #5
50.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 484 KB Output is correct
3 Correct 2 ms 484 KB Output is correct
4 Correct 2 ms 576 KB Output is correct
5 Correct 3 ms 576 KB Output is correct
6 Correct 2 ms 636 KB Output is correct
7 Correct 3 ms 712 KB Output is correct
8 Correct 5 ms 840 KB Output is correct
9 Correct 3 ms 840 KB Output is correct
10 Correct 4 ms 840 KB Output is correct
11 Correct 3 ms 840 KB Output is correct
12 Correct 3 ms 840 KB Output is correct
13 Correct 4 ms 840 KB Output is correct
14 Correct 4 ms 840 KB Output is correct
15 Correct 4 ms 840 KB Output is correct
16 Correct 3 ms 840 KB Output is correct
17 Correct 2 ms 840 KB Output is correct
18 Correct 2 ms 840 KB Output is correct
19 Correct 2 ms 840 KB Output is correct
20 Correct 2 ms 840 KB Output is correct
21 Correct 4 ms 840 KB Output is correct
22 Correct 4 ms 840 KB Output is correct
23 Correct 5 ms 840 KB Output is correct
24 Correct 4 ms 840 KB Output is correct
25 Correct 5 ms 840 KB Output is correct
26 Correct 3 ms 840 KB Output is correct
27 Correct 4 ms 840 KB Output is correct
28 Correct 4 ms 840 KB Output is correct
29 Correct 3 ms 840 KB Output is correct
30 Correct 3 ms 840 KB Output is correct
31 Correct 3 ms 840 KB Output is correct
32 Correct 4 ms 840 KB Output is correct
33 Correct 24 ms 1592 KB Output is correct
34 Correct 110 ms 5100 KB Output is correct
35 Correct 192 ms 9436 KB Output is correct
36 Correct 207 ms 9436 KB Output is correct
37 Correct 181 ms 9436 KB Output is correct
38 Correct 161 ms 9436 KB Output is correct
39 Correct 3 ms 9436 KB Output is correct
40 Correct 4 ms 9436 KB Output is correct
41 Correct 22 ms 9436 KB Output is correct
42 Correct 2 ms 9436 KB Output is correct
43 Correct 4 ms 9436 KB Output is correct
44 Correct 279 ms 11496 KB Output is correct
45 Correct 18 ms 11496 KB Output is correct
46 Correct 175 ms 11496 KB Output is correct
47 Correct 190 ms 11496 KB Output is correct
48 Correct 201 ms 11496 KB Output is correct
49 Correct 5 ms 11496 KB Output is correct
50 Correct 4 ms 11496 KB Output is correct
51 Correct 3 ms 11496 KB Output is correct
52 Correct 121 ms 11496 KB Output is correct
53 Correct 93 ms 11496 KB Output is correct
54 Correct 117 ms 11496 KB Output is correct
55 Correct 259 ms 11496 KB Output is correct
56 Correct 202 ms 11496 KB Output is correct
57 Correct 305 ms 12076 KB Output is correct
58 Correct 296 ms 12076 KB Output is correct
59 Correct 199 ms 12076 KB Output is correct
60 Correct 219 ms 12076 KB Output is correct
61 Correct 233 ms 12076 KB Output is correct
62 Correct 250 ms 12076 KB Output is correct
63 Correct 329 ms 12076 KB Output is correct
64 Correct 214 ms 12076 KB Output is correct
65 Correct 320 ms 12076 KB Output is correct
66 Correct 320 ms 12076 KB Output is correct
67 Correct 264 ms 12076 KB Output is correct
68 Correct 281 ms 12076 KB Output is correct
69 Correct 303 ms 12076 KB Output is correct
70 Correct 252 ms 12076 KB Output is correct
71 Correct 402 ms 13664 KB Output is correct
72 Correct 149 ms 13664 KB Output is correct