Submission #93454

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
93454	2019-01-08T13:50:15 Z	Aydarov03	Monkey and Apple-trees (IZhO12_apple)	C++14	0 / 100	280 ms	251012 KB

apple

#include <bits/stdc++.h>
using namespace std;
const int N = 1e5;
vector <int> ans;

struct st
{
		int l , r , val;
		bool add;
		st()
		{
			l = r = val = add = 0;
		}
}tree[N * 80];

int cnt = 1;

void push( int v , int tl , int tr )
{
		if( !tree[v].l )tree[v].l = ++cnt;
		if( !tree[v].r )tree[v].r = ++cnt;
	
		if( !tree[v].add || tree[v].val )return;
		
		tree[v].val = tr - tl + 1;
		tree[v].add = 0;
		
		if( tl != tr )
		tree[ tree[v].l ].add = tree[ tree[v].r ].add = 1;
}

void upd( int l , int r , int v = 1 , int tl = 1 , int tr = 1e9 )
{
		push( v , tl , tr );
		if( tl > r || l > tr )return;
		
		if(l <= tl && tr <= r)
		{
				tree[v].add = 1;
				push( v , tl , tr );
				return;
		}
		
		int tm = (tl + tr) >> 1;
		
		upd( l , r , tree[v].l , tl , tm );
		upd( l , r , tree[v].r , tm+1 , tr );
}


int get( int l , int r , int v = 1 , int tl = 1 , int tr = 1e9)
{
	push( v , tl , tr );
	
	if( tl > r || tr < l )
		return 0;
	if( l <= tl && tr <= r )
	{
		if( tree[v].val )
		return tree[v].val;
	}
	
	if(tl == tr && !tree[v].val )return 0;
	
	int tm = (tl + tr) >> 1;
	
	return get( l , r , tree[v].l , tl , tm ) + get( l , r , tree[v].r , tm+1 , tr );
}



main()
{
	int t , c = 0;
	cin >> t;
	
	while( t-- )
	{
		int tp , l , r;		
		scanf("%d%d%d" , &tp , &l , &r );
		
		l += c , r += c;
		
		if( tp == 1 )
		{
			ans.push_back( c = get( l , r ) );
		}
		
		if( tp == 2 )
			upd(l , r);
	}
	
	for(auto c : ans)cout << c << endl;
	
}

Compilation message

apple.cpp:72:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main()
      ^
apple.cpp: In function 'int main()':
apple.cpp:80:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d%d" , &tp , &l , &r );
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1

0 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	90 ms	125560 KB	Output is correct
2	Correct	87 ms	125560 KB	Output is correct
3	Correct	95 ms	125492 KB	Output is correct
4	Correct	179 ms	125660 KB	Output is correct
5	Correct	131 ms	125660 KB	Output is correct
6	Correct	130 ms	125688 KB	Output is correct
7	Correct	144 ms	125652 KB	Output is correct
8	Runtime error	280 ms	251012 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
9	Halted	0 ms	0 KB	-