Submission #1082120
Source Code Expand
#define _USE_MATH_DEFINES #include <algorithm> #include <cstdio> #include <functional> #include <iostream> #include <cfloat> #include <climits> #include <cstdlib> #include <cstring> #include <cmath> #include <map> #include <queue> #include <set> #include <sstream> #include <stack> #include <string> #include <time.h> #include <vector> #include <random> using namespace std; #define rep(i, N) for (int i = 0; i < N; i++) #define pb push_back typedef long long ll; typedef unsigned long long ull; typedef pair<int, int> i_i; typedef pair<ll, int> ll_i; typedef pair<double, int> d_i; typedef pair<ll, ll> ll_ll; typedef pair<double, double> d_d; struct edge { int u, v; ll w; }; ll MOD = 1000000007; ll _MOD = 1000000009; int INF = INT_MAX / 10; double EPS = 1e-10; int main() { int N, K; cin >> N >> K; vector<int> dp(N + 1); dp[N] = 1; rep(k, K - 1) { vector<int> _dp(N + 1), imos(N + 1); for (int i = 0; i <= N; i++) { if (i + k < N) _dp[i] = (_dp[i] + dp[i]) % MOD; if (i) imos[i - 1] = (imos[i - 1] + dp[i]) % MOD; } for (int i = N - 1; i >= 0; i--) imos[i] = (imos[i] + imos[i + 1]) % MOD; for (int i = 0; i <= N; i++) _dp[i] = (_dp[i] + imos[i]) % MOD; dp = _dp; } int ans = 0; for (int i = 1; i <= N; i++) ans = (ans + dp[i]) % MOD; rep(t, N - K - 1) ans = ans * 2 % MOD; cout << ans << endl; }
Submission Info
Submission Time | |
---|---|
Task | F - Solitaire |
User | sugim48 |
Language | C++14 (GCC 5.4.1) |
Score | 1200 |
Code Size | 1401 Byte |
Status | AC |
Exec Time | 168 ms |
Memory | 384 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 1200 / 1200 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | 00_example_01.txt, 00_example_02.txt, 00_example_03.txt |
All | 00_example_01.txt, 00_example_02.txt, 00_example_03.txt, 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 |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
00_example_01.txt | AC | 2 ms | 256 KB |
00_example_02.txt | AC | 3 ms | 256 KB |
00_example_03.txt | AC | 90 ms | 256 KB |
01.txt | AC | 3 ms | 256 KB |
02.txt | AC | 40 ms | 256 KB |
03.txt | AC | 3 ms | 256 KB |
04.txt | AC | 3 ms | 256 KB |
05.txt | AC | 3 ms | 256 KB |
06.txt | AC | 3 ms | 256 KB |
07.txt | AC | 3 ms | 256 KB |
08.txt | AC | 3 ms | 256 KB |
09.txt | AC | 136 ms | 256 KB |
10.txt | AC | 3 ms | 256 KB |
11.txt | AC | 3 ms | 256 KB |
12.txt | AC | 141 ms | 384 KB |
13.txt | AC | 3 ms | 256 KB |
14.txt | AC | 62 ms | 256 KB |
15.txt | AC | 13 ms | 256 KB |
16.txt | AC | 63 ms | 256 KB |
17.txt | AC | 51 ms | 256 KB |
18.txt | AC | 108 ms | 256 KB |
19.txt | AC | 96 ms | 256 KB |
20.txt | AC | 44 ms | 256 KB |
21.txt | AC | 3 ms | 256 KB |
22.txt | AC | 168 ms | 256 KB |
23.txt | AC | 3 ms | 256 KB |