Submission #70264083


Source Code Expand

#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
template<class T> bool chmax(T &a, const T &b) { if(a<b){a=b;return 1;}return 0;}
template<class T> bool chmin(T &a, const T &b) { if(a>b){a=b;return 1;}return 0;}
//-------------------------------------------------------

int N,U;
int B[505050];

const int NUM_=2000003;
static ll fact[NUM_+1],factr[NUM_+1],inv[NUM_+1];


ll F[505050][22];
const ll mo=998244353;
vector<pair<int,int>> D[505050];


void solve() {
	int i,j,k,l,r,x,y; string s;
	
	inv[1]=fact[0]=factr[0]=1;
	for (int i=2;i<=NUM_;++i) inv[i] = inv[mo % i] * (mo - mo / i) % mo;
	for (int i=1;i<=NUM_;++i) fact[i]=fact[i-1]*i%mo, factr[i]=factr[i-1]*inv[i]%mo;
	
	cin>>N>>U;
	FOR(i,N) {
		cin>>x;
		B[x]++;
	}
	
	for(i=2;i<=U;i++) {
		ll x=i;
		for(j=2;x*i<=U;j++) {
			x*=i;
			D[x].push_back({i,j});
		}
	}
	
	
	F[1][0]=1;
	FOR(l,20) {
		for(j=1;j<=U/2;j++) if(F[j][l]) {
			for(x=2;j*x<=U;x++) (F[j*x][l+1]+=F[j][l]*B[x])%=mo;
		}
	}
	
	for(i=2;i<=U;i++) {
		ll ret=0;
		for(j=1;j<=19;j++) {
			//cout<<i<<" "<<j<<" "<<F[i][j]<<"->";
			FORR2(a,b,D[i]) if(j%b==0) {
				(F[i][j]-=F[a][j/b])%=mo;
				ret+=F[a][j/b]*inv[j/b]%mo;
			}
			F[i][j]=(F[i][j]%mo+mo)%mo;
			ret+=F[i][j]*inv[j]%mo;
			//cout<<F[i][j]<<endl;
		}
		cout<<ret%mo<<" ";
	}
	cout<<endl;
	
	
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}

Submission Info

Submission Time
Task G - Necklace
User kmjp
Language C++ 20 (gcc 12.2)
Score 625
Code Size 1893 Byte
Status AC
Exec Time 267 ms
Memory 141264 KiB

Compile Error

Main.cpp: In function ‘void solve()’:
Main.cpp:29:17: warning: unused variable ‘k’ [-Wunused-variable]
   29 |         int i,j,k,l,r,x,y; string s;
      |                 ^
Main.cpp:29:21: warning: unused variable ‘r’ [-Wunused-variable]
   29 |         int i,j,k,l,r,x,y; string s;
      |                     ^
Main.cpp:29:25: warning: unused variable ‘y’ [-Wunused-variable]
   29 |         int i,j,k,l,r,x,y; string s;
      |                         ^
Main.cpp: In function ‘int main(int, char**)’:
Main.cpp:6:19: warning: this ‘for’ clause does not guard... [-Wmisleading-indentation]
    6 | #define FOR(x,to) for(x=0;x<(to);x++)
      |                   ^~~
Main.cpp:80:9: note: in expansion of macro ‘FOR’
   80 |         FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
      |         ^~~
Main.cpp:6:19: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the ‘for’
    6 | #define FOR(x,to) for(x=0;x<(to);x++)
      |                   ^~~
Main.cpp:80:45: note: in expansion of macro ‘FOR’
   80 |         FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
      |                                             ^~~
Main.cpp:6:28: warning: comparison of integer expressions of different signedness: ‘int’ and ‘std::__cxx11::basic_string<char>::size_type’ {aka ‘long unsigned int’} [-Wsign-compare]
    6 | #define FOR(x,to) for(x=0;x<(to);x++)
      |                            ^
Main.cpp:80:45: note: in expansion of macro ‘FOR’
   80 |         FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
      |                                             ^~~

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 625 / 625
Status
AC × 3
AC × 31
Set Name Test Cases
Sample 00_sample_00.txt, 00_sample_01.txt, 00_sample_02.txt
All 00_sample_00.txt, 00_sample_01.txt, 00_sample_02.txt, 01_random_00.txt, 01_random_01.txt, 01_random_02.txt, 01_random_03.txt, 01_random_04.txt, 01_random_05.txt, 01_random_06.txt, 01_random_07.txt, 01_random_08.txt, 01_random_09.txt, 01_random_10.txt, 01_random_11.txt, 02_prime_00.txt, 02_prime_01.txt, 02_prime_02.txt, 02_prime_03.txt, 02_prime_04.txt, 02_prime_05.txt, 02_prime_06.txt, 02_prime_07.txt, 02_prime_08.txt, 02_prime_09.txt, 03_corner_00.txt, 03_corner_01.txt, 03_corner_02.txt, 03_corner_03.txt, 03_corner_04.txt, 03_corner_05.txt
Case Name Status Exec Time Memory
00_sample_00.txt AC 41 ms 50460 KiB
00_sample_01.txt AC 42 ms 50316 KiB
00_sample_02.txt AC 41 ms 50392 KiB
01_random_00.txt AC 54 ms 50412 KiB
01_random_01.txt AC 68 ms 53564 KiB
01_random_02.txt AC 250 ms 141184 KiB
01_random_03.txt AC 263 ms 141000 KiB
01_random_04.txt AC 67 ms 56880 KiB
01_random_05.txt AC 151 ms 92144 KiB
01_random_06.txt AC 257 ms 141056 KiB
01_random_07.txt AC 258 ms 141136 KiB
01_random_08.txt AC 53 ms 50860 KiB
01_random_09.txt AC 58 ms 50536 KiB
01_random_10.txt AC 248 ms 141176 KiB
01_random_11.txt AC 267 ms 141192 KiB
02_prime_00.txt AC 187 ms 139220 KiB
02_prime_01.txt AC 195 ms 139512 KiB
02_prime_02.txt AC 205 ms 140032 KiB
02_prime_03.txt AC 212 ms 140540 KiB
02_prime_04.txt AC 216 ms 141040 KiB
02_prime_05.txt AC 223 ms 141108 KiB
02_prime_06.txt AC 234 ms 141204 KiB
02_prime_07.txt AC 242 ms 141264 KiB
02_prime_08.txt AC 247 ms 141064 KiB
02_prime_09.txt AC 250 ms 141132 KiB
03_corner_00.txt AC 226 ms 139396 KiB
03_corner_01.txt AC 184 ms 139172 KiB
03_corner_02.txt AC 196 ms 139188 KiB
03_corner_03.txt AC 209 ms 139100 KiB
03_corner_04.txt AC 218 ms 139100 KiB
03_corner_05.txt AC 232 ms 139304 KiB