Submission #1305693
Source Code Expand
#include <bits/stdc++.h> #ifdef NO_UNLOCK_IO #define getchar_unlocked getchar #define putchar_unlocked putchar #endif struct FastIO { static void scan(double &x) { scanf("%lf", &x); } template <class Integral> static void scan(Integral &x) { int k, m = 1; x = 0; for (;;) { k = getchar_unlocked(); //if (k == '-') { // m = -1; // break; //} //else if ('0' <= k && k <= '9') { x = k - '0'; break; } } for (;;) { k = getchar_unlocked(); if (k < '0' || k > '9') break; x = x * 10 + k - '0'; } //x *= m;//mul is faster than branch-misprediction penalty (maybe) } template <class Arithmetic, class... Rest> static void scan(Arithmetic &x, Rest&... y) { scan(x); scan(y...); } static void print(double x, char c) { printf("%.12f%c", x, c); } static void print(const char *x, char c) { printf("%s%c", x, c); } template <class Integral> static void print(Integral x, char c) { int s = 0, m = 0; char f[20];//Is this faster than "static char" ? if (x < 0) { m = 1; x = -x; } while (x) { f[s++] = x % 10; x /= 10; } if (!s) f[s++] = 0; if (m) putchar_unlocked('-'); while (s--) putchar_unlocked(f[s] + '0'); putchar_unlocked(c); } template <class Arithmetic> static void println(Arithmetic x) { print(x, '\n'); } }; using namespace std; typedef long long LL; const LL INF = 1LL << 61; const int mod = 1e9 + 7; int N; LL A, B; LL v[100005]; int dp[100005][2]; int add(int x, int y) {x += y; if(x >= mod) x -= mod; return x;} int sub(int x, int y) {x -= y; if(x < 0) x += mod; return x;} int main() { //scanf("%d", &N); //scanf("%lld%lld", &A, &B); FastIO::scan(N,A,B); if(A > B) swap(A, B); v[0] = -INF; for(int i = 1; i <= N; i++){ //scanf("%lld", &v[i]); FastIO::scan(v[i]); } dp[1][0] = dp[1][1] = 1; int posB = 1; int lftA = 1; for(int i = 2; i <= N; i++) { if(v[i] - v[i - 1] >= A) dp[i][0] = add(dp[i - 1][0], dp[i - 1][1]); else if(v[i] - v[i - 2] >= A) dp[i][0] = dp[i - 1][1]; else { if(i > 2) { printf("0\n"); return 0; } } while(v[i] - v[posB] >= B) posB++; if(posB == i) dp[i][1] = add(dp[i - 1][0], dp[i - 1][1]); else if(lftA <= posB) dp[i][1] = dp[posB][0]; if(v[i] - v[i - 1] >= A); else lftA = i; } int ans = add(dp[N][0], dp[N][1]); printf("%d\n", ans); return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Division into Two |
User | eukaryo |
Language | C++14 (GCC 5.4.1) |
Score | 1100 |
Code Size | 2615 Byte |
Status | AC |
Exec Time | 7 ms |
Memory | 1792 KB |
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 | 7 ms | 1792 KB |
02.txt | AC | 6 ms | 1792 KB |
03.txt | AC | 7 ms | 1792 KB |
04.txt | AC | 7 ms | 1792 KB |
05.txt | AC | 6 ms | 1792 KB |
06.txt | AC | 7 ms | 1792 KB |
07.txt | AC | 7 ms | 1792 KB |
08.txt | AC | 7 ms | 1792 KB |
09.txt | AC | 7 ms | 1792 KB |
10.txt | AC | 7 ms | 1792 KB |
11.txt | AC | 7 ms | 1792 KB |
12.txt | AC | 7 ms | 1792 KB |
13.txt | AC | 7 ms | 1792 KB |
14.txt | AC | 7 ms | 1792 KB |
15.txt | AC | 6 ms | 1792 KB |
16.txt | AC | 3 ms | 1792 KB |
17.txt | AC | 4 ms | 1792 KB |
18.txt | AC | 5 ms | 1792 KB |
19.txt | AC | 5 ms | 1792 KB |
20.txt | AC | 5 ms | 1792 KB |
21.txt | AC | 5 ms | 1792 KB |
22.txt | AC | 5 ms | 1792 KB |
23.txt | AC | 4 ms | 1792 KB |
24.txt | AC | 5 ms | 1792 KB |
25.txt | AC | 6 ms | 1792 KB |
26.txt | AC | 6 ms | 1792 KB |
27.txt | AC | 6 ms | 1792 KB |
28.txt | AC | 6 ms | 1792 KB |
29.txt | AC | 5 ms | 1792 KB |
30.txt | AC | 5 ms | 1792 KB |
31.txt | AC | 5 ms | 1792 KB |
32.txt | AC | 6 ms | 1792 KB |
33.txt | AC | 6 ms | 1792 KB |
34.txt | AC | 4 ms | 1792 KB |
35.txt | AC | 6 ms | 1792 KB |
36.txt | AC | 4 ms | 1792 KB |
37.txt | AC | 3 ms | 1792 KB |
38.txt | AC | 4 ms | 1792 KB |
39.txt | AC | 7 ms | 1792 KB |
40.txt | AC | 3 ms | 1792 KB |
41.txt | AC | 4 ms | 1792 KB |
42.txt | AC | 3 ms | 1024 KB |
43.txt | AC | 7 ms | 1792 KB |
44.txt | AC | 7 ms | 1792 KB |
45.txt | AC | 7 ms | 1792 KB |
46.txt | AC | 7 ms | 1792 KB |
47.txt | AC | 6 ms | 1152 KB |
48.txt | AC | 6 ms | 1024 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 |