Submission #1303362
Source Code Expand
#define _USE_MATH_DEFINES #include <cassert> #include <cstdio> #include <cstring> #include <iostream> #include <string> #include <sstream> #include <vector> #include <queue> #include <stack> #include <list> #include <set> #include <map> #include <unordered_set> #include <unordered_map> #include <algorithm> #include <complex> #include <cmath> #include <numeric> #include <bitset> using namespace std; #define trace(...) __f(#__VA_ARGS__, __VA_ARGS__) template <typename Arg1> void __f(const char* name, Arg1&& arg1){ cerr << name << ": " << arg1 << endl; } template <typename Arg1, typename... Args> void __f(const char* names, Arg1&& arg1, Args&&... args){ const char* comma = strchr(names + 1, ','); cerr.write(names, comma - names) << ": " << arg1 << " |"; __f(comma + 1, args...); } typedef long long int64; typedef pair<int, int> ii; const int INF = 1 << 30; const int MOD = 1e9 + 7; const int N = 1e5 + 10; int64 a[N]; int dp[2][N]; void add(int c[], int n, int x, int y) { for (++x; x <= n; x += x & -x) { c[x] = (c[x] + y) % MOD; } } void clear(int c[], int n, int x) { for (++x; x <= n; x += x & -x) { c[x] = 0; } } int query(int c[], int x) { int ret = 0; for (; x; x -= x & -x) { ret = (ret + c[x]) % MOD; } return ret; } int main() { int n; int64 A[2]; scanf("%d%lld%lld", &n, &A[0], &A[1]); a[0] = -(1LL << 60); for (int i = 1; i <= n; ++i) { scanf("%lld", &a[i]); } set<int> visit[2]; for (int k = 0; k < 2; ++k) { add(dp[k], n, 0, 1); visit[k].insert(0); } for (int i = 2; i <= n; ++i) { int y[2]; for (int k = 0; k < 2; ++k) { int x = upper_bound(a, a + i - 1, a[i] - A[k]) - a; y[k] = query(dp[1 - k], x); } for (int k = 0; k < 2; ++k) { if (a[i] < a[i - 1] + A[k]) { for (auto& it : visit[k]) { clear(dp[k], n, it); } visit[k].clear(); } add(dp[k], n, i - 1, y[k]); visit[k].insert(i - 1); } } int ret = (query(dp[0], n) + query(dp[1], n)) % MOD; printf("%d\n", ret); return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Division into Two |
User | cuiaoxiang |
Language | C++14 (GCC 5.4.1) |
Score | 1100 |
Code Size | 2171 Byte |
Status | AC |
Exec Time | 76 ms |
Memory | 11136 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:68:40: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d%lld%lld", &n, &A[0], &A[1]); ^ ./Main.cpp:71:25: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%lld", &a[i]); ^
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 1100 / 1100 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | s1.txt, s2.txt, s3.txt, s4.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, 35.txt, 36.txt, 37.txt, 38.txt, 39.txt, 40.txt, 41.txt, 42.txt, 43.txt, 44.txt, 45.txt, 46.txt, 47.txt, 48.txt, 49.txt, 50.txt, 51.txt, 52.txt, 53.txt, 54.txt, 55.txt, 56.txt, 57.txt, 58.txt, 59.txt, 60.txt, 61.txt, 62.txt, 63.txt, 64.txt, s1.txt, s2.txt, s3.txt, s4.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
01.txt | AC | 48 ms | 1792 KB |
02.txt | AC | 45 ms | 1792 KB |
03.txt | AC | 43 ms | 1792 KB |
04.txt | AC | 41 ms | 1792 KB |
05.txt | AC | 56 ms | 6528 KB |
06.txt | AC | 41 ms | 1792 KB |
07.txt | AC | 42 ms | 1792 KB |
08.txt | AC | 47 ms | 1792 KB |
09.txt | AC | 43 ms | 1792 KB |
10.txt | AC | 43 ms | 1792 KB |
11.txt | AC | 41 ms | 1792 KB |
12.txt | AC | 76 ms | 11136 KB |
13.txt | AC | 47 ms | 1792 KB |
14.txt | AC | 43 ms | 1792 KB |
15.txt | AC | 41 ms | 1792 KB |
16.txt | AC | 47 ms | 6528 KB |
17.txt | AC | 49 ms | 6528 KB |
18.txt | AC | 51 ms | 6528 KB |
19.txt | AC | 44 ms | 1920 KB |
20.txt | AC | 40 ms | 1792 KB |
21.txt | AC | 39 ms | 1792 KB |
22.txt | AC | 52 ms | 4864 KB |
23.txt | AC | 41 ms | 1792 KB |
24.txt | AC | 40 ms | 1792 KB |
25.txt | AC | 43 ms | 1792 KB |
26.txt | AC | 43 ms | 1792 KB |
27.txt | AC | 42 ms | 1792 KB |
28.txt | AC | 42 ms | 1792 KB |
29.txt | AC | 41 ms | 1792 KB |
30.txt | AC | 41 ms | 1792 KB |
31.txt | AC | 42 ms | 1792 KB |
32.txt | AC | 44 ms | 1792 KB |
33.txt | AC | 46 ms | 1792 KB |
34.txt | AC | 43 ms | 1920 KB |
35.txt | AC | 48 ms | 2304 KB |
36.txt | AC | 68 ms | 11136 KB |
37.txt | AC | 52 ms | 6528 KB |
38.txt | AC | 52 ms | 6528 KB |
39.txt | AC | 58 ms | 6528 KB |
40.txt | AC | 35 ms | 1792 KB |
41.txt | AC | 37 ms | 1792 KB |
42.txt | AC | 30 ms | 1792 KB |
43.txt | AC | 74 ms | 11136 KB |
44.txt | AC | 75 ms | 11136 KB |
45.txt | AC | 74 ms | 10624 KB |
46.txt | AC | 76 ms | 10752 KB |
47.txt | AC | 51 ms | 1920 KB |
48.txt | AC | 49 ms | 1792 KB |
49.txt | AC | 1 ms | 256 KB |
50.txt | AC | 1 ms | 256 KB |
51.txt | AC | 1 ms | 256 KB |
52.txt | AC | 1 ms | 256 KB |
53.txt | AC | 1 ms | 256 KB |
54.txt | AC | 1 ms | 256 KB |
55.txt | AC | 1 ms | 256 KB |
56.txt | AC | 1 ms | 256 KB |
57.txt | AC | 1 ms | 256 KB |
58.txt | AC | 1 ms | 256 KB |
59.txt | AC | 1 ms | 256 KB |
60.txt | AC | 1 ms | 256 KB |
61.txt | AC | 1 ms | 256 KB |
62.txt | AC | 1 ms | 256 KB |
63.txt | AC | 1 ms | 256 KB |
64.txt | AC | 1 ms | 256 KB |
s1.txt | AC | 1 ms | 256 KB |
s2.txt | AC | 1 ms | 256 KB |
s3.txt | AC | 1 ms | 256 KB |
s4.txt | AC | 1 ms | 256 KB |