CSES - HIIT Open 2019 - Results
Submission details
Task:Bit Strings
Sender:.*
Submission time:2019-05-25 14:25:49
Language:C++
Status:READY
Result:
Test results
testverdicttime
#10.01 sdetails
#20.02 sdetails
#3ACCEPTED0.03 sdetails
#40.03 sdetails
#5ACCEPTED0.02 sdetails
#6ACCEPTED0.02 sdetails
#70.02 sdetails
#8ACCEPTED0.02 sdetails
#9ACCEPTED0.02 sdetails
#10ACCEPTED0.03 sdetails
#110.03 sdetails
#120.05 sdetails
#130.04 sdetails
#140.05 sdetails
#15ACCEPTED0.04 sdetails
#160.05 sdetails
#170.05 sdetails
#180.04 sdetails

Compiler report

input/code.cpp: In function 'int main()':
input/code.cpp:53:3: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
   if(i-k>=0)
   ^~
input/code.cpp:55:4: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
    d[i][0] += M;
    ^

Code

#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define ull unsigned long long
#define M 1000000007
#define N (1<<18)
#define P complex<long long>
#define X real()
#define Y imag()
 
using namespace std;

ll n, k, d[1010101][2], cntt;

void haku(int len, string s) {
	if(len == n) {
		char ed = 'G';
		int cnt = 0;
		for(auto u:s) {
			if(u == ed) {
				cnt++;
			} else {
				cnt = 1;
				ed = u;
			}
			if(cnt == k && ed == '0')
				return;
		}
		cout << s<<endl;
		cntt++;
	}
	else {
		haku(len+1, s+"1");
		haku(len+1, s+"0");
	}
}

int main() {
	cin.tie(0);
	cout.tie(0);
	ios_base::sync_with_stdio(0);
	cin >> n >> k;
	//haku(0, "");
	d[0][0] = 1;
	d[0][1] = 1;
	d[1][0] = 1;
	d[1][1] = 1;
	for(int i=2; i<=n; i++) {
		d[i][0] = d[i-1][0]+d[i-1][1];
		d[i][1] = d[i-1][0]+d[i-1][1];
		d[i][0] %= M;
		d[i][1] %= M;
		if(i-k>=0)
			d[i][0] -= d[i-k][1];
			d[i][0] += M;
		d[i][0] %= M;
		d[i][1] %= M;
	}
	cout << d[n][1]+d[n][0];
}

Test details

Test 1

Verdict:

input
1 1

correct output
1

user output
2

Test 2

Verdict:

input
2 1

correct output
1

user output
3

Test 3

Verdict: ACCEPTED

input
2 2

correct output
3

user output
3

Test 4

Verdict:

input
3 1

correct output
1

user output
4

Test 5

Verdict: ACCEPTED

input
3 2

correct output
5

user output
5

Test 6

Verdict: ACCEPTED

input
3 3

correct output
7

user output
7

Test 7

Verdict:

input
4 1

correct output
1

user output
5

Test 8

Verdict: ACCEPTED

input
4 2

correct output
8

user output
8

Test 9

Verdict: ACCEPTED

input
4 3

correct output
13

user output
13

Test 10

Verdict: ACCEPTED

input
4 4

correct output
15

user output
15

Test 11

Verdict:

input
654321 123456

correct output
796245691

user output
1796245698

Test 12

Verdict:

input
1000000 1

correct output
1

user output
1000001

Test 13

Verdict:

input
1000000 10

correct output
256933600

user output
1256933607

Test 14

Verdict:

input
1000000 100

correct output
142013415

user output
1142013422

Test 15

Verdict: ACCEPTED

input
1000000 1000

correct output
899626120

user output
899626120

Test 16

Verdict:

input
1000000 10000

correct output
374265948

user output
1374265955

Test 17

Verdict:

input
1000000 100000

correct output
388134512

user output
1388134519

Test 18

Verdict:

input
1000000 1000000

correct output
235042058

user output
1235042065