oj.uz

답안 #126844

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
126844 2019-07-08T14:01:46 Z mahmoudbadawy Examination (JOI19_examination) C++17
22 / 100
 3000 ms 151796 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update
#define F first
#define S second

using namespace std;
using namespace __gnu_pbds;

typedef tree<
pair<int,int>,
null_type,
less<pair<int,int> >,
rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;

const int N=1e5+5;

ordered_set btree[4*N];
pair<int,int> arr[N];
pair<pair<int,int>, pair<int,int> > qs[N];
vector<int> cmp;
int ans[N];
int n,q;

int get(int x)
{
	return lower_bound(cmp.begin(),cmp.end(),x)-cmp.begin();
}

void add(int ind,int sm,int x,int node=1,int l=0,int r=cmp.size()-1)
{
	if(r<ind||l>ind) return;
	btree[node].insert({sm,x});
	if(l==r)
		return;
	int mid=(l+r)/2;
	add(ind,sm,x,node*2,l,mid);
	add(ind,sm,x,node*2+1,mid+1,r);
}

void rem(int ind,int sm,int x,int node=1,int l=0,int r=cmp.size()-1)
{
	if(r<ind||l>ind) return;
	btree[node].erase({sm,x});
	if(l==r)
		return;
	int mid=(l+r)/2;
	rem(ind,sm,x,node*2,l,mid);
	rem(ind,sm,x,node*2+1,mid+1,r);
}

int query(int ql,int qr,int val,int node=1,int l=0,int r=cmp.size()-1)
{
	if(r<ql||qr<l) return 0;
	if(ql<=l&&r<=qr)
	{
		return btree[node].size()-btree[node].order_of_key({val,-1});
	}
	int mid=(l+r)/2;
	return query(ql,qr,val,node*2,l,mid)+query(ql,qr,val,node*2+1,mid+1,r);
}

int main()
{
	scanf("%d %d",&n,&q);
	for(int i=0;i<n;i++)
	{
		scanf("%d %d",&arr[i].F,&arr[i].S);
		cmp.push_back(arr[i].S);
	}
	for(int i=0;i<q;i++)
	{
		scanf("%d %d %d",&qs[i].F.F,&qs[i].F.S,&qs[i].S.F);
		qs[i].S.S=i;
		cmp.push_back(qs[i].F.S);
	}
	sort(cmp.begin(),cmp.end());
	cmp.erase(unique(cmp.begin(),cmp.end()),cmp.end());
	sort(arr,arr+n);
	sort(qs,qs+q);
	for(int i=0;i<n;i++)
	{
		add(get(arr[i].S),arr[i].F+arr[i].S,i);
	}
	int curs=0;
	for(int i=0;i<q;i++)
	{
		while(arr[curs].F<qs[i].F.F)
		{
			rem(get(arr[curs].S),arr[curs].F+arr[curs].S,curs);
			curs++;
		}
		/*cout << "ON " << qs[i].F.F << " " << curs << endl;
		for(int i=0;i<btree[1].size();i++)
		{
			auto x=*btree[1].find_by_order(i);
			cout << x.F << " " << x.S << endl;
		}*/
		ans[qs[i].S.S]=query(get(qs[i].F.S),cmp.size()-1,qs[i].S.F);
	}
	for(int i=0;i<q;i++)
		printf("%d\n",ans[i]);
}

Compilation message

examination.cpp: In function 'int main()':
examination.cpp:67:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d",&n,&q);
  ~~~~~^~~~~~~~~~~~~~~
examination.cpp:70:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d",&arr[i].F,&arr[i].S);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
examination.cpp:75:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d %d",&qs[i].F.F,&qs[i].F.S,&qs[i].S.F);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 54 ms 37880 KB Output is correct
2 Correct 50 ms 37880 KB Output is correct
3 Correct 51 ms 37880 KB Output is correct
4 Correct 50 ms 37880 KB Output is correct
5 Correct 114 ms 37880 KB Output is correct
6 Correct 116 ms 38020 KB Output is correct
7 Correct 229 ms 40696 KB Output is correct
8 Correct 230 ms 40616 KB Output is correct
9 Correct 232 ms 40568 KB Output is correct
10 Correct 112 ms 38956 KB Output is correct
11 Correct 72 ms 40616 KB Output is correct
12 Correct 58 ms 38904 KB Output is correct
13 Correct 229 ms 40628 KB Output is correct
14 Correct 228 ms 40568 KB Output is correct
15 Correct 228 ms 40696 KB Output is correct
16 Correct 74 ms 40572 KB Output is correct
17 Correct 57 ms 38436 KB Output is correct
18 Correct 58 ms 38520 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2818 ms 151476 KB Output is correct
2 Correct 2718 ms 151724 KB Output is correct
3 Correct 2796 ms 151796 KB Output is correct
4 Correct 466 ms 70508 KB Output is correct
5 Correct 1329 ms 151500 KB Output is correct
6 Correct 423 ms 70508 KB Output is correct
7 Correct 2257 ms 151544 KB Output is correct
8 Correct 2748 ms 148932 KB Output is correct
9 Correct 2196 ms 148752 KB Output is correct
10 Correct 897 ms 151488 KB Output is correct
11 Correct 362 ms 54504 KB Output is correct
12 Correct 423 ms 60532 KB Output is correct

Subtask #3
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2818 ms 151476 KB Output is correct
2 Correct 2718 ms 151724 KB Output is correct
3 Correct 2796 ms 151796 KB Output is correct
4 Correct 466 ms 70508 KB Output is correct
5 Correct 1329 ms 151500 KB Output is correct
6 Correct 423 ms 70508 KB Output is correct
7 Correct 2257 ms 151544 KB Output is correct
8 Correct 2748 ms 148932 KB Output is correct
9 Correct 2196 ms 148752 KB Output is correct
10 Correct 897 ms 151488 KB Output is correct
11 Correct 362 ms 54504 KB Output is correct
12 Correct 423 ms 60532 KB Output is correct
13 Execution timed out 3065 ms 151568 KB Time limit exceeded
14 Halted 0 ms 0 KB -

Subtask #4
0 / 57.0

# 결과 실행 시간 메모리 Grader output
1 Correct 54 ms 37880 KB Output is correct
2 Correct 50 ms 37880 KB Output is correct
3 Correct 51 ms 37880 KB Output is correct
4 Correct 50 ms 37880 KB Output is correct
5 Correct 114 ms 37880 KB Output is correct
6 Correct 116 ms 38020 KB Output is correct
7 Correct 229 ms 40696 KB Output is correct
8 Correct 230 ms 40616 KB Output is correct
9 Correct 232 ms 40568 KB Output is correct
10 Correct 112 ms 38956 KB Output is correct
11 Correct 72 ms 40616 KB Output is correct
12 Correct 58 ms 38904 KB Output is correct
13 Correct 229 ms 40628 KB Output is correct
14 Correct 228 ms 40568 KB Output is correct
15 Correct 228 ms 40696 KB Output is correct
16 Correct 74 ms 40572 KB Output is correct
17 Correct 57 ms 38436 KB Output is correct
18 Correct 58 ms 38520 KB Output is correct
19 Correct 2818 ms 151476 KB Output is correct
20 Correct 2718 ms 151724 KB Output is correct
21 Correct 2796 ms 151796 KB Output is correct
22 Correct 466 ms 70508 KB Output is correct
23 Correct 1329 ms 151500 KB Output is correct
24 Correct 423 ms 70508 KB Output is correct
25 Correct 2257 ms 151544 KB Output is correct
26 Correct 2748 ms 148932 KB Output is correct
27 Correct 2196 ms 148752 KB Output is correct
28 Correct 897 ms 151488 KB Output is correct
29 Correct 362 ms 54504 KB Output is correct
30 Correct 423 ms 60532 KB Output is correct
31 Execution timed out 3065 ms 151568 KB Time limit exceeded
32 Halted 0 ms 0 KB -