QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#489557#8819. CNOI KnowledgeqLWA 16ms3884kbC++14605b2024-07-24 21:22:242024-07-24 21:22:24

Judging History

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

  • [2024-07-24 21:22:24]
  • 评测
  • 测评结果：WA
  • 用时：16ms
  • 内存：3884kb
查看
  • [2024-07-24 21:22:24]
  • 提交

answer

#include <cstdio>
using i32 = int;
constexpr i32 N = 1000;
i32 aks(i32 l, i32 r) noexcept {
	static i32 x;
	printf("? %d %d\n", l, r), fflush(stdout);
	return scanf("%d", &x), x;
}
i32 n, ans[N + 1], cur;
i32 nxt[N + 1], suf[N + 1];
signed main() noexcept {
	scanf("%d", &n);
	for (i32 i = 1; i <= n; ++i) {
		i32 l = 0, r = i - 1;
		for (i32 mid; l < r;)
			if (mid = (l + r + 1) >> 1, aks(mid, i) - aks(mid, i - 1) <= i - mid)
				l = mid;
			else
				r = mid - 1;
		ans[i] = l ? ans[l] : ++cur;
	}
	putchar('!');
	for (i32 i = 1; i <= n; ++i) printf(" %d", ans[i]);
	return 0;
}
Source code, Language: C++14

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

input:

12
3
1
6
3
6
3
10
6
10
6
15
10
10
6
21
15
15
10
27
21
20
15
14
10
6
3
9
6
20
14
34
26
43
34
19
14
9
6
5
3
2
1
25
19
8
5
5
2
25
19
9
5
19
13

output:

? 1 2
? 1 1
? 1 3
? 1 2
? 2 4
? 2 3
? 1 4
? 1 3
? 2 5
? 2 4
? 1 5
? 1 4
? 3 6
? 3 5
? 1 6
? 1 5
? 3 7
? 3 6
? 1 7
? 1 6
? 2 7
? 2 6
? 4 8
? 4 7
? 6 8
? 6 7
? 5 8
? 5 7
? 4 9
? 4 8
? 2 9
? 2 8
? 1 9
? 1 8
? 5 10
? 5 9
? 7 10
? 7 9
? 8 10
? 8 9
? 9 10
? 9 9
? 5 11
? 5 10
? 8 11
? 8 10
? 9 11
? 9 10
? ...

result:

ok Accepted. 54 queries used.

Test #2:

score: -100
Wrong Answer
time: 16ms
memory: 3872kb

input:

1000
3
1
5
3
2
1
3
2
2
1
7
3
11
7
8
5
5
3
2
1
11
8
3
2
2
1
11
7
5
2
7
3
15
11
8
5
5
3
3
1
15
11
8
5
5
3
2
1
19
15
7
5
3
2
2
1
19
15
4
3
3
2
2
1
23
19
5
4
3
2
2
1
20
17
5
4
3
2
2
1
23
20
5
4
3
2
2
1
23
15
9
4
13
6
15
7
31
23
14
9
8
5
5
3
3
1
31
23
15
11
7
5
5
3
3
1
41
31
16
11
8
5
5
3
2
1
45
36
15
11...

output:

? 1 2
? 1 1
? 1 3
? 1 2
? 2 3
? 2 2
? 2 4
? 2 3
? 3 4
? 3 3
? 2 5
? 2 4
? 1 5
? 1 4
? 3 6
? 3 5
? 4 6
? 4 5
? 5 6
? 5 5
? 3 7
? 3 6
? 5 7
? 5 6
? 6 7
? 6 6
? 4 8
? 4 7
? 6 8
? 6 7
? 5 8
? 5 7
? 4 9
? 4 8
? 6 9
? 6 8
? 7 9
? 7 8
? 8 9
? 8 8
? 5 10
? 5 9
? 7 10
? 7 9
? 8 10
? 8 9
? 9 10
? 9 9
? 5 11
?...

result:

wrong answer Too many queries.
English 繁體中文 简体中文

Server Time: 2025-02-01 23:45:57 | OpenSource Project