QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#177400#7118. Closing Timetriple321#9 1ms3732kbC++201.9kb2023-09-12 22:17:232023-09-12 22:17:23

Judging History

你现在查看的是测评时间为 2023-09-12 22:17:23 的历史记录

  • [2024-04-28 07:39:51]
  • 管理员手动重测本题所有提交记录
  • 测评结果:9
  • 用时:1ms
  • 内存:4128kb
  • [2023-09-12 22:17:23]
  • 评测
  • 测评结果:9
  • 用时:1ms
  • 内存:3732kb
  • [2023-09-12 22:17:23]
  • 提交

answer

#include <bits/stdc++.h>
#ifndef CYBER
#include "closing.h"
#endif
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#pragma GCC optimize("Ofast")

using namespace std;
using namespace __gnu_pbds;

#define lg long long
#define ordered_set	tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>
#define fastio ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);

int max_score(int n, int x, int y, lg k, vector<int> u, vector<int> v, vector<int> w)
{
	int ans = 0;
	x++, y++;
	lg a[n+2], b[n+2], c[n+2], d[n+2];
	vector<lg> best[n+2];
	memset(a, 0, sizeof(a));
	memset(b, 0, sizeof(b));
	memset(c, 0, sizeof(c));
	memset(d, 0, sizeof(d));
	for(int i = x-1; i >= 1; i--)
	{
		a[i] = a[i+1]+w[i-1];
	}
	for(int i = y-1; i >= 1; i--)
	{
		c[i] = c[i+1]+w[i-1];
	}
	for(int i = x+1; i <= n; i++)
	{
		b[i] = b[i-1]+w[i-2];
	}
	for(int i = y+1; i <= n; i++)
	{
		d[i] = d[i-1]+w[i-2];
	}
	for(int i = y; i <= n; i++)
	{
		lg gh = 0;
		for(int j = i; j <= n; j++)
		{
			gh += d[j];
			// cout << gh << ' ';
			best[i].push_back(gh);
		}
		// cout << '\n';
	}
	lg sum = 0;
	vector<lg> mxm(n+2);
	for(int i = x; i >= 1; i--)
	{
		sum += max(0ll, a[i]-mxm[i]);
		mxm[i] = max(mxm[i], a[i]);
		vector<lg> fake3 = mxm;
		lg o3 = sum;
		for(int j = x; j <= n; j++)
		{
			sum += max(0ll, b[j]-mxm[j]);
			mxm[j] = max(mxm[j], b[j]);
			vector<lg> fake2 = mxm;
			lg o2 = sum;
			for(int z = y; z >= 1; z--)
			{
				sum += max(0ll, c[z]-mxm[z]);
				mxm[z] = max(mxm[z], c[z]);
				if(sum > k)	continue;
				int idx = max(y, j);
				int g = upper_bound(best[idx].begin(), best[idx].end(), k-sum)-1-best[idx].begin();
				// cout << k-sum << ' ' << idx << ' ' << g << ' ' << z << '\n';
				ans = max(ans, j-i+g+idx-z+2);
			}
			mxm = fake2;
			sum = o2;
		}
		mxm = fake3;
		sum = o3;
	}
	return ans;
}

详细

Subtask #1:

score: 0
Time Limit Exceeded

Test #1:

score: 0
Time Limit Exceeded

input:

cc61ad56a4797fb3f5c9529f73ce6fcedd85669b
1
200000 31011 61157 8517583098
31011 129396 964383
1655 129396 331139
1655 191487 566483
110385 191487 865248
43212 110385 542661
43212 81682 13766
81682 91774 546589
91774 124706 780638
124706 175650 118706
10421 175650 615314
10421 151953 436270
140430 151...

output:


result:


Subtask #2:

score: 9
Accepted

Test #4:

score: 9
Accepted
time: 1ms
memory: 3732kb

input:

cc61ad56a4797fb3f5c9529f73ce6fcedd85669b
1
50 23 25 382806473
0 1 375710
1 2 898637
2 3 10402
3 4 536577
4 5 385023
5 6 71075
6 7 543368
7 8 301497
8 9 174394
9 10 711312
10 11 923006
11 12 675532
12 13 838667
13 14 565729
14 15 979816
15 16 862618
16 17 576015
17 18 177751
18 19 306989
19 20 881492...

output:

081ce3c351cbf526b37954b9ad30f2b531a7585c
OK
96

result:

ok 

Test #5:

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

input:

cc61ad56a4797fb3f5c9529f73ce6fcedd85669b
1
47 20 22 25669694
0 1 291237
1 2 851987
2 3 421247
3 4 962919
4 5 643085
5 6 224951
6 7 756890
7 8 147295
8 9 625823
9 10 736374
10 11 290526
11 12 335466
12 13 539086
13 14 957449
14 15 423408
15 16 932444
16 17 356032
17 18 307118
18 19 94279
19 20 989546...

output:

081ce3c351cbf526b37954b9ad30f2b531a7585c
OK
26

result:

ok 

Test #6:

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

input:

cc61ad56a4797fb3f5c9529f73ce6fcedd85669b
1
46 6 34 355277954
0 1 574359
1 2 58362
2 3 778155
3 4 538832
4 5 128903
5 6 79774
6 7 715282
7 8 259924
8 9 640303
9 10 361135
10 11 506866
11 12 527045
12 13 946672
13 14 620381
14 15 701743
15 16 766266
16 17 524732
17 18 340089
18 19 630172
19 20 357712
...

output:

081ce3c351cbf526b37954b9ad30f2b531a7585c
OK
74

result:

ok 

Test #7:

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

input:

cc61ad56a4797fb3f5c9529f73ce6fcedd85669b
1
45 14 44 70669
0 1 266130
1 2 372315
2 3 965349
3 4 119493
4 5 190522
5 6 506822
6 7 45330
7 8 423189
8 9 748532
9 10 653554
10 11 102552
11 12 90431
12 13 843259
13 14 422626
14 15 35334
15 16 1
16 17 1
17 18 1
18 19 1
19 20 1
20 21 1
21 22 1
22 23 1
23 24...

output:

081ce3c351cbf526b37954b9ad30f2b531a7585c
OK
4

result:

ok 

Test #8:

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

input:

cc61ad56a4797fb3f5c9529f73ce6fcedd85669b
1
50 0 49 332340134
0 1 987193
1 2 950856
2 3 893737
3 4 870689
4 5 810192
5 6 790242
6 7 744052
7 8 714922
8 9 677074
9 10 630082
10 11 599644
11 12 528415
12 13 491648
13 14 479486
14 15 439182
15 16 371085
16 17 357776
17 18 308161
18 19 254481
19 20 20430...

output:

081ce3c351cbf526b37954b9ad30f2b531a7585c
OK
44

result:

ok 

Test #9:

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

input:

cc61ad56a4797fb3f5c9529f73ce6fcedd85669b
1
50 0 49 329827838
0 1 972981
1 2 953594
2 3 908629
3 4 849675
4 5 808354
5 6 782643
6 7 759387
7 8 698618
8 9 650896
9 10 639153
10 11 591828
11 12 532588
12 13 503214
13 14 447660
14 15 403224
15 16 380834
16 17 327127
17 18 300115
18 19 244025
19 20 23362...

output:

081ce3c351cbf526b37954b9ad30f2b531a7585c
OK
44

result:

ok 

Test #10:

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

input:

cc61ad56a4797fb3f5c9529f73ce6fcedd85669b
1
3 0 1 1
0 1 1
1 2 1

output:

081ce3c351cbf526b37954b9ad30f2b531a7585c
OK
3

result:

ok 

Test #11:

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

input:

cc61ad56a4797fb3f5c9529f73ce6fcedd85669b
1
20 8 9 31897732
0 1 428932
1 2 103619
2 3 805647
3 4 691922
4 5 320369
5 6 755877
6 7 701672
7 8 426711
8 9 507102
9 10 492732
10 11 68466
11 12 317311
12 13 37666
13 14 499673
14 15 502226
15 16 753200
16 17 523387
17 18 904778
18 19 695859

output:

081ce3c351cbf526b37954b9ad30f2b531a7585c
OK
30

result:

ok 

Test #12:

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

input:

cc61ad56a4797fb3f5c9529f73ce6fcedd85669b
1
20 15 16 25160185
0 1 193268
1 2 139314
2 3 193167
3 4 446469
4 5 793626
5 6 502774
6 7 598587
7 8 69975
8 9 499282
9 10 943594
10 11 804459
11 12 536095
12 13 578060
13 14 142523
14 15 364845
15 16 181397
16 17 64327
17 18 224827
18 19 439557

output:

081ce3c351cbf526b37954b9ad30f2b531a7585c
OK
26

result:

ok 

Test #13:

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

input:

cc61ad56a4797fb3f5c9529f73ce6fcedd85669b
1
20 0 19 77846543
0 1 603320
1 2 433257
2 3 572719
3 4 340716
4 5 549198
5 6 383420
6 7 50703
7 8 720210
8 9 304217
9 10 162280
10 11 68594
11 12 401595
12 13 446738
13 14 920882
14 15 494739
15 16 616729
16 17 874820
17 18 269830
18 19 53532

output:

081ce3c351cbf526b37954b9ad30f2b531a7585c
OK
34

result:

ok 

Test #14:

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

input:

cc61ad56a4797fb3f5c9529f73ce6fcedd85669b
1
19 2 17 6692
0 1 748749
1 2 369010
2 3 3351
3 4 1
4 5 1
5 6 1
6 7 1
7 8 1
8 9 1
9 10 1
10 11 1
11 12 1
12 13 1
13 14 1
14 15 1
15 16 1
16 17 3346
17 18 11355

output:

081ce3c351cbf526b37954b9ad30f2b531a7585c
OK
3

result:

ok 

Subtask #3:

score: 0
Wrong Answer

Dependency #2:

100%
Accepted

Test #15:

score: 0
Wrong Answer
time: 0ms
memory: 3684kb

input:

cc61ad56a4797fb3f5c9529f73ce6fcedd85669b
25
20 9 16 34385
0 1 196
1 2 733
2 3 758
3 4 92
4 5 636
5 6 462
6 7 491
7 8 239
8 9 873
9 10 983
10 11 72
11 12 988
12 13 690
13 14 162
14 15 287
15 16 247
16 17 121
17 18 140
18 19 64
20 9 13 37109
0 1 530
1 2 588
2 3 841
3 4 274
4 5 994
5 6 879
6 7 879
7 8 ...

output:

081ce3c351cbf526b37954b9ad30f2b531a7585c
OK
25
24
32
30
30
29
26
29
26
33
28
26
28
26
28
24
28
30
25
34
30
28
31
31
32

result:

wrong answer 2nd lines differ - on the 1st token, expected: '25', found: '24'

Subtask #4:

score: 0
Skipped

Dependency #3:

0%

Subtask #5:

score: 0
Wrong Answer

Test #36:

score: 0
Wrong Answer
time: 0ms
memory: 3732kb

input:

cc61ad56a4797fb3f5c9529f73ce6fcedd85669b
1
4 0 1 9
0 2 2
1 2 3
2 3 3

output:

081ce3c351cbf526b37954b9ad30f2b531a7585c
OK
5

result:

wrong answer 1st lines differ - on the 1st token, expected: '6', found: '5'

Subtask #6:

score: 0
Skipped

Dependency #2:

100%
Accepted

Dependency #5:

0%

Subtask #7:

score: 0
Skipped

Dependency #3:

0%

Subtask #8:

score: 0
Skipped

Dependency #4:

0%

Subtask #9:

score: 0
Skipped

Dependency #1:

0%