QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#588346#8578. 과일 게임the_coding_pooh0 9ms3848kbC++14482b2024-09-25 09:50:412024-09-25 09:50:43

Judging History

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

  • [2024-09-25 09:50:43]
  • 评测
  • 测评结果：0
  • 用时：9ms
  • 内存：3848kb
查看
  • [2024-09-25 09:50:41]
  • 提交

answer

#include <bits/stdc++.h>
#define uwu return;

using namespace std;

vector<int> B;

void prepare_game(std::vector<int> A) {
	B = A;
	uwu
}

int play_game(int l, int r) {
	vector <int> num;
	for(int i = l, a; i <= r; i++){
		a = B[i];
		while(!num.empty() && num.back() == a){
			a++;
			num.pop_back();
		}
		num.push_back(a);
	}
	int mx = 0;
	for(auto i:num){
		mx = max(i, mx);
	}
	return mx;
}

void update_game(int p, int v) {
	B[p] = v;
	uwu
}
Source code, Language: C++14

Details

Tip: Click on the bar to expand more detailed information

Subtask #1:

score: 0
Wrong Answer

Test #1:

score: 5
Accepted
time: 0ms
memory: 3788kb

input:

10
2 2 1 2 2 2 2 1 2 2
10
1 0 2
1 0 9
1 0 5
1 2 4
1 0 9
1 2 7
1 3 7
1 7 9
1 1 3
1 0 2

output:

3
4
3
3
4
4
4
3
2
3

result:

ok 10 lines

Test #2:

score: 5
Accepted
time: 0ms
memory: 3788kb

input:

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

output:

2
3
3
3
3
3
3
2
3
3

result:

ok 10 lines

Test #3:

score: 5
Accepted
time: 0ms
memory: 3848kb

input:

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

output:

2
2
2
2
3
3
3
4
4
2

result:

ok 10 lines

Test #4:

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

input:

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

output:

2
3
2
2
4
2
2
3
4
4

result:

wrong answer 6th lines differ - expected: '3', found: '2'

Subtask #2:

score: 0
Skipped

Dependency #1:

0%

Subtask #3:

score: 0
Wrong Answer

Test #31:

score: 0
Wrong Answer
time: 9ms
memory: 3824kb

input:

4000
1 1 1 1 1 1 1 1 2 2 2 2 1 1 1 1 2 2 2 2 1 1 1 1 2 2 2 2 2 2 2 2 1 1 1 1 1 1 1 1 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 1 1 1 1 2 2 2 2 2 2 2 2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 1 1 1 1 1 1 1 1 2 2 2 2 1 1 1 1 2 2 2 2...

output:

11
12
12
11
10
11
10
11
12
10
9
10
9
9
9
12
11
10
11
9
12
8
9
10
11
12
10
12
10
8
9
10
10
11
10
11
11
11
9
8
5
10
9
9
10
7
10
10
8
9
9
10
10
10
9
10
10
10
6
6
10
9
10
10
8
9
8
9
10
10
9
10
10
9
8
9
9
10
10
9
9
9
8
9
9
8
7
8
10
10
8
8
10
10
8
10
9
6
7
9
9
9
9
7
9
9
9
9
9
9
9
8
9
9
9
9
8
8
8
9
9
8
9
9...

result:

wrong answer 152nd lines differ - expected: '8', found: '7'

Subtask #4:

score: 0
Skipped

Dependency #1:

0%

Subtask #5:

score: 0
Skipped

Dependency #3:

0%

Subtask #6:

score: 0
Time Limit Exceeded

Test #69:

score: 0
Time Limit Exceeded

input:

100000
2 10 6 3 5 4 2 6 9 3 8 3 9 6 9 8 8 9 4 6 5 10 7 1 2 5 5 2 7 3 5 10 5 6 7 5 9 10 6 10 7 3 2 1 7 8 4 4 3 10 1 6 9 9 6 9 6 1 6 4 8 5 5 6 8 3 3 7 6 6 3 5 5 9 5 5 7 10 7 3 10 1 4 2 3 6 9 2 7 2 8 10 4 5 2 6 7 1 8 2 8 3 3 10 9 8 6 6 9 6 4 5 8 4 10 10 4 1 6 4 4 3 9 4 7 7 2 8 8 7 10 6 8 2 1 4 2 2 5 2 ...

output:

12
11
11
12
12
12
11
12
12
12
12
12
11
12
12
12
12
12
12
12
12
12
12
12
12
11
12
12
11
10
12
12
12
12
12
12
12
12
12
12
12
12
12
11
12
12
12
12
12
12
12
12
12
12
12
12
12
12
12
12
12
12
12
12
12
12
11
12
12
12
12
11
12
12
12
12
12
12
12
12
12
12
12
12
12
12
12
12
11
12
12
12
12
12
12
12
12
12
12
12
...

result:

Subtask #7:

score: 0
Skipped

Dependency #1:

0%
English 繁體中文 简体中文

Server Time: 2024-12-03 08:46:18 | OpenSource Project