Submission #3457870
Source Code Expand
#include <bits/stdc++.h>
// #include <boost/multiprecision/cpp_int.hpp>
#define int long long
#define inf 1000000007
#define pa pair<int,int>
#define ll long long
#define pal pair<double,double>
#define ppap pair<pa,int>
// #define PI 3.14159265358979323846
#define paa pair<int,char>
#define mp make_pair
#define pb push_back
#define EPS (1e-10)
int dx[8]={0,1,0,-1,1,1,-1,-1};
int dy[8]={1,0,-1,0,-1,1,1,-1};
using namespace std;
class pa3{
public:
int x,y,z;
pa3(int x=0,int y=0,int z=0):x(x),y(y),z(z) {}
bool operator < (const pa3 &p) const{
if(x!=p.x) return x<p.x;
if(y!=p.y) return y<p.y;
return z<p.z;
//return x != p.x ? x<p.x: y<p.y;
}
bool operator > (const pa3 &p) const{
if(x!=p.x) return x>p.x;
if(y!=p.y) return y>p.y;
return z>p.z;
//return x != p.x ? x<p.x: y<p.y;
}
bool operator == (const pa3 &p) const{
return x==p.x && y==p.y && z==p.z;
}
bool operator != (const pa3 &p) const{
return !( x==p.x && y==p.y && z==p.z);
}
};
class pa4{
public:
double x;
int y,z,w;
pa4(double x=0,int y=0,int z=0,int w=0):x(x),y(y),z(z),w(w) {}
bool operator < (const pa4 &p) const{
if(x!=p.x) return x<p.x;
if(y!=p.y) return y<p.y;
if(z!=p.z)return z<p.z;
return w<p.w;
//return x != p.x ? x<p.x: y<p.y;
}
bool operator > (const pa4 &p) const{
if(x!=p.x) return x>p.x;
if(y!=p.y) return y>p.y;
if(z!=p.z)return z>p.z;
return w>p.w;
//return x != p.x ? x<p.x: y<p.y;
}
bool operator == (const pa4 &p) const{
return x==p.x && y==p.y && z==p.z &&w==p.w;
}
};
class pa2{
public:
int x,y;
pa2(int x=0,int y=0):x(x),y(y) {}
pa2 operator + (pa2 p) {return pa2(x+p.x,y+p.y);}
pa2 operator - (pa2 p) {return pa2(x-p.x,y-p.y);}
bool operator < (const pa2 &p) const{
return y != p.y ? y<p.y: x<p.x;
}
bool operator > (const pa2 &p) const{
return x != p.x ? x<p.x: y<p.y;
}
bool operator == (const pa2 &p) const{
return abs(x-p.x)==0 && abs(y-p.y)==0;
}
bool operator != (const pa2 &p) const{
return !(abs(x-p.x)==0 && abs(y-p.y)==0);
}
};
/*
class Point{
public:
double x,y;
Point(double x=0,double y=0):x(x),y(y) {}
Point operator + (Point p) {return Point(x+p.x,y+p.y);}
Point operator - (Point p) {return Point(x-p.x,y-p.y);}
Point operator * (double a) {return Point(x*a,y*a);}
Point operator / (double a) {return Point(x/a,y/a);}
double absv() {return sqrt(norm());}
double norm() {return x*x+y*y;}
bool operator < (const Point &p) const{
return x != p.x ? x<p.x: y<p.y;
}
bool operator == (const Point &p) const{
return fabs(x-p.x)<EPS && fabs(y-p.y)<EPS;
}
};
typedef Point Vector;
#define pl pair<int,pas>
struct Segment{
Point p1,p2;
};
double dot(Vector a,Vector b){
return a.x*b.x+a.y*b.y;
}
double cross(Vector a,Vector b){
return a.x*b.y-a.y*b.x;
}
bool parareru(Point a,Point b,Point c,Point d){
// if(abs(cross(a-b,d-c))<EPS)cout<<"dd "<<cross(a-b,d-c)<<endl;
return abs(cross(a-b,d-c))<EPS;
}
double distance_ls_p(Point a, Point b, Point c) {
if ( dot(b-a, c-a) < EPS ) return (c-a).absv();
if ( dot(a-b, c-b) < EPS ) return (c-b).absv();
return abs(cross(b-a, c-a)) / (b-a).absv();
}
bool is_intersected_ls(Segment a,Segment b) {
if(a.p1==b.p1||a.p2==b.p1||a.p1==b.p2||a.p2==b.p2) return false;
if(parareru((a.p2),(a.p1),(a.p1),(b.p2))&¶reru((a.p2),(a.p1),(a.p1),(b.p1))){
// cout<<"sss"<<endl;
if(dot(a.p1-b.p1,a.p1-b.p2)<EPS) return true;
if(dot(a.p2-b.p1,a.p2-b.p2)<EPS) return true;
if(dot(a.p1-b.p1,a.p2-b.p1)<EPS) return true;
if(dot(a.p1-b.p2,a.p2-b.p2)<EPS) return true;
return false;
}
else return ( cross(a.p2-a.p1, b.p1-a.p1) * cross(a.p2-a.p1, b.p2-a.p1) < EPS ) && ( cross(b.p2-b.p1, a.p1-b.p1) * cross(b.p2-b.p1, a.p2-b.p1) < EPS );
}
double segment_dis(Segment a,Segment b){
if(is_intersected_ls(a,b))return 0;
double r=distance_ls_p(a.p1, a.p2, b.p1);
r=min(r,distance_ls_p(a.p1, a.p2, b.p2));
r=min(r,distance_ls_p(b.p1, b.p2, a.p2));
r=min(r,distance_ls_p(b.p1, b.p2, a.p1));
return r;
}
Point intersection_ls(Segment a, Segment b) {
Point ba = b.p2-b.p1;
double d1 = abs(cross(ba, a.p1-b.p1));
double d2 = abs(cross(ba, a.p2-b.p1));
double t = d1 / (d1 + d2);
return a.p1 + (a.p2-a.p1) * t;
}
*/
string itos( int i ) {
ostringstream s ;
s << i ;
return s.str() ;
}
int gcd(int v,int b){
if(v>b) return gcd(b,v);
if(v==b) return b;
if(b%v==0) return v;
return gcd(v,b%v);
}
double distans(double x1,double y1,double x2,double y2){
double rr=(x1-x2)*(x1-x2)+(y1-y2)*(y1-y2);
return sqrt(rr);
}
int mod;
int pr[500010];
int inv[500010];
int beki(int wa,int rr,int warukazu){
if(rr==0) return 1%warukazu;
if(rr==1) return wa%warukazu;
if(rr%2==1) return ((ll)beki(wa,rr-1,warukazu)*(ll)wa)%warukazu;
ll zx=beki(wa,rr/2,warukazu);
return (zx*zx)%warukazu;
}
double bekid(double w,int r){
if(r==0) return 1.0;
if(r==1) return w;
if(r%2) return bekid(w,r-1)*w;
double f=bekid(w,r/2);
return f*f;
}
int comb(int nn,int rr){
int r=pr[nn]*inv[rr];
r%=mod;
r*=inv[nn-rr];
r%=mod;
return r;
}
void gya(int ert){
pr[0]=1;
for(int i=1;i<ert;i++){
pr[i]=(pr[i-1]*i)%mod;
}
for(int i=0;i<ert;i++) inv[i]=beki(pr[i],mod-2,mod);
}
// cin.tie(0);
// ios::sync_with_stdio(false);
//priority_queue<pa3,vector<pa3>,greater<pa3>> pq;
//sort(ve.begin(),ve.end(),greater<int>());
//----------------kokomade tenpure------------
//vector<double> ans(100000000),ans2(100000000)
int dp[4020][4020][2]={0};
bool dame[4022]={0};
vector<int> ve;
signed main(){
cin.tie(0);
ios::sync_with_stdio(false);
dp[0][0][0]=1;
int n,k;
cin>>n>>k;
int wa=0;
for(int i=1;i<=k;i++){
ve.pb(1+(n-i)/k);
ve.pb(1+(n-i)/k);
// cout<<1+(n-i)/k<<endl;
wa+=2*(1+(n-i)/k);
}
assert(wa==2*n);
wa=0;
for(auto v:ve){
wa+=v;
dame[wa]=1;
}
mod= 924844033;
for(int i=1;i<=2*n;i++){
if(dame[i]){
for(int j=0;j<=n;j++){
dp[i][j][0]=dp[i-1][j][0]+dp[i-1][j][1];
dp[i][j][0]%=mod;
}
}
else{
for(int j=0;j<=n;j++){
dp[i][j][0]+=dp[i-1][j][0]+dp[i-1][j][1];
dp[i][j][0]%=mod;
}
for(int j=1;j<=n;j++){
dp[i][j][1]+=dp[i-1][j-1][0];
dp[i][j][1]%=mod;
}
}
}
int ans=0;
gya(10000);
for(int i=0;i<=n;i++){
// cout<<dp[2*n][i][0]+dp[2*n][i][1]<<endl;
int g=(dp[2*n][i][0]+dp[2*n][i][1])%mod*pr[n-i]%mod;
if(i%2) g=mod-g;
ans+=g;
ans%=mod;
}
cout<<ans<<endl;
return 0;
}
Submission Info
| Submission Time |
|
| Task |
D - ~K Perm Counting |
| User |
smiken |
| Language |
C++14 (GCC 5.4.1) |
| Score |
0 |
| Code Size |
13076 Byte |
| Status |
MLE |
| Exec Time |
103 ms |
| Memory |
255488 KB |
Judge Result
| Set Name |
Sample |
All |
| Score / Max Score |
0 / 0 |
0 / 900 |
| Status |
|
|
| Set Name |
Test Cases |
| Sample |
example0, example1, example2, example3, example4 |
| All |
example0, example1, example2, example3, example4, handmade0, handmade1, handmade2, handmade3, handmade4, handmade5, handmade6, maxrand0, maxrand1, maxrand2, maxrand3, maxrand4, rand0, rand1, rand2, rand3, rand4, small0, small1, small2, supersmall0, supersmall1, supersmall2 |
| Case Name |
Status |
Exec Time |
Memory |
| example0 |
AC |
12 ms |
4352 KB |
| example1 |
AC |
12 ms |
4352 KB |
| example2 |
AC |
12 ms |
4352 KB |
| example3 |
AC |
12 ms |
4352 KB |
| example4 |
AC |
25 ms |
57984 KB |
| handmade0 |
AC |
12 ms |
4352 KB |
| handmade1 |
MLE |
103 ms |
255360 KB |
| handmade2 |
MLE |
87 ms |
255360 KB |
| handmade3 |
AC |
97 ms |
240896 KB |
| handmade4 |
AC |
80 ms |
234880 KB |
| handmade5 |
MLE |
103 ms |
255488 KB |
| handmade6 |
MLE |
103 ms |
255360 KB |
| maxrand0 |
AC |
85 ms |
243072 KB |
| maxrand1 |
AC |
92 ms |
245120 KB |
| maxrand2 |
AC |
95 ms |
251264 KB |
| maxrand3 |
AC |
98 ms |
242944 KB |
| maxrand4 |
AC |
83 ms |
243072 KB |
| rand0 |
MLE |
100 ms |
255360 KB |
| rand1 |
AC |
32 ms |
80640 KB |
| rand2 |
AC |
35 ms |
90880 KB |
| rand3 |
AC |
16 ms |
14848 KB |
| rand4 |
AC |
81 ms |
228608 KB |
| small0 |
AC |
22 ms |
41472 KB |
| small1 |
AC |
18 ms |
25088 KB |
| small2 |
AC |
19 ms |
35328 KB |
| supersmall0 |
AC |
12 ms |
4352 KB |
| supersmall1 |
AC |
12 ms |
4352 KB |
| supersmall2 |
AC |
12 ms |
4352 KB |