首页 > 试题广场 >

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 $h \cap S=T$

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

输入

1<=n<=10^5

1<=x, y<=10^9

算法知识视频讲解

这道题你会答吗？花几分钟告诉大家答案吧！

提交观点

线段树树状数组

难度：

0条回答 0收藏 115浏览

查看代码

vcd

扫一扫，把题目装进口袋