QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#864550 | #9678. 网友小 Z 的树 | KaXdd_# | 0 | 2ms | 14996kb | C++14 | 915b | 2025-01-20 18:39:37 | 2025-01-20 18:39:38 |
Judging History
answer
#include"diameter.h"
#include<bits/stdc++.h>
#define L(i, a, b) for (int i = (a); i <= (b); i++)
#define R(i, a, b) for (int i = (a); i >= (b); i--)
using namespace std;
pair<int, int> find_diameter(int subid, int n){
const int inf = 1e18;
if (n == 1) return {1, 1};
if (n == 2) return {1, 2};
if (n == 3){
if (in(1, 2, 3)) return {2, 3};
if (in(2, 1, 3)) return {1, 3};
return {1, 2};
}
int mx = 0, p = 0;
L(i, 3, n){
int ret = query(1, 2, i);
if (ret > mx){
mx = ret;
p = i;
}
}
int x = p;
mx = p = 0;
L(i, 1, n){
if ((i ^ 2) && (i ^ x)){
int ret = query(2, x, i);
if (ret > mx){
mx = ret;
p = i;
}
}
}
int y = p;
return {x, y};
mx = p = 0;
int mn = inf / 2;
L(i, 1, n){
if ((i ^ x) && (i ^ y)){
int ret = query(x, y, i);
mn = min(mn, ret);
if (ret > mx){
mx = ret;
p = i;
}
}
}
}
詳細信息
Subtask #1:
score: 0
Wrong Answer
Test #1:
score: 0
Wrong Answer
time: 2ms
memory: 14996kb
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%