QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#447145#8529. Balance of PermutationPhantomThresholdAC ✓120ms6412kbC++202.1kb2024-06-18 00:04:182024-06-18 00:04:19

Judging History

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

  • [2024-06-18 00:04:19]
  • 评测
  • 测评结果:AC
  • 用时:120ms
  • 内存:6412kb
  • [2024-06-18 00:04:18]
  • 提交

answer

#include<bits/stdc++.h>
using namespace std;
int main()
{
	ios_base::sync_with_stdio(false);
	int n,b;
	__int128 k=0;
	cin>>n>>b;
	string tmp;
	cin>>tmp;
	for(auto ch:tmp)
	{
		k=k*10+ch-'0';
	}
	vector<int> used(n+5);
	vector<int> a(n+5),inva(n+5);
	for(int pos=1;pos<=n;pos++)
	{
		for(int val=1;val<=n;val++)
		{
			if(used[val])continue;
//			cerr<<"go "<<pos<<' '<<val<<endl;
			a[pos]=val;inva[val]=pos;
			used[val]=1;
			vector dp(n+5,vector(n/2+5,vector<__int128>(n*n/4+n+5)));
			int prej=0,pres=0;
			int reml=0;
			for(int i=1;i<=pos;i++)
			{
				//.
				if(a[i]==i)
					pres+=prej;
				else
				{
					pres+=prej;
					int cnt=0;
					if(inva[i]!=0 and inva[i]<i)cnt++;
					if(a[i]<i)cnt++;
					//>
					if(cnt==2)
						prej-=1;
					//--
					else if(cnt==1)
						prej+=0;
					//<
					else
						prej+=1;
				}
				if(a[i]>pos)reml++;
			}
//			cerr<<"pre "<<prej<<' '<<pres<<endl;
			dp[pos][prej][pres]=1;
			for(int i=pos;i<n;i++)
			{
				if(used[i+1])reml--;
				for(int j=0;j<=n/2;j++)
				{
					for(int s=0;s<=n*n/4;s++)
					{
						if(dp[i][j][s]==0)continue;
//						cerr<<i<<' '<<j<<' '<<s<<' '<<(long long)dp[i][j][s]<<endl;
//						cerr<<"reml "<<reml<<endl;
						if(not used[i+1])
						{
							//>
							if(j>=1)
								dp[i+1][j-1][s+j]+=dp[i][j][s]*(j-reml)*(j);
							//--
							dp[i+1][j][s+j]+=dp[i][j][s]*(j-reml);
							dp[i+1][j][s+j]+=dp[i][j][s]*(j);
							//<
							dp[i+1][j+1][s+j]+=dp[i][j][s];
							//.
							dp[i+1][j][s+j]+=dp[i][j][s];
						}
						else
						{
							//>
							dp[i+1][j-1][s+j]+=dp[i][j][s]*(j);
							//--
							dp[i+1][j][s+j]+=dp[i][j][s];
						}
					}
				}
			}
//			cerr<<"test "<<pos<<' '<<val<<' '<<(long long)dp[n][0][b]<<endl;
			if(dp[n][0][b/2]<k)//fail
			{
				k-=dp[n][0][b/2];
//				cerr<<"fail k->"<<(long long)k<<endl;
				a[pos]=inva[val]=0;
				used[val]=0;
			}
			else
			{
				break;
			}
		}
	}
	for(int i=1;i<=n;i++)cout<<a[i]<<" \n"[i==n];
//	for(int s=0;s<=n*n/2;s++)cout<<s<<' '<<(long long)dp[n][0][s]<<endl;
	return 0;
}
/*
f i j s
position i, cover j, sum balance s
*/

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 0ms
memory: 3684kb

input:

6 6 6

output:

1 2 6 3 4 5

result:

ok 6 numbers

Test #2:

score: 0
Accepted
time: 59ms
memory: 6244kb

input:

30 300 3030303030303030303030

output:

1 2 3 4 9 23 20 28 24 16 21 17 27 29 8 26 25 30 19 18 22 12 7 13 6 10 5 15 14 11

result:

ok 30 numbers

Test #3:

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

input:

1 0 1

output:

1

result:

ok 1 number(s): "1"

Test #4:

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

input:

2 0 1

output:

1 2

result:

ok 2 number(s): "1 2"

Test #5:

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

input:

2 2 1

output:

2 1

result:

ok 2 number(s): "2 1"

Test #6:

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

input:

5 8 3

output:

1 5 4 2 3

result:

ok 5 number(s): "1 5 4 2 3"

Test #7:

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

input:

7 20 100

output:

3 6 7 4 1 5 2

result:

ok 7 numbers

Test #8:

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

input:

7 2 6

output:

2 1 3 4 5 6 7

result:

ok 7 numbers

Test #9:

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

input:

7 24 1

output:

4 5 6 7 1 2 3

result:

ok 7 numbers

Test #10:

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

input:

7 22 360

output:

7 6 4 3 5 2 1

result:

ok 7 numbers

Test #11:

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

input:

7 20 358

output:

5 7 2 4 6 3 1

result:

ok 7 numbers

Test #12:

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

input:

10 48 10001

output:

7 5 8 9 6 10 3 4 1 2

result:

ok 10 numbers

Test #13:

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

input:

10 42 10101

output:

3 9 6 8 10 5 7 2 1 4

result:

ok 10 numbers

Test #14:

score: 0
Accepted
time: 22ms
memory: 4772kb

input:

25 300 1

output:

7 14 15 16 17 18 19 20 21 22 23 24 25 1 2 3 4 5 6 8 9 10 11 12 13

result:

ok 25 numbers

Test #15:

score: 0
Accepted
time: 32ms
memory: 4928kb

input:

25 300 283788388040048639877

output:

25 24 23 22 21 20 19 18 17 16 11 12 13 14 15 10 9 8 7 5 6 4 2 1 3

result:

ok 25 numbers

Test #16:

score: 0
Accepted
time: 23ms
memory: 5128kb

input:

26 302 105773752969551707419545

output:

19 22 25 13 17 18 23 20 10 26 16 6 5 11 14 12 24 4 3 21 1 15 7 8 2 9

result:

ok 26 numbers

Test #17:

score: 0
Accepted
time: 61ms
memory: 5232kb

input:

27 308 8781128321749037280676555

output:

16 18 17 21 25 6 20 24 22 15 27 5 7 8 2 9 26 13 1 3 14 10 23 19 4 11 12

result:

ok 27 numbers

Test #18:

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

input:

28 304 806517199954337651602356955

output:

12 17 5 16 23 26 25 15 20 2 19 7 22 24 6 13 11 10 28 8 1 21 18 14 27 3 4 9

result:

ok 28 numbers

Test #19:

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

input:

29 322 40281026669581503094652149519

output:

16 21 10 25 17 29 9 28 2 8 26 27 22 4 3 5 18 14 19 1 23 20 15 11 13 7 6 12 24

result:

ok 29 numbers

Test #20:

score: 0
Accepted
time: 75ms
memory: 6412kb

input:

30 400 46479902466857426153849991132

output:

25 19 30 29 9 20 26 21 14 27 28 10 22 11 24 2 7 4 18 17 5 13 12 6 8 1 15 23 16 3

result:

ok 30 numbers

Test #21:

score: 0
Accepted
time: 95ms
memory: 6412kb

input:

30 450 1140008168482799670544355

output:

26 16 17 18 19 20 21 22 23 24 25 27 28 29 30 1 2 3 5 9 4 8 14 10 6 11 12 15 7 13

result:

ok 30 numbers

Test #22:

score: 0
Accepted
time: 32ms
memory: 6332kb

input:

30 150 480087379811286955791425915

output:

7 4 8 5 16 3 1 12 13 11 9 10 15 25 18 17 20 30 28 2 6 14 23 21 24 26 27 22 19 29

result:

ok 30 numbers

Test #23:

score: 0
Accepted
time: 23ms
memory: 6272kb

input:

30 150 480087379811286955791439470

output:

7 4 8 5 16 3 1 12 13 11 9 10 15 25 18 17 20 30 28 2 19 6 22 24 21 23 26 14 29 27

result:

ok 30 numbers

Test #24:

score: 0
Accepted
time: 87ms
memory: 6408kb

input:

30 440 41509275104334759322587324

output:

22 23 20 24 18 30 19 26 21 28 4 29 17 25 27 16 3 1 2 5 8 13 10 15 7 12 9 14 11 6

result:

ok 30 numbers

Test #25:

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

input:

30 450 1140008168482800727111311

output:

26 16 17 18 19 20 21 22 23 24 25 27 28 29 30 1 2 5 7 14 4 15 8 11 3 13 10 9 6 12

result:

ok 30 numbers

Test #26:

score: 0
Accepted
time: 75ms
memory: 6276kb

input:

30 400 52289890275214604423031772929

output:

26 27 29 21 28 16 18 11 2 25 24 23 6 30 20 13 17 10 15 4 9 12 8 22 19 1 5 7 3 14

result:

ok 30 numbers

Test #27:

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

input:

30 0 1

output:

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30

result:

ok 30 numbers

Test #28:

score: 0
Accepted
time: 40ms
memory: 6184kb

input:

30 450 1

output:

16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15

result:

ok 30 numbers

Test #29:

score: 0
Accepted
time: 92ms
memory: 6412kb

input:

30 450 1710012252724199424000000

output:

30 29 28 27 26 25 24 23 22 21 20 19 18 17 16 15 14 13 12 11 10 9 8 7 6 5 4 3 2 1

result:

ok 30 numbers

Test #30:

score: 0
Accepted
time: 120ms
memory: 6168kb

input:

30 450 1692383260428073656742269

output:

30 27 26 28 18 29 21 19 25 17 20 16 24 22 23 7 13 4 6 3 5 12 1 15 14 9 11 8 2 10

result:

ok 30 numbers

Test #31:

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

input:

30 302 5918364042599361729860937331200

output:

30 29 28 27 26 25 14 8 9 10 11 12 13 7 15 16 17 18 19 20 21 22 23 24 6 5 4 3 2 1

result:

ok 30 numbers

Test #32:

score: 0
Accepted
time: 51ms
memory: 6276kb

input:

30 254 2256781660157136563723839089600

output:

25 2 3 12 7 16 19 8 22 6 11 17 27 26 10 24 15 21 20 18 28 9 30 23 14 13 5 29 4 1

result:

ok 30 numbers

Test #33:

score: 0
Accepted
time: 100ms
memory: 6308kb

input:

30 448 3131906441000512625049600

output:

23 20 28 18 26 30 19 29 27 22 17 24 21 25 2 13 16 15 14 12 11 10 9 8 7 6 5 4 3 1

result:

ok 30 numbers

Test #34:

score: 0
Accepted
time: 7ms
memory: 6008kb

input:

30 2 20

output:

1 2 3 4 5 6 7 8 9 11 10 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30

result:

ok 30 numbers

Test #35:

score: 0
Accepted
time: 4ms
memory: 6228kb

input:

30 2 29

output:

2 1 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30

result:

ok 30 numbers

Extra Test:

score: 0
Extra Test Passed