QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#864645#9680. 数字变换KaXdd_#24 1249ms15312kbC++142.5kb2025-01-20 20:55:462025-01-20 20:55:47

Judging History

你现在查看的是最新测评结果

  • [2025-01-20 20:55:47]
  • 评测
  • 测评结果:24
  • 用时:1249ms
  • 内存:15312kb
  • [2025-01-20 20:55:46]
  • 提交

answer

#include<bits/stdc++.h>
// #define int long long
#define rg register
#define il inline
#define TT(T, Args) template<typename T, typename... Args>
#define L(i, a, b) for (rg int i = (a); i <= (b); i++)
#define R(i, a, b) for (rg int i = (a); i >= (b); i--)
#define rep(i, a) for (rg auto i : a)
using namespace std;
namespace xmpl_{
	il int rd(){
		int f = 1, x = 0;
		char ch = getchar();
		while(ch < '0' || ch > '9'){
			if (ch == '-') f = -1;
			ch = getchar();
		}
		while(ch >= '0' && ch <= '9'){
			x = x * 10 + ch - '0';
			ch = getchar();
		}
		return x * f;
	}
	TT(T, Args) il void rd(T &x){
		int f = 1;
		x = 0;
		char ch = getchar();
		while(ch < '0' || ch > '9'){
			if (ch == '-') f = -1;
			ch = getchar();
		}
		while(ch >= '0' && ch <= '9'){
			x = x * 10 + ch - '0';
			ch = getchar();
		}
		x *= f;
	}
	TT(T, Args) il void rd(T &x, Args &...args){rd(x), rd(args...);}
	TT(T, Args) il void rdArr(T *arr, int cnt){while(cnt--) rd(*arr), arr++;}
	il void wt(int x){
		if (x < 0){
			putchar('-');
			x = -x;
		}
		if (x > 9) wt(x / 10);
		putchar(x % 10 + 48);
	}
	il void wtln(int x){wt(x), putchar('\n');}
	il void wtsp(int x){wt(x), putchar(' ');}
	il void swap(int &x, int &y){x ^= y ^= x ^= y;}
	il int max(int x, int y){return (x > y ? x : y);}
	il int min(int x, int y){return (x < y ? x : y);}
	il void ckmax(int &x, int y){x = max(x, y);}
	il void ckmin(int &x, int y){x = min(x, y);}
	il void cksum(int &x, int y){x += y;}
	TT(T, Args) il void ckmax(T &x, T y, Args &...args){ckmax(x, y), ckmax(x, args...);}
	TT(T, Args) il void ckmin(T &x, T y, Args &...args){ckmin(x, y), ckmin(x, args...);}
	TT(T, Args) il void cksum(T &x, T y, Args &...args){cksum(x, y), cksum(x, args...);}
}
using namespace xmpl_;
using namespace std;

const int N = 1e6 + 1e3 + 5, M = 21, p = 998244353, inf = 0x3f3f3f3f3f3f3f3f;
int l, r, n, f[N], g[N], ans[N];

il void init(){

}

il void clear(){
	
}

il void work(){
	rd(l, r, n), f[1] = ans[1] = 1;
	L(i, 1, n){
		L(j, 1, N - 5) g[j] = (f[j - 1] + f[j + 1]) % p;
		L(j, 1, (N - 5) / 2) L(k, j * 2, N - 5) g[k] = (g[k] + f[j]) % p, k += j - 1;
		L(j, 1, N - 5) f[j] = g[j], ans[j] = (ans[j] + f[j]) % p;
	}
	L(i, l, r) wtsp(ans[i]);
}

signed main(){
	// #define file 114514
#ifdef file	
	freopen("code.in", "r", stdin);
	freopen("code.out", "w", stdout);
#endif
	// init();
	int t = 1;
	// t = rd();
	while(t--){
		// clear();
		work();
		// puts("");
	}
	return 0;
}

詳細信息

Subtask #1:

score: 6
Accepted

Test #1:

score: 6
Accepted
time: 92ms
memory: 15308kb

input:

1 10 3

output:

4 10 11 13 14 16 15 18 19 16 

result:

ok 10 numbers

Test #2:

score: 6
Accepted
time: 309ms
memory: 15304kb

input:

1 10 10

output:

1446 3555 5399 8364 9365 13867 13268 18455 18559 22035 

result:

ok 10 numbers

Test #3:

score: 6
Accepted
time: 33ms
memory: 15312kb

input:

1 10 1

output:

1 2 1 1 1 1 1 1 1 1 

result:

ok 10 numbers

Test #4:

score: 6
Accepted
time: 307ms
memory: 15184kb

input:

4 9 10

output:

8364 9365 13867 13268 18455 18559 

result:

ok 6 numbers

Subtask #2:

score: 18
Accepted

Dependency #1:

100%
Accepted

Test #5:

score: 18
Accepted
time: 1229ms
memory: 15308kb

input:

970000 1000000 40

output:

503190413 403501814 423543367 667735332 309717676 941521375 469059575 651585751 638081530 319769570 829344038 710448046 491906657 837995934 191992080 435477208 965318020 224310119 82608430 311469551 397529653 845900371 993051834 218739898 720518121 555742487 850145833 86074414 994934100 233037792 83...

result:

ok 30001 numbers

Test #6:

score: 18
Accepted
time: 1249ms
memory: 15308kb

input:

961235 991235 40

output:

726112142 872781888 864415992 271278585 161740406 328072996 78782063 87302065 34440839 496440232 20023252 186342396 764720954 729734275 738722871 935566953 929337897 876835483 50567341 207158528 584651187 436141466 570964468 351740029 722550019 982425596 33848740 853163527 651698124 526627241 675694...

result:

ok 30001 numbers

Test #7:

score: 18
Accepted
time: 1233ms
memory: 15180kb

input:

222672 252672 40

output:

631342631 757879799 692055601 186757611 650530712 706722357 916976233 819581990 264205227 549042234 803974629 75845131 29698194 175213976 499651702 699984450 376334876 686068237 257396075 368343435 360038977 718193111 387980917 173929086 672211730 117954620 277698487 337486141 473242448 412398980 93...

result:

ok 30001 numbers

Subtask #3:

score: 0
Runtime Error

Dependency #2:

100%
Accepted

Test #8:

score: 0
Runtime Error

input:

4782535 4812535 40

output:


result:


Subtask #4:

score: 0
Runtime Error

Test #11:

score: 0
Runtime Error

input:

3000000000 3000000000 4

output:


result:


Subtask #5:

score: 0
Skipped

Dependency #3:

0%

Subtask #6:

score: 0
Skipped

Dependency #5:

0%

Subtask #7:

score: 0
Skipped

Dependency #1:

100%
Accepted

Dependency #2:

100%
Accepted

Dependency #3:

0%