QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#219047	#7121. Beech Tree	Pyqe^#	9	29ms	15952kb	C++14	1010b	2023-10-18 23:00:25	2023-10-18 23:00:26

Judging History

你现在查看的是测评时间为 2023-10-18 23:00:26 的历史记录

[2024-04-28 07:55:13]
管理员手动重测本题所有提交记录

测评结果：9
用时：28ms
内存：16200kb

查看

[2023-10-18 23:00:26]
评测

测评结果：9
用时：29ms
内存：15952kb

查看

[2023-10-18 23:00:25]
提交

answer

#include <bits/stdc++.h>
#include "beechtree.h"

using namespace std;

long long n,m,nn,pr[200069],a[200069],ex[200069],pm[200069],fq[200069];
vector<long long> al[200069];

void dfs(long long x)
{
	long long i,sz=al[x].size(),l;
	
	nn++;
	ex[nn]=x;
	for(i=0;i<sz;i++)
	{
		l=al[x][i];
		dfs(l);
	}
}

vector<int> beechtree(int on,int om,vector<int> opr,vector<int> oa)
{
	long long i,j,p;
	bool bad;
	vector<int> sq;
	
	n=on;
	m=om;
	for(i=1;i<=n;i++)
	{
		pr[i]=opr[i-1]+1;
		a[i]=oa[i-1];
		al[pr[i]].push_back(i);
	}
	for(i=1;i<=n;i++)
	{
		nn=0;
		dfs(i);
		for(j=1;j<=nn;j++)
		{
			pm[j]=j;
		}
		bad=0;
		for(;1;)
		{
			for(j=1;j<=m;j++)
			{
				fq[j]=0;
			}
			for(j=2;j<=nn;j++)
			{
				p=ex[pm[j]];
				fq[a[p]]++;
				if(ex[pm[fq[a[p]]]]!=pr[p])
				{
					break;
				}
			}
			if(j>nn)
			{
				bad=1;
				break;
			}
			if(!next_permutation(pm+2,pm+nn+1))
			{
				break;
			}
		}
		sq.push_back(bad);
	}
	return sq;
}

源文件, 语言: C++14

详细

Subtask #1:

score: 9

Accepted

Test #1:

score: 9

Accepted

time: 2ms

memory: 14496kb

input:

j2DRV0nYbs0y1xUYUGaiqtOKUU9vM9zi
8 500
-1 0 1 2 3 4 5 6
0 281 281 281 281 281 281 281

output:

p89vHUOQJ7iyHtdrgGXzKx8iRtXLL6wH
OK
1 1 1 1 1 1 1 1

result:

ok

Test #2:

score: 0

Accepted

time: 0ms

memory: 14276kb

input:

j2DRV0nYbs0y1xUYUGaiqtOKUU9vM9zi
8 500
-1 0 1 2 3 4 5 6
0 11 169 169 169 169 169 169

output:

p89vHUOQJ7iyHtdrgGXzKx8iRtXLL6wH
OK
0 1 1 1 1 1 1 1

result:

ok

Test #3:

score: 0

Accepted

time: 0ms

memory: 15916kb

input:

j2DRV0nYbs0y1xUYUGaiqtOKUU9vM9zi
8 500
-1 0 1 2 3 4 5 6
0 324 324 492 324 324 324 324

output:

p89vHUOQJ7iyHtdrgGXzKx8iRtXLL6wH
OK
0 0 0 1 1 1 1 1

result:

ok

Test #4:

score: 0

Accepted

time: 0ms

memory: 14512kb

input:

j2DRV0nYbs0y1xUYUGaiqtOKUU9vM9zi
8 500
-1 0 1 2 3 4 5 6
0 216 220 387 371 53 34 188

output:

p89vHUOQJ7iyHtdrgGXzKx8iRtXLL6wH
OK
0 0 0 0 0 0 1 1

result:

ok

Test #5:

score: 0

Accepted

time: 0ms

memory: 14828kb

input:

j2DRV0nYbs0y1xUYUGaiqtOKUU9vM9zi
7 500
-1 0 0 0 1 1 2
0 357 147 147 20 147 20

output:

p89vHUOQJ7iyHtdrgGXzKx8iRtXLL6wH
OK
0 1 1 1 1 1 1

result:

ok

Test #6:

score: 0

Accepted

time: 2ms

memory: 15672kb

input:

j2DRV0nYbs0y1xUYUGaiqtOKUU9vM9zi
4 500
-1 0 0 0
0 267 210 278

output:

p89vHUOQJ7iyHtdrgGXzKx8iRtXLL6wH
OK
1 1 1 1

result:

ok

Test #7:

score: 0

Accepted

time: 0ms

memory: 15952kb

input:

j2DRV0nYbs0y1xUYUGaiqtOKUU9vM9zi
7 500
-1 0 0 0 1 2 3
0 250 140 214 250 250 140

output:

p89vHUOQJ7iyHtdrgGXzKx8iRtXLL6wH
OK
0 1 1 1 1 1 1

result:

ok

Test #8:

score: 0

Accepted

time: 2ms

memory: 15512kb

input:

j2DRV0nYbs0y1xUYUGaiqtOKUU9vM9zi
8 500
-1 0 0 0 1 1 3 3
0 40 205 455 455 36 36 455

output:

p89vHUOQJ7iyHtdrgGXzKx8iRtXLL6wH
OK
0 1 1 1 1 1 1 1

result:

ok

Test #9:

score: 0

Accepted

time: 0ms

memory: 15164kb

input:

j2DRV0nYbs0y1xUYUGaiqtOKUU9vM9zi
7 500
-1 0 0 1 1 1 2
0 181 33 33 181 201 33

output:

p89vHUOQJ7iyHtdrgGXzKx8iRtXLL6wH
OK
0 1 1 1 1 1 1

result:

ok

Test #10:

score: 0

Accepted

time: 1ms

memory: 14268kb

input:

j2DRV0nYbs0y1xUYUGaiqtOKUU9vM9zi
5 500
-1 0 0 1 2
0 162 281 162 162

output:

p89vHUOQJ7iyHtdrgGXzKx8iRtXLL6wH
OK
1 1 1 1 1

result:

ok

Subtask #2:

score: 0

Time Limit Exceeded

Test #11:

score: 0

Time Limit Exceeded

input:

j2DRV0nYbs0y1xUYUGaiqtOKUU9vM9zi
200000 200000
-1 0 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 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86...

output:

result:

Subtask #3:

score: 0

Time Limit Exceeded

Test #25:

score: 0

Time Limit Exceeded

input:

j2DRV0nYbs0y1xUYUGaiqtOKUU9vM9zi
103965 200000
-1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ...

output:

result:

Subtask #4:

score: 0

Time Limit Exceeded

Test #48:

score: 0

Time Limit Exceeded

input:

j2DRV0nYbs0y1xUYUGaiqtOKUU9vM9zi
199979 200000
-1 0 1 1 1 1 1 1 1 1 1 1 11 11 1 11 11 11 11 11 11 11 0 22 23 23 23 23 23 23 23 23 23 23 33 22 35 36 36 36 36 36 36 36 36 38 38 38 35 48 49 49 49 49 49 49 49 53 53 48 59 60 60 60 60 60 59 66 67 67 67 67 67 67 67 67 67 67 73 71 66 80 81 81 81 81 81 81 81...

output:

result:

Subtask #5:

score: 0

Time Limit Exceeded

Dependency #1:

100%

Accepted

Test #54:

score: 0

Time Limit Exceeded

input:

j2DRV0nYbs0y1xUYUGaiqtOKUU9vM9zi
200 500
-1 0 0 1 1 2 3 4 5 6 2 7 0 8 9 10 11 12 13 14 1 15 3 16 17 2 18 19 20 4 5 21 22 23 24 25 26 27 28 29 6 30 31 3 32 33 34 35 36 37 7 8 9 38 10 39 11 40 41 12 13 14 4 42 43 44 45 46 5 47 6 48 15 49 50 51 16 52 53 7 54 17 55 56 57 8 9 18 58 59 60 61 19 62 63 64 2...

output:

result:

Subtask #6:

score: 0

Time Limit Exceeded

Test #65:

score: 14

Accepted

time: 29ms

memory: 15752kb

input:

j2DRV0nYbs0y1xUYUGaiqtOKUU9vM9zi
2000 2
-1 0 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 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 ...

output:

p89vHUOQJ7iyHtdrgGXzKx8iRtXLL6wH
OK
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...

result:

ok

Test #66:

score: -14

Time Limit Exceeded

input:

j2DRV0nYbs0y1xUYUGaiqtOKUU9vM9zi
2000 2
-1 0 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 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 ...

output:

result:

Subtask #7:

score: 0

Skipped

Dependency #5:

Subtask #8:

score: 0

Skipped

Dependency #6:

Subtask #9:

score: 0

Skipped

Dependency #1:

100%

Accepted