QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#864263#9678. 网友小 Z 的树L_Hospital_#0 0ms14540kbC++141.1kb2025-01-20 13:19:592025-01-20 13:20:00

Judging History

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

  • [2025-01-20 13:20:00]
  • 评测
  • 测评结果:0
  • 用时:0ms
  • 内存:14540kb
  • [2025-01-20 13:19:59]
  • 提交

answer

#include "diameter.h"
#include <bits/stdc++.h>
# define rep(i, j, k) for (int i = j; i <= k; ++i)
using namespace std;

std::pair<int, int> find_diameter(int subid, int n)
{
	if (n == 1) return make_pair(1, 1);
	if (n == 2) return make_pair(1, 2);
	if (n == 3)
	{
		if (in(2, 1, 3)) return make_pair(1, 3); if (in(1, 2, 3)) return make_pair(2, 3); return make_pair(1, 2);
	}
	int maxx = 0, pos = 0;
	rep(i, 3, n) {int res = query(1, 2, i); if (res > maxx) maxx = res, pos = i;}
	int fst = pos; pos = maxx = 0;
	rep(i, 1, n) if (i != 3 && i != fst) {int res = query(2, fst, i); if (res > maxx) maxx = res, pos = i;}
	int sec = pos, fs = 1000000; pos = maxx = 0;
	rep(i, 1, n) if (i != fst && i != sec) {int res = query(fst, sec, i); fs = min(fs, res); if (res > maxx) maxx = res, pos = i;}
	int fp = 1000000, sp = 1000000;
	rep(i, 1, n) {if (i != fst && i != pos) fp = min(fp, query(i, fst, pos)); if (i != sec && i != pos) sp = min(sp, query(i, sec, pos));}
	int xx = max(fs, max(fp, sp));
	if (fs == xx) return make_pair(fst, sec); if (sp == xx) return make_pair(sec, pos); return make_pair(fst, pos);
}

Details

Tip: Click on the bar to expand more detailed information

Subtask #1:

score: 0
Wrong Answer

Test #1:

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

input:

1 100
25
1 3
2 18
3 8
4 18
5 14
6 22
7 18
8 10
9 11
10 12
11 25
12 16
13 11
14 17
15 17
16 25
17 2
18 20
19 18
20 12
21 1
22 17
23 14
24 1
50
1 37
2 27
3 10
4 25
5 16
6 17
7 10
8 36
9 16
10 6
11 48
12 2
13 28
14 30
15 10
16 44
17 31
18 1
19 6
20 7
21 30
22 42
23 45
24 23
25 27
26 39
27 45
28 48
29 4...

output:

WA

result:

wrong answer Wrong Answer

Subtask #2:

score: 0
Skipped

Dependency #1:

0%

Subtask #3:

score: 0
Skipped

Dependency #2:

0%

Subtask #4:

score: 0
Skipped

Dependency #3:

0%

Subtask #5:

score: 0
Skipped

Dependency #4:

0%

Subtask #6:

score: 0
Skipped

Dependency #5:

0%

Subtask #7:

score: 0
Skipped

Dependency #6:

0%

Subtask #8:

score: 0
Skipped

Dependency #7:

0%

Subtask #9:

score: 0
Skipped

Dependency #8:

0%

Subtask #10:

score: 0
Skipped

Dependency #9:

0%

Subtask #11:

score: 0
Skipped

Dependency #1:

0%