Submission #1552037
Source Code Expand
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<set>
#include<map>
#include<cmath>
using namespace std;
const int MAXN = 200005;
const int INF = 1000000007;
int n, ind;
int lef[MAXN], rig[MAXN], dp[MAXN], mini[MAXN], suf[MAXN], pot[MAXN];
pair <int, int> pii[MAXN], l[MAXN];
set <int> s;
int add (int a, int b) {
if (a+b>=INF) return a+b-INF; return a+b;
}
int sub (int a, int b) {
if (a-b<0) return a-b+INF; return a-b;
}
int main () {
pot[0]=1;
cin >> n;
for (int i=0; i<n; i++) {
pot[i+1]=add(pot[i], pot[i]);
mini[i]=INF;
int xx, vv;
scanf("%d%d", &xx, &vv);
pii[i]=make_pair(xx, vv);
}
sort(pii, pii+n);
for (int i=0; i<n; i++) {
l[i]=make_pair(pii[i].second, i);
}
sort(l, l+n);
ind=-INF;
for (int i=0; i<n; i++) {
ind=max(ind, l[i].second);
rig[i]=ind;
}
ind=INF;
for (int i=n-1; i>=0; i--) {
ind=min(ind, l[i].second);
lef[i]=ind;
}
for (int i=0; i<n; i++) {
mini[lef[i]]=min(mini[lef[i]], rig[i]);
}
dp[n]=suf[n]=1, ind=INF;
for (int i=n-1; i>=0; i--) {
ind=min(ind, mini[i]);
if (ind==INF) {
dp[i]=pot[n-i];
} else {
dp[i]=sub(suf[i+1], suf[ind+2]);
}
suf[i]=add(suf[i+1], dp[i]);
}
cout << dp[0];
return 0;
}
Submission Info
Submission Time
2017-08-29 23:38:59+0900
Task
E - Mr.Aoki Incubator
User
keko37
Language
C++14 (GCC 5.4.1)
Score
1200
Code Size
1455 Byte
Status
AC
Exec Time
75 ms
Memory
8064 KB
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:33:32: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d", &xx, &vv);
^
Judge Result
Set Name
Sample
All
Score / Max Score
0 / 0
1200 / 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
63 ms
8064 KB
02.txt
AC
63 ms
8064 KB
03.txt
AC
75 ms
8064 KB
04.txt
AC
63 ms
8064 KB
05.txt
AC
64 ms
8064 KB
06.txt
AC
74 ms
8064 KB
07.txt
AC
63 ms
8064 KB
08.txt
AC
64 ms
8064 KB
09.txt
AC
64 ms
8064 KB
10.txt
AC
52 ms
8064 KB
11.txt
AC
52 ms
8064 KB
12.txt
AC
64 ms
8064 KB
13.txt
AC
52 ms
8064 KB
14.txt
AC
53 ms
8064 KB
15.txt
AC
64 ms
8064 KB
16.txt
AC
52 ms
8064 KB
17.txt
AC
53 ms
8064 KB
18.txt
AC
64 ms
8064 KB
19.txt
AC
52 ms
8064 KB
20.txt
AC
53 ms
8064 KB
21.txt
AC
66 ms
8064 KB
22.txt
AC
54 ms
8064 KB
23.txt
AC
55 ms
8064 KB
24.txt
AC
65 ms
8064 KB
25.txt
AC
52 ms
8064 KB
26.txt
AC
53 ms
8064 KB
27.txt
AC
64 ms
8064 KB
28.txt
AC
52 ms
8064 KB
29.txt
AC
53 ms
8064 KB
30.txt
AC
64 ms
8064 KB
31.txt
AC
2 ms
4352 KB
32.txt
AC
2 ms
4352 KB
33.txt
AC
2 ms
4352 KB
34.txt
AC
2 ms
4352 KB
s1.txt
AC
2 ms
4352 KB
s2.txt
AC
2 ms
4352 KB