oj.uz

답안 #318036

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
318036 2020-10-31T09:45:16 Z arnold518 식물 비교 (IOI20_plants) C++14
49 / 100
 2081 ms 41044 KB 
#include "plants.h"
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const int MAXN = 2e5;
const int INF = 1e8;

int N, K, R[MAXN+10], H[MAXN+10];

struct SEG
{
	pii tree[MAXN*4+10];
	int lazy[MAXN*4+10];

	void busy(int node, int tl, int tr)
	{
		tree[node].first+=lazy[node];
		if(tl!=tr)
		{
			lazy[node*2]+=lazy[node];
			lazy[node*2+1]+=lazy[node];
		}
		lazy[node]=0;
	}
	void init(int node, int tl, int tr)
	{
		if(tl==tr)
		{
			tree[node]={0, tl};
			lazy[node]=0;
			return;
		}
		int mid=tl+tr>>1;
		init(node*2, tl, mid);
		init(node*2+1, mid+1, tr);
		tree[node]=min(tree[node*2], tree[node*2+1]);
	}
	void update(int node, int tl, int tr, int l, int r, int k)
	{
		busy(node, tl, tr);
		if(l<=tl && tr<=r)
		{
			lazy[node]+=k;
			busy(node, tl, tr);
			return;
		}
		if(r<tl || tr<l) return;
		int mid=tl+tr>>1;
		update(node*2, tl, mid, l, r, k);
		update(node*2+1, mid+1, tr, l, r, k);
		tree[node]=min(tree[node*2], tree[node*2+1]);
	}
	void update2(int node, int tl, int tr, int p, int k)
	{
		busy(node, tl, tr);
		if(tl==tr)
		{
			tree[node].first=k;
			return;
		}
		int mid=tl+tr>>1;
		if(p<=mid) update2(node*2, tl, mid, p, k);
		else update2(node*2+1, mid+1, tr, p, k);
		tree[node]=min(tree[node*2], tree[node*2+1]);
	}
	pii query(int node, int tl, int tr, int l, int r)
	{
		busy(node, tl, tr);
		if(l<=tl && tr<=r) return tree[node];
		if(r<tl || tr<l) return {INF, -1};
		int mid=tl+tr>>1;
		return min(query(node*2, tl, mid, l, r), query(node*2+1, mid+1, tr, l, r));
	}
	void query2(int node, int tl, int tr, int l, int r, vector<int> &V)
	{
		busy(node, tl, tr);
		if(tree[node].first!=0) return;
		if(r<tl || tr<l) return;
		if(tl==tr)
		{
			V.push_back(tl);
			return;
		}
		int mid=tl+tr>>1;
		query2(node*2, tl, mid, l, r, V);
		query2(node*2+1, mid+1, tr, l, r, V);
	}
	void init()
	{
		init(1, 0, N-1);
	}
	void update(int l, int r, int k)
	{
		l=(l%N+N)%N; r=(r%N+N)%N;
		if(l<=r) update(1, 0, N-1, l, r, k);
		else
		{
			update(1, 0, N-1, l, N-1, k);
			update(1, 0, N-1, 0, r, k);
		}
	}
	void update2(int p, int k)
	{
		p=(p%N+N)%N;
		update2(1, 0, N-1, p, k);
	}
	pii query(int l, int r)
	{
		l=(l%N+N)%N; r=(r%N+N)%N;
		if(l<=r) return query(1, 0, N-1, l, r);
		else return min(query(1, 0, N-1, l, N-1), query(1, 0, N-1, 0, r));
	}
	vector<int> query2(int l, int r)
	{
		vector<int> ret;
		l=(l%N+N)%N; r=(r%N+N)%N;
		if(l<=r) query2(1, 0, N-1, l, r, ret);
		else
		{
			query2(1, 0, N-1, l, N-1, ret);
			query2(1, 0, N-1, 0, r, ret);
		}
		return ret;
	}
}seg1, seg2, seg3;

int LL[MAXN*3+10], RR[MAXN*3+10];

void init(int _K, vector<int> _R)
{
	K=_K; N=_R.size();
	for(int i=0; i<N; i++) R[i]=_R[i];
	seg1.init(); seg2.init(); seg3.init();

	for(int i=0; i<N; i++)
	{
		seg1.update2(i, R[i]);
		seg2.update2(i, R[i]);
	}
	for(int i=0; i<N; i++) if(R[i]==0) seg1.update(i+1, i+K-1, 1);

	for(int i=N-1; i>=0; i--)
	{
		vector<int> V;
		assert(seg1.tree[1].first+seg1.lazy[1]==0);
		int now=seg1.tree[1].second; H[now]=i;
		assert(seg2.query(now-K+1, now-1).first>=1);
		seg1.update(now+1, now+K-1, -1);
		seg1.update2(now, INF);
		seg2.update2(now, INF);
		seg2.update(now-K+1, now-1, -1);
		seg1.update(now-K+1, now-1, -1);

		V=seg2.query2(now-K+1, now-1);
		for(auto it : V) seg1.update(it+1, it+K-1, 1);
	}
	//for(int i=0; i<N; i++) printf("%d ", H[i]); printf("\n");
	
	vector<pii> V;
	for(int i=0; i<N; i++) V.push_back({H[i], i});
	sort(V.begin(), V.end(), greater<pii>());
	
	for(int i=0; i<N; i++) seg3.update2(i, INF);

	for(int i=N; i<N+N; i++) LL[i]=RR[i]=i;
	for(int i=0; i<V.size(); i++)
	{
		int now=V[i].second;
		pii t1=seg3.query(now-K+1, now), t2=seg3.query(now, now+K-1);

		if(t1.first!=INF)
		{
			int p=t1.second;
			if(p<now) p+=N;

			LL[now+N]=min(LL[now+N], LL[p]);
			RR[now+N]=max(RR[now+N], RR[p]);
		}
		if(t2.first!=INF)
		{
			int p=t2.second;
			if(p>now) p+=N;
			else p+=N+N;

			LL[now+N]=min(LL[now+N], LL[p]);
			RR[now+N]=max(RR[now+N], RR[p]);
		}

		LL[now+N]=max(LL[now+N], now);
		RR[now+N]=min(RR[now+N], now+N+N);

		LL[now]=LL[now+N]-N;
		RR[now]=RR[now+N]-N;
		LL[now+N+N]=LL[now+N]+N;
		RR[now+N+N]=RR[now+N]+N;
		seg3.update2(now, H[now]);
	}
 
	return;
}

bool f(int l, int r, int x)
{
	while(x<l) x+=N;
	return l<=x && x<=r;
}
 
int compare_plants(int x, int y)
{
	int ans=0;
	if(H[x]<H[y] && f(LL[x+N], RR[x+N], y)) return -1;
	if(H[y]<H[x] && f(LL[y+N], RR[y+N], x)) return 1;
	return 0;
}

Compilation message

plants.cpp: In member function 'void SEG::init(int, int, int)':
plants.cpp:37:13: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   37 |   int mid=tl+tr>>1;
      |           ~~^~~
plants.cpp: In member function 'void SEG::update(int, int, int, int, int, int)':
plants.cpp:52:13: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   52 |   int mid=tl+tr>>1;
      |           ~~^~~
plants.cpp: In member function 'void SEG::update2(int, int, int, int, int)':
plants.cpp:65:13: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   65 |   int mid=tl+tr>>1;
      |           ~~^~~
plants.cpp: In member function 'pii SEG::query(int, int, int, int, int)':
plants.cpp:75:13: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   75 |   int mid=tl+tr>>1;
      |           ~~^~~
plants.cpp: In member function 'void SEG::query2(int, int, int, int, int, std::vector<int>&)':
plants.cpp:88:13: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   88 |   int mid=tl+tr>>1;
      |           ~~^~~
plants.cpp: In function 'void init(int, std::vector<int>)':
plants.cpp:170:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  170 |  for(int i=0; i<V.size(); i++)
      |               ~^~~~~~~~~
plants.cpp: In function 'int compare_plants(int, int)':
plants.cpp:214:6: warning: unused variable 'ans' [-Wunused-variable]
  214 |  int ans=0;
      |      ^~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 19180 KB Output is correct
2 Correct 10 ms 19180 KB Output is correct
3 Correct 10 ms 19180 KB Output is correct
4 Correct 10 ms 19308 KB Output is correct
5 Correct 10 ms 19180 KB Output is correct
6 Correct 71 ms 22120 KB Output is correct
7 Correct 156 ms 23744 KB Output is correct
8 Correct 895 ms 40148 KB Output is correct
9 Correct 884 ms 40276 KB Output is correct
10 Correct 874 ms 40148 KB Output is correct
11 Correct 879 ms 40276 KB Output is correct
12 Correct 865 ms 40148 KB Output is correct
13 Correct 847 ms 40208 KB Output is correct
14 Correct 863 ms 40276 KB Output is correct

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 19180 KB Output is correct
2 Correct 10 ms 19180 KB Output is correct
3 Correct 10 ms 19180 KB Output is correct
4 Correct 10 ms 19180 KB Output is correct
5 Correct 11 ms 19180 KB Output is correct
6 Correct 16 ms 19308 KB Output is correct
7 Correct 101 ms 22624 KB Output is correct
8 Correct 12 ms 19308 KB Output is correct
9 Correct 16 ms 19308 KB Output is correct
10 Correct 101 ms 22656 KB Output is correct
11 Correct 93 ms 22496 KB Output is correct
12 Correct 96 ms 22752 KB Output is correct
13 Correct 102 ms 22624 KB Output is correct

Subtask #3
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 19180 KB Output is correct
2 Correct 10 ms 19180 KB Output is correct
3 Correct 10 ms 19180 KB Output is correct
4 Correct 10 ms 19180 KB Output is correct
5 Correct 11 ms 19180 KB Output is correct
6 Correct 16 ms 19308 KB Output is correct
7 Correct 101 ms 22624 KB Output is correct
8 Correct 12 ms 19308 KB Output is correct
9 Correct 16 ms 19308 KB Output is correct
10 Correct 101 ms 22656 KB Output is correct
11 Correct 93 ms 22496 KB Output is correct
12 Correct 96 ms 22752 KB Output is correct
13 Correct 102 ms 22624 KB Output is correct
14 Correct 209 ms 23888 KB Output is correct
15 Correct 2081 ms 41040 KB Output is correct
16 Correct 209 ms 25920 KB Output is correct
17 Correct 2059 ms 41044 KB Output is correct
18 Correct 1350 ms 40648 KB Output is correct
19 Correct 1305 ms 41044 KB Output is correct
20 Correct 1819 ms 40916 KB Output is correct

Subtask #4
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 19180 KB Output is correct
2 Correct 10 ms 19308 KB Output is correct
3 Correct 81 ms 22372 KB Output is correct
4 Correct 1000 ms 37432 KB Output is correct
5 Correct 1222 ms 40324 KB Output is correct
6 Correct 1641 ms 40620 KB Output is correct
7 Correct 1928 ms 40716 KB Output is correct
8 Correct 2047 ms 40964 KB Output is correct
9 Correct 1077 ms 40148 KB Output is correct
10 Correct 1081 ms 40276 KB Output is correct
11 Correct 865 ms 40276 KB Output is correct
12 Correct 1037 ms 40404 KB Output is correct
13 Correct 1311 ms 40532 KB Output is correct

Subtask #5
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 19180 KB Output is correct
2 Correct 10 ms 19308 KB Output is correct
3 Correct 10 ms 19180 KB Output is correct
4 Correct 10 ms 19180 KB Output is correct
5 Incorrect 10 ms 19180 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #6
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 19180 KB Output is correct
2 Correct 10 ms 19180 KB Output is correct
3 Correct 10 ms 19180 KB Output is correct
4 Correct 11 ms 19180 KB Output is correct
5 Incorrect 14 ms 19308 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #7
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 19180 KB Output is correct
2 Correct 10 ms 19180 KB Output is correct
3 Correct 10 ms 19180 KB Output is correct
4 Correct 10 ms 19308 KB Output is correct
5 Correct 10 ms 19180 KB Output is correct
6 Correct 71 ms 22120 KB Output is correct
7 Correct 156 ms 23744 KB Output is correct
8 Correct 895 ms 40148 KB Output is correct
9 Correct 884 ms 40276 KB Output is correct
10 Correct 874 ms 40148 KB Output is correct
11 Correct 879 ms 40276 KB Output is correct
12 Correct 865 ms 40148 KB Output is correct
13 Correct 847 ms 40208 KB Output is correct
14 Correct 863 ms 40276 KB Output is correct
15 Correct 10 ms 19180 KB Output is correct
16 Correct 10 ms 19180 KB Output is correct
17 Correct 10 ms 19180 KB Output is correct
18 Correct 10 ms 19180 KB Output is correct
19 Correct 11 ms 19180 KB Output is correct
20 Correct 16 ms 19308 KB Output is correct
21 Correct 101 ms 22624 KB Output is correct
22 Correct 12 ms 19308 KB Output is correct
23 Correct 16 ms 19308 KB Output is correct
24 Correct 101 ms 22656 KB Output is correct
25 Correct 93 ms 22496 KB Output is correct
26 Correct 96 ms 22752 KB Output is correct
27 Correct 102 ms 22624 KB Output is correct
28 Correct 209 ms 23888 KB Output is correct
29 Correct 2081 ms 41040 KB Output is correct
30 Correct 209 ms 25920 KB Output is correct
31 Correct 2059 ms 41044 KB Output is correct
32 Correct 1350 ms 40648 KB Output is correct
33 Correct 1305 ms 41044 KB Output is correct
34 Correct 1819 ms 40916 KB Output is correct
35 Correct 10 ms 19180 KB Output is correct
36 Correct 10 ms 19308 KB Output is correct
37 Correct 81 ms 22372 KB Output is correct
38 Correct 1000 ms 37432 KB Output is correct
39 Correct 1222 ms 40324 KB Output is correct
40 Correct 1641 ms 40620 KB Output is correct
41 Correct 1928 ms 40716 KB Output is correct
42 Correct 2047 ms 40964 KB Output is correct
43 Correct 1077 ms 40148 KB Output is correct
44 Correct 1081 ms 40276 KB Output is correct
45 Correct 865 ms 40276 KB Output is correct
46 Correct 1037 ms 40404 KB Output is correct
47 Correct 1311 ms 40532 KB Output is correct
48 Correct 10 ms 19180 KB Output is correct
49 Correct 10 ms 19308 KB Output is correct
50 Correct 10 ms 19180 KB Output is correct
51 Correct 10 ms 19180 KB Output is correct
52 Incorrect 10 ms 19180 KB Output isn't correct
53 Halted 0 ms 0 KB -