Submission #16875097

Source Code Expand

#include <bits/stdc++.h>
#define pb push_back
typedef long long ll;
using namespace std;
const int mx = 5e5;
const ll mod = 998244353;
ll res[mx + 5];
int main() {
	res[1] = 1;
	int n, k;
	cin >> n >> k;
	vector <pair <int, int>> vec(k);
	for (int i = 0; i < k; ++i) {
		cin >> vec[i].first >> vec[i].second;
	}
	for (int i = 2; i <= n; ++i) {
		for (int j = 0; j < k; ++j) {
			if (i - vec[j].first < 1)
				continue;
			if (i - vec[j].second < 1)
				res[i] += res[i - vec[j].first];
			else
				res[i] += res[i - vec[j].first] - res[i - vec[j].second - 1];
			res[i] %= mod;
			/*if (i == 4)
				cout << j << " " << res[i] << endl;*/
		}
		if (i != n)
			res[i] += res[i - 1];
	}
	cout << res[n] << endl;
}

Submission Info

Submission Time
Task D - Leaping Tak
User mahade31
Language C++ (GCC 9.2.1)
Score 400
Code Size 740 Byte
Status AC
Exec Time 11 ms
Memory 5200 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 400 / 400
Status
AC × 4
AC × 28
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, s1.txt, s2.txt, s3.txt, s4.txt
Case Name Status Exec Time Memory
01.txt AC 8 ms 3592 KiB
02.txt AC 3 ms 3596 KiB
03.txt AC 2 ms 3420 KiB
04.txt AC 2 ms 3596 KiB
05.txt AC 3 ms 3592 KiB
06.txt AC 2 ms 3420 KiB
07.txt AC 2 ms 3488 KiB
08.txt AC 2 ms 3572 KiB
09.txt AC 3 ms 3468 KiB
10.txt AC 2 ms 3492 KiB
11.txt AC 2 ms 3544 KiB
12.txt AC 10 ms 4968 KiB
13.txt AC 4 ms 5200 KiB
14.txt AC 11 ms 4984 KiB
15.txt AC 8 ms 5052 KiB
16.txt AC 8 ms 5184 KiB
17.txt AC 11 ms 5104 KiB
18.txt AC 9 ms 4972 KiB
19.txt AC 8 ms 5024 KiB
20.txt AC 10 ms 5052 KiB
21.txt AC 4 ms 5104 KiB
22.txt AC 3 ms 5180 KiB
23.txt AC 3 ms 5156 KiB
24.txt AC 7 ms 5180 KiB
s1.txt AC 2 ms 3596 KiB
s2.txt AC 2 ms 3620 KiB
s3.txt AC 2 ms 3432 KiB
s4.txt AC 2 ms 3596 KiB