Submission #1551970
Source Code Expand
#include <cstdio>
#include <vector>
#include <algorithm>
#include <cstring>
using namespace std;
const int N = 2e5 + 500;
const int MOD = 1e9 + 7;
const int INF = 0x3f3f3f3f;
typedef pair < int ,int > pii;
typedef long long int llint;
vector < int > sazv;
vector < pii > vl;
int l[N],r[N],fen[2 * N],dp[N],n;
void add(int i,int x){
for(;i<N;i+=i&-i){
fen[i] = max(fen[i],x);
}
}
int query(int i){
int ret = 0;
for(;i>0;i-=i&-i)
ret = max(ret,fen[i]);
return ret;
}
void sazimanje(){
for(int i = 1;i<=vl.size();i++){
sazv.push_back(vl[i].second);
}
sort(sazv.begin(),sazv.end());
sazv.erase(unique(sazv.begin(),sazv.end()),sazv.end());
for(int i = 1;i<=vl.size();i++){
vl[i].second = lower_bound(sazv.begin(),sazv.end(),vl[i].second) - sazv.begin() + 1;
}
}
void nadilr(){
for(int i = 0;i<2*N;i++) fen[i] = 0;
for(int i = 1;i<vl.size();i++){
add(N - vl[i].second , N - i);
l[i] = min(N - query(N - vl[i].second), (int)vl.size() - 1 );
}
for(int i = 0;i<2*N;i++) fen[i] = 0;
for(int i = vl.size() - 1;i>=1;i--){
add(vl[i].second , i);
r[i] = query(vl[i].second);
}
for(int i = 0;i<2*N;i++) fen[i] = 0;
for(int i = 1;i<vl.size() ;i++){
add(r[i] ,l[i] );
}
}
int din(){
dp[0] = 1;
for(int i = 1;i<vl.size();i++){
int lim = query(i - 1);
dp[i] = 2 * dp[i - 1] % MOD;
if(lim) dp[i] -= dp[lim-1];
if(dp[i] < 0) dp[i] += MOD;
}
int finlim = query(vl.size());
return dp[vl.size() - 1] - dp[finlim - 1];
}
int main(){
scanf("%d",&n);
for(int i = 0;i<n;i++){
int x,y;
scanf("%d%d",&x,&y);
vl.push_back(make_pair(x,y));
}
vl.push_back(make_pair(0,0));
sort(vl.begin(),vl.end());
sazimanje();
nadilr();
printf("%d\n",din());
}
Submission Info
Submission Time
2017-08-29 22:52:18+0900
Task
E - Mr.Aoki Incubator
User
patrikpavic2
Language
C++14 (GCC 5.4.1)
Score
0
Code Size
1972 Byte
Status
WA
Exec Time
123 ms
Memory
7536 KB
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:75:19: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d",&n);
^
./Main.cpp:78:28: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d",&x,&y);
^
Judge Result
Set Name
Sample
All
Score / Max Score
0 / 0
0 / 1200
Status
Set Name
Test Cases
Sample
s1.txt, s2.txt
All
01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, 21.txt, 22.txt, 23.txt, 24.txt, 25.txt, 26.txt, 27.txt, 28.txt, 29.txt, 30.txt, 31.txt, 32.txt, 33.txt, 34.txt, s1.txt, s2.txt
Case Name
Status
Exec Time
Memory
01.txt
AC
108 ms
7536 KB
02.txt
AC
123 ms
7536 KB
03.txt
AC
119 ms
7536 KB
04.txt
WA
107 ms
7536 KB
05.txt
AC
123 ms
7536 KB
06.txt
AC
118 ms
7536 KB
07.txt
WA
108 ms
7536 KB
08.txt
AC
123 ms
7536 KB
09.txt
AC
100 ms
7536 KB
10.txt
AC
73 ms
7536 KB
11.txt
AC
105 ms
7536 KB
12.txt
AC
101 ms
7536 KB
13.txt
WA
90 ms
7536 KB
14.txt
AC
106 ms
7536 KB
15.txt
WA
102 ms
7536 KB
16.txt
WA
91 ms
7536 KB
17.txt
WA
104 ms
7536 KB
18.txt
WA
101 ms
7536 KB
19.txt
WA
89 ms
7536 KB
20.txt
WA
105 ms
7536 KB
21.txt
AC
107 ms
7536 KB
22.txt
WA
95 ms
7536 KB
23.txt
WA
111 ms
7536 KB
24.txt
WA
107 ms
7536 KB
25.txt
AC
89 ms
7536 KB
26.txt
AC
103 ms
7536 KB
27.txt
AC
107 ms
7536 KB
28.txt
AC
87 ms
7536 KB
29.txt
WA
104 ms
7536 KB
30.txt
WA
100 ms
7536 KB
31.txt
AC
2 ms
1792 KB
32.txt
AC
2 ms
1792 KB
33.txt
AC
2 ms
1792 KB
34.txt
AC
2 ms
1792 KB
s1.txt
AC
2 ms
1792 KB
s2.txt
AC
2 ms
1792 KB