首页 > 试题广场 >

vcd

[编程题]vcd
Kanade has an infinity set H contain all of sets such as {(x,y)|x>=a,l<=y<=r}  (a,l,r are arbitrary real numbers)
A point set S is good if and only if for each subset T of S there exist h in H satisfy 

Now kanade has n distinct points and she want to know how many non-empty subset of these points is good.

You need to output the answer module 998244353

输入描述:
The first line has one integer n

Then there are n lines,each line has two integers x,y denote a point (x,y)


输出描述:
Output the answer module 998244353
示例1

输入

3
1 1
2 2
3 3

输出

6

备注:
1<=n<=10^5

1<=x, y<=10^9
算法知识视频讲解
开通博客

暂无题解

问题信息

线段树 树状数组
难度：
0条回答 114浏览

热门推荐

通过挑战的用户

查看代码

相关试题

vcd

扫一扫，把题目装进口袋

求职之前，先上牛客

扫描二维码，进入QQ群

扫描二维码，关注牛客公众号