Submission #11631239
Source Code Expand
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
#define ll long long
typedef pair<int, int> par;
struct {
inline operator int() {
int x;
return scanf("%lld", &x), x;
}
inline operator ll() {
ll x;
return scanf("%lld", &x), x;
}
template<class T> inline void operator ()(T &x) {
x = *this;
}
template<class T, class ...A >inline void operator () (T &x, A &...a) {
x = *this;
this->operator ()(a...);
}
} read;
const int MAXN = 2e5 + 5, P = 1e9 + 7;
int l[MAXN], r[MAXN];
int p[MAXN];
int tmp[MAXN];
par pr[MAXN];
ll f[MAXN], s[MAXN];
int main() {
int n = read;
for(int i = 1; i <= n; ++i) {
read(pr[i].second, pr[i].first);
}
std::sort(pr + 1, pr + n + 1);
for(int i = 1; i <= n; ++i) {
tmp[i] = pr[i].second;
}
std::sort(tmp + 1, tmp + n + 1);
for(int i = 1; i <= n; ++i) {
pr[i].second = int(std::lower_bound(tmp + 1, tmp + n + 1, pr[i].second) - tmp);
p[pr[i].second] = i;
}
for(int i = 1; i <= n; ++i) {
r[i] = std::max(r[i - 1], p[i]);
}
l[n] = p[n];
for(int i = n - 1; i; --i) {
l[i] = std::min(l[i + 1], p[i]);
}
int L = 0;
f[0] = s[0] = 1;
for(int i = 1; i <= n; ++i) {
while(r[L] < l[i] - 1) {
++L;
}
f[i] = (s[i - 1] - s[L - 1] + P) % P;
s[i] = (s[i - 1] + f[i]) % P;
}
while(r[L] < n) {
++L;
}
printf("%lld\n", (s[n] - s[L - 1] + P) % P);
return 0;
}
Submission Info
Submission Time
2020-04-07 13:17:57+0900
Task
E - Mr.Aoki Incubator
User
luogu_bot3
Language
C++ (GCC 5.4.1)
Score
1200
Code Size
1379 Byte
Status
AC
Exec Time
102 ms
Memory
8064 KB
Compile Error
./Main.cpp:21:26: warning: variadic templates only available with -std=c++11 or -std=gnu++11
template<class T, class ...A >inline void operator () (T &x, A &...a) {
^
./Main.cpp:21:69: warning: variadic templates only available with -std=c++11 or -std=gnu++11
template<class T, class ...A >inline void operator () (T &x, A &...a) {
^
./Main.cpp: In member function ‘<anonymous struct>::operator int()’:
./Main.cpp:12:26: warning: format ‘%lld’ expects argument of type ‘long long int*’, but argument 2 has type ‘int*’ [-Wformat=]
return scanf("%lld", &x), x;
^
./Main.cpp: At global scope:
./Main.cpp:25:3: warning: anonymous type with no linkage used to declare variable ‘<anonymous struct> read’ with linkage
} read;
^
./Main.cpp: In member function ‘<anonymous struct>::operator int()’:
./Main.cpp:12:29: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attri...
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
101 ms
8064 KB
02.txt
AC
101 ms
8064 KB
03.txt
AC
102 ms
8064 KB
04.txt
AC
101 ms
8064 KB
05.txt
AC
101 ms
8064 KB
06.txt
AC
102 ms
8064 KB
07.txt
AC
101 ms
8064 KB
08.txt
AC
101 ms
8064 KB
09.txt
AC
78 ms
8064 KB
10.txt
AC
66 ms
8064 KB
11.txt
AC
67 ms
8064 KB
12.txt
AC
78 ms
8064 KB
13.txt
AC
67 ms
8064 KB
14.txt
AC
68 ms
8064 KB
15.txt
AC
78 ms
8064 KB
16.txt
AC
67 ms
8064 KB
17.txt
AC
67 ms
8064 KB
18.txt
AC
78 ms
8064 KB
19.txt
AC
66 ms
8064 KB
20.txt
AC
67 ms
8064 KB
21.txt
AC
81 ms
8064 KB
22.txt
AC
71 ms
8064 KB
23.txt
AC
71 ms
8064 KB
24.txt
AC
80 ms
8064 KB
25.txt
AC
69 ms
8064 KB
26.txt
AC
67 ms
8064 KB
27.txt
AC
78 ms
8064 KB
28.txt
AC
69 ms
8064 KB
29.txt
AC
67 ms
8064 KB
30.txt
AC
78 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