QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#129169#6742. LeavesjeffqiWA 25ms5396kbC++232.1kb2023-07-22 04:19:142023-07-22 04:19:17

Judging History

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

  • [2023-08-10 23:21:45]
  • System Update: QOJ starts to keep a history of the judgings of all the submissions.
  • [2023-07-22 04:19:17]
  • 评测
  • 测评结果:WA
  • 用时:25ms
  • 内存:5396kb
  • [2023-07-22 04:19:14]
  • 提交

answer

#include<bits/stdc++.h>
#define ll long long
#define vi vector<int>
#define vll vector<ll>
#define eb emplace_back
#define pb push_back
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define sz(v) ((int)v.size())
#define pii pair<int,int>
#define pll pair<ll,ll>
#define fi first
#define se second
#define umap unordered_map
#define uset unordered_set
#define mset multiset
#define ull unsigned ll
#define i128 __int128
using namespace std;
namespace qiqi {
	void main() {
		int n,m;
		cin >> n >> m;
		vi a(n),siz(n);
		vector<array<int,2>> ch(n,{-1,-1});
		for (int i = 0; i < n; i++) {
			int c; cin >> c;
			if (c == 1) {
				for (int j = 0; j < 2; j++) {
					cin >> ch[i][j]; ch[i][j]--;
				}
			}
			else {
				cin >> a[i];
			}
		}
		auto dfs = [&](auto self,int u) -> vector<vi> {
			if (ch[u] == array<int,2>{-1,-1}) {
				siz[u] = 1;
				return vector<vi>({vi({a[u]})});
			}
			else {
				vector<vi> v[2];
				for (int i = 0; i < 2; i++) {
					v[i] = self(self,ch[u][i]);
					siz[u] += siz[ch[u][i]];
				}
				vector<vi> vec(siz[u]);
				for (int j = 0; j < 2; j++) {
					for (int k = 0,p = 0; k < 2; k++,p = k) {
						for (int i = p; i+j < siz[u]; i++) {
							if (p < sz(v[j]) && i-p < sz(v[j^1]) && !v[j][p].empty() && !v[j^1][i-p].empty()) {
								int cur = (i-k)/2*2+k;
								if (cur < sz(v[j]) && v[j][cur] < v[j][p]) {
									p = cur;
								}
								vi tmp = v[j][p];
								tmp.insert(tmp.end(),all(v[j^1][i-p]));
								if (vec[i+j].empty() || vec[i+j] > tmp) {
									vec[i+j] = tmp;
								}
							}
						}
					}
				}
				for (int i = 2; i < siz[u]; i++) {
					if (vec[i].empty() || vec[i] > vec[i-2]) {
						vec[i] = vec[i-2];
					}
				}
				return vec;
			}
		};
		auto vec = dfs(dfs,0)[m];
		for (auto x:vec) {
			cout << x << ' ';
		}
		cout << '\n';
	}
}
int main() {
//	clock_t st = clock();
//	freopen("test.in","r",stdin);
//	freopen("test.out","w",stdout);

	ios::sync_with_stdio(false);
	cin.tie(nullptr);

	qiqi::main();
//	cout << (double)(clock()-st)/CLOCKS_PER_SEC;
	return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 1ms
memory: 3500kb

input:

3 0
1 2 3
2 1
2 2

output:

1 2 

result:

ok 2 number(s): "1 2"

Test #2:

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

input:

7 1
1 2 3
1 4 5
1 6 7
2 4
2 2
2 3
2 1

output:

2 4 3 1 

result:

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

Test #3:

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

input:

7 2
1 2 3
1 4 5
1 6 7
2 4
2 2
2 3
2 1

output:

1 3 4 2 

result:

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

Test #4:

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

input:

1 0
2 1000000000

output:

1000000000 

result:

ok 1 number(s): "1000000000"

Test #5:

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

input:

3 1
1 2 3
2 1
2 2

output:

2 1 

result:

ok 2 number(s): "2 1"

Test #6:

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

input:

7 2
1 2 3
1 4 5
1 6 7
2 1
2 2
2 3
2 4

output:

1 2 3 4 

result:

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

Test #7:

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

input:

999 480
1 3 2
1 4 5
1 6 7
1 9 8
1 10 11
1 13 12
1 14 15
1 16 17
1 19 18
1 21 20
1 23 22
1 25 24
1 27 26
1 28 29
1 30 31
1 33 32
1 35 34
1 37 36
1 38 39
1 41 40
1 42 43
1 45 44
1 46 47
1 48 49
1 51 50
1 52 53
1 55 54
1 56 57
1 58 59
1 61 60
1 62 63
1 64 65
1 67 66
1 69 68
1 71 70
1 73 72
1 74 75
1 76...

output:

34826804 763875883 763875883 763875883 763875883 763875883 763875883 763875883 248820103 763875883 763875883 763875883 763875883 763875883 763875883 763875883 763875883 763875883 763875883 763875883 763875883 763875883 763875883 763875883 763875883 763875883 763875883 763875883 763875883 763875883 7...

result:

ok 500 numbers

Test #8:

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

input:

999 480
1 2 3
1 4 5
1 7 6
1 8 9
1 10 11
1 13 12
1 15 14
1 17 16
1 19 18
1 21 20
1 23 22
1 24 25
1 26 27
1 28 29
1 31 30
1 32 33
1 34 35
1 37 36
1 38 39
1 41 40
1 42 43
1 44 45
1 46 47
1 48 49
1 51 50
1 52 53
1 54 55
1 57 56
1 58 59
1 60 61
1 62 63
1 65 64
1 66 67
1 69 68
1 71 70
1 72 73
1 75 74
1 77...

output:

530024839 530024839 530024839 530024839 530024839 530024839 530024839 530024839 530024839 530024839 530024839 530024839 530024839 530024839 530024839 530024839 530024839 530024839 530024839 530024839 530024839 530024839 530024839 530024839 530024839 530024839 530024839 530024839 530024839 530024839 ...

result:

ok 500 numbers

Test #9:

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

input:

999 480
1 3 2
1 5 4
1 7 6
1 8 9
1 10 11
1 13 12
1 15 14
1 17 16
1 18 19
1 21 20
1 23 22
1 25 24
1 26 27
1 29 28
1 31 30
1 33 32
1 34 35
1 37 36
1 38 39
1 41 40
1 43 42
1 45 44
1 47 46
1 49 48
1 50 51
1 52 53
1 54 55
1 56 57
1 59 58
1 60 61
1 62 63
1 65 64
1 67 66
1 69 68
1 71 70
1 73 72
1 74 75
1 76...

output:

507922 928353918 51892154 809031414 296508656 801553730 385852006 930053625 95913518 431154803 117002192 187199343 405980569 664093190 478863675 930428963 3440725 490128679 92302056 563992614 27927487 246777697 168388113 922508131 52386784 780998040 438167217 876407248 158186938 633166175 788275543 ...

result:

ok 500 numbers

Test #10:

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

input:

999 480
1 3 2
1 4 5
1 7 6
1 8 9
1 10 11
1 13 12
1 15 14
1 16 17
1 19 18
1 21 20
1 23 22
1 24 25
1 26 27
1 29 28
1 30 31
1 32 33
1 35 34
1 37 36
1 38 39
1 41 40
1 43 42
1 45 44
1 46 47
1 48 49
1 50 51
1 52 53
1 54 55
1 56 57
1 58 59
1 60 61
1 63 62
1 65 64
1 66 67
1 68 69
1 70 71
1 72 73
1 74 75
1 76...

output:

666292 26210483 65023030 95745223 11431606 30237589 40996997 59830702 14512182 24640163 39361368 85684143 17020177 58437715 74457645 91998540 7557034 46923480 16066480 33921131 14512182 83949838 22501176 83949838 15127734 18414338 52979072 81930757 24640163 70913581 72929459 78973167 3687875 4610266...

result:

ok 500 numbers

Test #11:

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

input:

999 480
1 3 2
1 4 5
1 7 6
1 9 8
1 10 11
1 13 12
1 15 14
1 16 17
1 18 19
1 20 21
1 23 22
1 24 25
1 27 26
1 29 28
1 30 31
1 33 32
1 34 35
1 37 36
1 39 38
1 40 41
1 42 43
1 44 45
1 47 46
1 48 49
1 50 51
1 52 53
1 55 54
1 56 57
1 59 58
1 60 61
1 62 63
1 64 65
1 66 67
1 68 69
1 70 71
1 72 73
1 75 74
1 77...

output:

874376 19021636 10912872 49114704 21454471 94310772 60086613 88323254 20181141 62658098 54568372 64872279 21454471 30659919 73483837 98385133 12300384 74080822 54568372 100102768 29770805 62658098 33159023 62908008 33159023 98943188 52580720 64872279 58787422 98644936 73687255 98385133 10912872 9838...

result:

ok 500 numbers

Test #12:

score: -100
Wrong Answer
time: 25ms
memory: 5396kb

input:

905 52
1 3 2
2 25780328
1 4 5
2 84996992
1 6 7
2 43060692
1 8 9
2 58356233
1 11 10
2 48172306
1 12 13
2 94654986
1 14 15
2 66085196
1 17 16
2 43141873
1 18 19
2 58356233
1 21 20
2 58356233
1 22 23
2 64124892
1 24 25
2 55464563
1 27 26
2 46324683
1 29 28
2 78919648
1 30 31
2 13379324
1 32 33
2 960564...

output:

25780328 43060692 58356233 94654986 66085196 58356233 64124892 55464563 13379324 96056429 19600883 13964121 81431000 29038234 612429 100691869 42176482 11168414 73966606 67536425 95525118 78919648 95193352 30826255 37151895 7037533 8543837 52995307 44403070 52641549 101356178 67536425 100691869 8306...

result:

wrong answer 1st numbers differ - expected: '612429', found: '25780328'