QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#862933 | #9678. 网友小 Z 的树 | linjunye | 0 | 4ms | 14840kb | C++14 | 761b | 2025-01-19 11:02:16 | 2025-01-19 11:02:38 |
Judging History
answer
#include<bits/stdc++.h>
#include "diameter.h"
using namespace std;
int cal(int x,int y,int n){
int d=1e9;
int _=0;
for(int i=1;i<=n;i++){
if(i==x||i==y)continue;
int dd=query(x,y,i);
if(dd<d){
d=dd;
_=i;
}
}
if(!in(_,x,y))d=1;
while(d>1){
for(int i=1;i<=n;i++){
if(i==x||i==y)continue;
int dd=query(x,y,i);
if(dd<=d){
d=dd;
y=i;
break;
}
}
}
int mx=0;
int u=y;
for(int i=1;i<=n;i++){
if(i==x||i==y)continue;
int dd=query(i,x,y);
if(dd>mx){
mx=dd;
u=i;
}
}
return u;
}
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);
int u=cal(1,2,n);
int v=cal(u,2,n);
return make_pair(u,v);
}
Details
Tip: Click on the bar to expand more detailed information
Subtask #1:
score: 0
Wrong Answer
Test #1:
score: 0
Wrong Answer
time: 4ms
memory: 14840kb
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%