QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#414614#8228. 排序cqbzly100 ✓1204ms82876kbC++141.9kb2024-05-19 12:02:502024-05-19 12:02:51

Judging History

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

  • [2024-05-19 12:02:51]
  • 评测
  • 测评结果:100
  • 用时:1204ms
  • 内存:82876kb
  • [2024-05-19 12:02:50]
  • 提交

answer

#include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define db double
#define fi first
#define se second
#define inf 0x3f3f3f3f3f3f3f3f
#define vi vector<int>
using namespace std;
//手写hash表常数很大
int n,m,d[15],lim[15][15],prod[15][15],a[35];
vector<int>f,g;
vector<vector<int>>dp[15];
int get(int x,int y,int r){
    return x/prod[r][y]%(lim[r][y]+1);
}
int calc(int r,int mask,int x){
	if(r==m)return 0;
	if(dp[r][x][mask]!=-1)return dp[r][x][mask];
	int mask0=0,tmp=0,p=-1;
	for(int i=0;i<d[r];i++){
		int cnt=get(mask,i,r);
		for(int j=i,y=1;j<n;j+=d[r],y++){
			if(y<=cnt)a[j]=-1;
			else if(y==cnt+1&&i==x)a[j]=0;
			else a[j]=1;
		}
	}
	for(int i=0;i<d[r+1];i++){
		int buc[3]={};
		for(int j=i;j<n;j+=d[r+1]){
			if(!a[j])tmp+=buc[2];
			buc[a[j]+1]++;
		}
		if(buc[1])p=i;
		mask0+=buc[0]*prod[r+1][i];
	}
    //assert(p!=-1);
	tmp+=calc(r+1,mask0,p);
	return dp[r][x][mask]=tmp;
}
signed main(){
    //freopen("data.in","r",stdin);
    //freopen("variance.out","w",stdout);
    ios::sync_with_stdio(false);
    cin.tie(0),cout.tie(0);
    cin>>n>>m;for(int i=1;i<=m;i++)cin>>d[i];
	int delta=0,tmp=0;
    for(int i=1;i<=m;i++){
		for(int j=0;j<n;j++){
			if(i==1)delta+=lim[1][j%d[1]];
			lim[i][j%d[i]]++;
		}
		prod[i][0]=1;
		for(int j=0;j<d[i];j++)prod[i][j+1]=prod[i][j]*(lim[i][j]+1);
		//匿名函数定义
		dp[i].resize(d[i],vector<int>(prod[i][d[i]],-1));
	}
	tmp=prod[1][d[1]];
	f.resize(tmp,-1),g.resize(tmp);
    f[0]=0,g[0]=1;
	for(int mask=0;mask<tmp;mask++){
		for(int i=0;i<d[1];i++){
			int x=get(mask,i,1);
			if(x==lim[1][i])continue;
			int mask0=mask+prod[1][i],cost=calc(1,mask,i);
            // if(cost){
            //     cout<<"YES";
            // }
			if(f[mask]+cost>f[mask0]){
				f[mask0]=f[mask]+cost;
				g[mask0]=g[mask];
			}
			else if(f[mask]+cost==f[mask0]){
				g[mask0]+=g[mask];
			}
		}
	}
	cout<<f[tmp-1]+delta<<" "<<g[tmp-1];
}

Details

Tip: Click on the bar to expand more detailed information

Subtask #1:

score: 18
Accepted

Test #1:

score: 18
Accepted
time: 0ms
memory: 3824kb

input:

2 2
2 1

output:

1 1

result:

ok 2 number(s): "1 1"

Test #2:

score: 0
Accepted
time: 0ms
memory: 3612kb

input:

5 4
5 4 2 1

output:

6 4

result:

ok 2 number(s): "6 4"

Test #3:

score: 0
Accepted
time: 0ms
memory: 3648kb

input:

8 4
6 3 2 1

output:

15 4

result:

ok 2 number(s): "15 4"

Test #4:

score: 0
Accepted
time: 1ms
memory: 3560kb

input:

8 6
8 7 5 4 2 1

output:

14 2

result:

ok 2 number(s): "14 2"

Test #5:

score: 0
Accepted
time: 1ms
memory: 3772kb

input:

8 3
8 7 1

output:

22 7

result:

ok 2 number(s): "22 7"

Test #6:

score: 0
Accepted
time: 0ms
memory: 3760kb

input:

8 1
1

output:

28 1

result:

ok 2 number(s): "28 1"

Subtask #2:

score: 27
Accepted

Dependency #1:

100%
Accepted

Test #7:

score: 27
Accepted
time: 1ms
memory: 3632kb

input:

16 2
6 1

output:

77 15

result:

ok 2 number(s): "77 15"

Test #8:

score: 0
Accepted
time: 13ms
memory: 4364kb

input:

16 8
10 9 8 7 6 5 4 1

output:

57 5

result:

ok 2 number(s): "57 5"

Test #9:

score: 0
Accepted
time: 13ms
memory: 4376kb

input:

16 10
10 9 8 7 6 5 4 3 2 1

output:

57 3

result:

ok 2 number(s): "57 3"

Test #10:

score: 0
Accepted
time: 10ms
memory: 4484kb

input:

16 7
10 9 8 6 5 4 1

output:

49 1

result:

ok 2 number(s): "49 1"

Test #11:

score: 0
Accepted
time: 3ms
memory: 3724kb

input:

16 4
7 6 2 1

output:

52 9

result:

ok 2 number(s): "52 9"

Subtask #3:

score: 21
Accepted

Dependency #2:

100%
Accepted

Test #12:

score: 21
Accepted
time: 2ms
memory: 3928kb

input:

22 3
5 3 1

output:

100 1

result:

ok 2 number(s): "100 1"

Test #13:

score: 0
Accepted
time: 0ms
memory: 3480kb

input:

22 1
1

output:

231 1

result:

ok 2 number(s): "231 1"

Test #14:

score: 0
Accepted
time: 98ms
memory: 9412kb

input:

22 4
10 8 3 1

output:

97 4

result:

ok 2 number(s): "97 4"

Test #15:

score: 0
Accepted
time: 104ms
memory: 8988kb

input:

22 5
10 7 6 3 1

output:

92 70

result:

ok 2 number(s): "92 70"

Test #16:

score: 0
Accepted
time: 113ms
memory: 12156kb

input:

22 6
10 9 8 7 3 1

output:

97 1

result:

ok 2 number(s): "97 1"

Test #17:

score: 0
Accepted
time: 108ms
memory: 12468kb

input:

22 10
10 9 8 7 6 5 4 3 2 1

output:

109 1

result:

ok 2 number(s): "109 1"

Subtask #4:

score: 10
Accepted

Test #18:

score: 10
Accepted
time: 4ms
memory: 3680kb

input:

14 2
10 1

output:

61 210

result:

ok 2 number(s): "61 210"

Test #19:

score: 0
Accepted
time: 0ms
memory: 3604kb

input:

18 2
2 1

output:

117 1

result:

ok 2 number(s): "117 1"

Test #20:

score: 0
Accepted
time: 456ms
memory: 25232kb

input:

30 2
9 1

output:

264 84

result:

ok 2 number(s): "264 84"

Test #21:

score: 0
Accepted
time: 374ms
memory: 20808kb

input:

29 2
9 1

output:

253 36

result:

ok 2 number(s): "253 36"

Test #22:

score: 0
Accepted
time: 64ms
memory: 6328kb

input:

25 2
8 1

output:

195 8

result:

ok 2 number(s): "195 8"

Subtask #5:

score: 24
Accepted

Dependency #1:

100%
Accepted

Dependency #2:

100%
Accepted

Dependency #3:

100%
Accepted

Dependency #4:

100%
Accepted

Test #23:

score: 24
Accepted
time: 1201ms
memory: 72300kb

input:

30 4
10 9 5 1

output:

188 40

result:

ok 2 number(s): "188 40"

Test #24:

score: 0
Accepted
time: 1200ms
memory: 82756kb

input:

30 9
10 9 8 7 6 5 4 3 1

output:

184 6

result:

ok 2 number(s): "184 6"

Test #25:

score: 0
Accepted
time: 1204ms
memory: 82088kb

input:

30 8
10 9 8 7 4 3 2 1

output:

154 1

result:

ok 2 number(s): "154 1"

Test #26:

score: 0
Accepted
time: 1183ms
memory: 64784kb

input:

30 8
10 8 7 6 5 4 3 1

output:

155 1

result:

ok 2 number(s): "155 1"

Test #27:

score: 0
Accepted
time: 1178ms
memory: 61560kb

input:

30 6
10 8 6 4 3 1

output:

150 4

result:

ok 2 number(s): "150 4"

Test #28:

score: 0
Accepted
time: 1197ms
memory: 82876kb

input:

30 10
10 9 8 7 6 5 4 3 2 1

output:

184 6

result:

ok 2 number(s): "184 6"

Test #29:

score: 0
Accepted
time: 879ms
memory: 57420kb

input:

29 6
10 9 7 5 3 1

output:

129 200

result:

ok 2 number(s): "129 200"

Extra Test:

score: 0
Extra Test Passed