oj.uz

Submission #308738

# Submission time Handle Problem Language Result Execution time Memory
308738 2020-10-01T19:16:23 Z CaroLinda Comparing Plants (IOI20_plants) C++14
32 / 100
 1737 ms 77432 KB 
#include "plants.h"
#include <bits/stdc++.h>

#define sz(x) (int)(x.size())
#define debug printf
#define lp(i,a,b) for(int i = a ; i < b; i++)
#define pb push_back
#define ff first
#define ss second
#define mk make_pair
#define pii pair<int,int>
#define ll long long 
#define all(x) x.begin(),x.end()

const int MAX = 2e5+10 ;
const int LOG = 20 ;
const int inf = 1e8+10 ;

using namespace std ;

struct Seg
{

	ll lz[MAX*4] , mn[MAX*4];
	int idx[MAX*4] ;

	void clean()
	{
		memset(lz, 0, sizeof lz) ;
		memset(mn, 0, sizeof mn) ;
	}

	int m(int l, int r) { return (l+r)>>1 ; }
	void refresh(int pos, int l, int r)
	{
		if(!lz[pos]) return ;

		mn[pos] += lz[pos] ;

		if(l == r) return (void)(lz[pos] = 0 ) ;

		lz[pos<<1] += lz[pos] ;
		lz[pos<<1|1] += lz[pos] ;

		lz[pos] = 0 ;

	}

	void upd(int pos, int l, int r, int beg, int en , int val )
	{
		refresh(pos,l,r) ;

		if(l > en || r < beg ) return ;
		if(l >= beg && r <= en)
		{
			lz[pos] += (ll)val ;
			refresh(pos,l,r) ;
			if(l == r) idx[pos] = l ;
			return ;
		}

		upd(pos<<1 , l, m(l,r) , beg, en, val ) ;
		upd(pos<<1|1 , m(l,r)+1,r, beg, en, val ) ;

		if(mn[pos<<1] <= mn[pos<<1|1])
		{
			idx[pos] = idx[pos<<1] ;
			mn[pos] = mn[pos<<1] ;
		}
		else 
		{
			idx[pos] = idx[pos<<1|1] ;
			mn[pos] = mn[pos<<1|1] ;
		}

	}

	pii qry(int pos, int l, int r, int beg, int en )
	{
		refresh(pos,l,r) ;
		if( l > en || r < beg ) return mk(inf, -1) ;
		if(l >= beg && r <= en) return mk( mn[pos] , idx[pos] ) ;

		pii al = qry(pos<<1 , l, m(l,r) , beg, en ) ;
		pii ar = qry(pos<<1|1 , m(l,r)+1,r, beg, en ) ;

		if( al.ff <= ar.ff ) return al ;
		return ar ;
	}

} seg ;

int n , last , k ;
int dp[2][LOG][MAX] ;
vector<int> h , lef , rig ;
vector<pii> intervalLeft[MAX] , intervalRight[MAX] ;

void extract(int x)
{
	while(true)
	{
	
		pii p = mk(inf, -1) ;
		
		for(auto e : intervalLeft[x] ) 
			p = min(p, seg.qry(1,0,n-1, e.ff, e.ss) ) ;

		if(p.ff == 0) 
		{
			extract(p.ss) ;
			continue ;
		}

		h[x] = last-- ;
		
		seg.upd(1,0,n-1, x , x , inf ) ;
		for(auto e : intervalLeft[x] ) seg.upd(1,0,n-1, e.ff, e.ss, -1) ;

		return ;

	}

}

void init(int K, vector<int> r) 
{
	k = K ;
	n = sz(r) ;
	h.resize(n,0) ;
	last = n ;

	//Find intervals
	intervalLeft[0].push_back( mk(n-k+1,n-1) ) ;
	lp(i,1,n)
	{
		intervalLeft[i].push_back( mk(max(0,i-k+1) , i-1) ) ;

		if( i >= k-1 ) continue ;
		
		int falta = k-1 - i ;
		intervalLeft[i].pb( mk( n-falta , n-1 ) ) ;

	}
	intervalRight[n-1].pb( mk( 0 , k-2 ) ) ;
	lp(i,0,n-1)
	{
		intervalRight[i].pb( mk( i+1, min(n-1, i+k-1) ) ) ;

		if( i+k-1 <= n-1 ) continue ;

		int lef = k-1 - (n-i-1) ;
		intervalRight[i].pb(  mk(0,lef-1)) ;

	}

	for(int i = 0 ; i < n ; i++ ) 
		seg.upd(1,0,n-1, i , i , r[i] ); 

	while(true)
	{
		pii p = seg.qry(1,0,n-1,0,n-1) ;

		if(p.ff != 0) break ;

		extract(p.ss) ;

	}

	if(2*k > n ) return ;

	seg.clean() ;

	vector<int> idx(n) ;
	iota(all(idx) , 0 ) ;
	sort(all(idx), [&](int i, int j){ return h[i] < h[j]; }  ) ;

	memset(dp, -1, sizeof dp ) ;

	for(auto e : idx )
	{
		pii p = mk(0 , -1 ) ;
		for(auto e : intervalLeft[e] )
			p = min(p , seg.qry(1,0,n-1, e.ff, e.ss) ) ;

		dp[0][0][e] = p.ss ;

		p = mk(0, -1 ) ;
		for(auto e : intervalRight[e] ) 
			p = min(p, seg.qry(1,0,n-1, e.ff, e.ss) ) ;

		dp[1][0][e] = p.ss ;

		seg.upd(1,0,n-1,e,e, -h[e] ) ;

	}

	lp(i,0,2)
		lp(j,1,LOG)
			lp(g,0,n)
			{
				if(dp[i][j-1][g] == -1) continue ;
				dp[i][j][g] = dp[i][j-1][ dp[i][j-1][g] ] ;
			}

	/*for(auto e : h  ) cout << e << " " ;
		cout << endl ; */

}

bool isOn(int m, int i) { return ((1<<i)&m) != 0 ; }

int getDist( bool clockwise , int a, int b )
{
	if(!clockwise)
	{
		if(b < a) return a - b ;
		return a + n - b ;
	}

	if( b > a ) return b-a ;
	return n-a+b ;
}

int compare_plants(int x, int y) 
{
	if( 2*k > n || getDist(false, x, y) < k || getDist(true, x, y) < k)
		return h[x] > h[y] ? 1 : -1 ;

	for(int cur : {x,y} )
	for(int type = 0 ; type < 2 ; type++ )
	{
		int filho = cur , _filho ;
		int other = (cur == x ) ? y : x ;

		for(int i = LOG-1 ; i >= 0 ; i-- )
		{


			_filho = dp[type][i][filho] ;

			//cout << cur << " " << type << " " << filho << " " << h[filho] << " " << _filho << endl ;

			if(_filho == -1) continue ;

			int distToCur = getDist(type, _filho, cur ) ;
			int distToOther = getDist(type, _filho, other ) ;

			if(distToOther > distToCur ) continue ;

			if(distToOther < k )
			{
				if(h[other] <= h[_filho]  ) 
					return (cur == x) ? 1 : -1 ;
			}
			else if(h[_filho] > h[other] )filho = _filho ;

		}

		if(h[other] <= h[filho] && getDist(type, filho, other) < k ) 
			return (cur == x) ? 1 : -1 ;

	}

	return 0 ;

}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 9728 KB Output is correct
2 Correct 7 ms 9728 KB Output is correct
3 Correct 32 ms 53632 KB Output is correct
4 Correct 32 ms 53504 KB Output is correct
5 Correct 32 ms 53500 KB Output is correct
6 Correct 111 ms 56416 KB Output is correct
7 Correct 219 ms 58232 KB Output is correct
8 Correct 721 ms 73848 KB Output is correct
9 Correct 818 ms 73592 KB Output is correct
10 Correct 893 ms 73592 KB Output is correct
11 Correct 1008 ms 73720 KB Output is correct
12 Correct 1064 ms 73844 KB Output is correct
13 Correct 909 ms 73720 KB Output is correct
14 Correct 1201 ms 73624 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 9728 KB Output is correct
2 Correct 7 ms 9728 KB Output is correct
3 Correct 7 ms 9728 KB Output is correct
4 Correct 7 ms 9728 KB Output is correct
5 Correct 7 ms 9728 KB Output is correct
6 Correct 11 ms 9888 KB Output is correct
7 Correct 89 ms 13304 KB Output is correct
8 Correct 9 ms 9856 KB Output is correct
9 Correct 10 ms 9984 KB Output is correct
10 Correct 88 ms 13488 KB Output is correct
11 Correct 84 ms 13176 KB Output is correct
12 Correct 85 ms 13432 KB Output is correct
13 Correct 89 ms 13304 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 9728 KB Output is correct
2 Correct 7 ms 9728 KB Output is correct
3 Correct 7 ms 9728 KB Output is correct
4 Correct 7 ms 9728 KB Output is correct
5 Correct 7 ms 9728 KB Output is correct
6 Correct 11 ms 9888 KB Output is correct
7 Correct 89 ms 13304 KB Output is correct
8 Correct 9 ms 9856 KB Output is correct
9 Correct 10 ms 9984 KB Output is correct
10 Correct 88 ms 13488 KB Output is correct
11 Correct 84 ms 13176 KB Output is correct
12 Correct 85 ms 13432 KB Output is correct
13 Correct 89 ms 13304 KB Output is correct
14 Correct 132 ms 15480 KB Output is correct
15 Correct 823 ms 37368 KB Output is correct
16 Correct 131 ms 15428 KB Output is correct
17 Correct 816 ms 37276 KB Output is correct
18 Correct 452 ms 37240 KB Output is correct
19 Correct 460 ms 37240 KB Output is correct
20 Correct 734 ms 37400 KB Output is correct

Subtask #4
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 53496 KB Output is correct
2 Correct 34 ms 53504 KB Output is correct
3 Correct 158 ms 56568 KB Output is correct
4 Correct 1318 ms 77432 KB Output is correct
5 Correct 1341 ms 74108 KB Output is correct
6 Incorrect 1737 ms 73848 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #5
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 9728 KB Output is correct
2 Correct 7 ms 9728 KB Output is correct
3 Correct 32 ms 53624 KB Output is correct
4 Correct 32 ms 53624 KB Output is correct
5 Correct 32 ms 53504 KB Output is correct
6 Correct 35 ms 53632 KB Output is correct
7 Correct 58 ms 54136 KB Output is correct
8 Incorrect 52 ms 54264 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #6
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 9728 KB Output is correct
2 Correct 7 ms 9728 KB Output is correct
3 Correct 34 ms 53496 KB Output is correct
4 Correct 32 ms 53504 KB Output is correct
5 Correct 35 ms 53624 KB Output is correct
6 Correct 1108 ms 73920 KB Output is correct
7 Correct 1375 ms 73720 KB Output is correct
8 Incorrect 1313 ms 73720 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #7
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 9728 KB Output is correct
2 Correct 7 ms 9728 KB Output is correct
3 Correct 32 ms 53632 KB Output is correct
4 Correct 32 ms 53504 KB Output is correct
5 Correct 32 ms 53500 KB Output is correct
6 Correct 111 ms 56416 KB Output is correct
7 Correct 219 ms 58232 KB Output is correct
8 Correct 721 ms 73848 KB Output is correct
9 Correct 818 ms 73592 KB Output is correct
10 Correct 893 ms 73592 KB Output is correct
11 Correct 1008 ms 73720 KB Output is correct
12 Correct 1064 ms 73844 KB Output is correct
13 Correct 909 ms 73720 KB Output is correct
14 Correct 1201 ms 73624 KB Output is correct
15 Correct 7 ms 9728 KB Output is correct
16 Correct 7 ms 9728 KB Output is correct
17 Correct 7 ms 9728 KB Output is correct
18 Correct 7 ms 9728 KB Output is correct
19 Correct 7 ms 9728 KB Output is correct
20 Correct 11 ms 9888 KB Output is correct
21 Correct 89 ms 13304 KB Output is correct
22 Correct 9 ms 9856 KB Output is correct
23 Correct 10 ms 9984 KB Output is correct
24 Correct 88 ms 13488 KB Output is correct
25 Correct 84 ms 13176 KB Output is correct
26 Correct 85 ms 13432 KB Output is correct
27 Correct 89 ms 13304 KB Output is correct
28 Correct 132 ms 15480 KB Output is correct
29 Correct 823 ms 37368 KB Output is correct
30 Correct 131 ms 15428 KB Output is correct
31 Correct 816 ms 37276 KB Output is correct
32 Correct 452 ms 37240 KB Output is correct
33 Correct 460 ms 37240 KB Output is correct
34 Correct 734 ms 37400 KB Output is correct
35 Correct 32 ms 53496 KB Output is correct
36 Correct 34 ms 53504 KB Output is correct
37 Correct 158 ms 56568 KB Output is correct
38 Correct 1318 ms 77432 KB Output is correct
39 Correct 1341 ms 74108 KB Output is correct
40 Incorrect 1737 ms 73848 KB Output isn't correct
41 Halted 0 ms 0 KB -