Submission #1358818
Source Code Expand
#pragma region include #include <iostream> #include <iomanip> #include <stdio.h> #include <sstream> #include <algorithm> #include <cmath> #include <complex> #include <string> #include <cstring> #include <vector> #include <tuple> #include <bitset> #include <queue> #include <complex> #include <set> #include <map> #include <stack> #include <list> #include <fstream> #include <random> //#include <time.h> #include <ctime> #pragma endregion //#include ///////// #define REP(i, x, n) for(int i = x; i < n; ++i) #define rep(i,n) REP(i,0,n) ///////// #pragma region typedef typedef long long LL; typedef long double LD; typedef unsigned long long ULL; #pragma endregion //typedef ////定数 const int INF = (int)1e9; const LL MOD = (LL)1e9+7; const LL LINF = (LL)1e18; const double PI = acos(-1.0); const double EPS = 1e-9; ///////// using namespace::std; /* thx http://topcoder.g.hatena.ne.jp/kuuso1/20170124/1485278180 */ void solve(){ int N; LL A,B; cin >> N >> A >> B; vector<LL> S(N+1); S[0] = -LINF; for(int i=0;i<N;++i){ cin >> S[i+1]; } if( A > B ){ swap(A,B); } if( N == 1 ){ cout << 2 << endl; return; } vector<LL> dpA(N+1,0),dpB(N+1,0); vector<LL> sumA(N+2,0),sumB(N+2,0); dpA[0] = 1; sumA[1] = 1; dpB[0] = 1; sumB[1] = 1; int clA = 0;//[0,clA) int clB = 0; int okA = 0; int okB = 0; for(int i=1;i<N;++i){ while(S[okA] <= S[i+1] - A && okA < i ){ okA++; } while(S[okB] <= S[i+1] -B && okB < i ){ okB++; } if(okA >= clB ){ dpA[i] = sumB[okA]-sumB[clB] + MOD; } if(dpA[i] >= MOD ){dpA[i] -= MOD;} if(okB >= clA ){ dpB[i] = sumA[okB]-sumA[clA] + MOD; } if( dpB[i] >= MOD ){dpB[i] -= MOD;} if(S[i+1]-A < S[i]) clA = i; if(S[i+1]-B < S[i]) clB = i; sumA[i+1] = sumA[i] + dpA[i]; if(sumA[i+1]>=MOD)sumA[i+1]-=MOD; sumB[i+1] = sumB[i] + dpB[i]; if(sumB[i+1]>=MOD)sumB[i+1]-=MOD; } LL ans = sumA[N]+sumB[N]+ (-sumA[clA]+MOD)+ (-sumB[clB]+MOD); ans %= MOD; cout << ans << endl; } #pragma region main signed main(void){ std::cin.tie(0); std::ios::sync_with_stdio(false); std::cout << std::fixed;//小数を10進数表示 cout << setprecision(16);//小数点以下の桁数を指定//coutとcerrで別 solve(); } #pragma endregion //main()
Submission Info
Submission Time | |
---|---|
Task | C - Division into Two |
User | akarin55 |
Language | C++14 (GCC 5.4.1) |
Score | 1100 |
Code Size | 2356 Byte |
Status | AC |
Exec Time | 20 ms |
Memory | 4224 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 | 20 ms | 4224 KB |
02.txt | AC | 18 ms | 4224 KB |
03.txt | AC | 18 ms | 4224 KB |
04.txt | AC | 18 ms | 4224 KB |
05.txt | AC | 18 ms | 4224 KB |
06.txt | AC | 18 ms | 4224 KB |
07.txt | AC | 19 ms | 4224 KB |
08.txt | AC | 19 ms | 4224 KB |
09.txt | AC | 19 ms | 4224 KB |
10.txt | AC | 19 ms | 4224 KB |
11.txt | AC | 18 ms | 4224 KB |
12.txt | AC | 19 ms | 4224 KB |
13.txt | AC | 19 ms | 4224 KB |
14.txt | AC | 18 ms | 4224 KB |
15.txt | AC | 18 ms | 4224 KB |
16.txt | AC | 12 ms | 4224 KB |
17.txt | AC | 13 ms | 4224 KB |
18.txt | AC | 15 ms | 4224 KB |
19.txt | AC | 13 ms | 4224 KB |
20.txt | AC | 16 ms | 4224 KB |
21.txt | AC | 15 ms | 4224 KB |
22.txt | AC | 15 ms | 4224 KB |
23.txt | AC | 12 ms | 4224 KB |
24.txt | AC | 14 ms | 4224 KB |
25.txt | AC | 17 ms | 4224 KB |
26.txt | AC | 16 ms | 4224 KB |
27.txt | AC | 17 ms | 4224 KB |
28.txt | AC | 17 ms | 4224 KB |
29.txt | AC | 15 ms | 4224 KB |
30.txt | AC | 15 ms | 4224 KB |
31.txt | AC | 15 ms | 4224 KB |
32.txt | AC | 16 ms | 4224 KB |
33.txt | AC | 16 ms | 4224 KB |
34.txt | AC | 13 ms | 4224 KB |
35.txt | AC | 16 ms | 4224 KB |
36.txt | AC | 12 ms | 4224 KB |
37.txt | AC | 12 ms | 4224 KB |
38.txt | AC | 12 ms | 4224 KB |
39.txt | AC | 18 ms | 4224 KB |
40.txt | AC | 12 ms | 4224 KB |
41.txt | AC | 12 ms | 4224 KB |
42.txt | AC | 11 ms | 4224 KB |
43.txt | AC | 19 ms | 4224 KB |
44.txt | AC | 19 ms | 4224 KB |
45.txt | AC | 19 ms | 4224 KB |
46.txt | AC | 19 ms | 4224 KB |
47.txt | AC | 18 ms | 4224 KB |
48.txt | AC | 18 ms | 4224 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 |