QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#860372 | #9678. 网友小 Z 的树 | Physics212303 | 16 | 16ms | 17432kb | C++17 | 1.3kb | 2025-01-18 13:02:55 | 2025-01-18 13:02:55 |
Judging History
answer
#include "diameter.h"
#include<bits/stdc++.h>
using namespace std;
typedef pair<int,int> pii;
mt19937 g(time(0));
pii find_diameter(int id,int n){
if(n==1)return make_pair(1,1);
if(n==2)return make_pair(1,2);
vector<int> p(n);
iota(p.begin(),p.end(),1);
shuffle(p.begin(),p.end(),g);
uniform_int_distribution<> U(1,n);
int u=U(g),v=U(g),w=U(g);
while(v==u)v=U(g);
while(w==u||w==v)w=U(g);
int c=query(u,v,w);
for(int i=0;i<p.size()>>2;i++)
if(p[i]!=u&&p[i]!=v&&p[i]!=w){
int r1=query(u,v,p[i]),r2=query(u,w,p[i]),r3=query(v,w,p[i]);
if(int mn=min({c,r1,r2,r3});mn==r1)w=p[i];
else if(mn==r2)v=p[i];
else if(mn==r3)u=p[i];
}
if(in(u,w,v))swap(u,w);
u=c=0;
for(int i=1;i<=n;i++)
if(i!=u&&i!=v&&i!=w){
int r=query(v,w,i);
if(r>c)c=r,u=i;
}
v=U(g),w=U(g);
while(v==u)v=U(g);
while(w==u||w==v)w=U(g);
c=query(u,v,w);
for(int i=0;i<p.size()>>2;i++)
if(p[i]!=u&&p[i]!=v&&p[i]!=w){
int r1=query(u,v,p[i]),r2=query(u,w,p[i]),mn=min({c,r1,r2});
if(mn==r1)w=p[i];
else if(mn==r2)v=p[i];
}
if(in(w,u,v))swap(w,v);
w=c=0;
for(int i=1;i<=n;i++)
if(i!=u&&i!=v&&i!=w){
int r=query(u,v,i);
if(r>c)c=r,w=i;
}
return make_pair(u,w);
}
詳細信息
Subtask #1:
score: 16
Accepted
Test #1:
score: 16
Accepted
time: 4ms
memory: 16120kb
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:
correct
result:
ok Correct
Subtask #2:
score: 0
Wrong Answer
Dependency #1:
100%
Accepted
Test #2:
score: 0
Wrong Answer
time: 16ms
memory: 17432kb
input:
2 2006 42 1 32 2 4 3 6 4 29 5 1 6 42 7 10 8 16 9 6 10 25 11 42 12 8 13 36 14 8 15 17 16 3 17 6 18 21 19 23 20 31 21 42 22 6 23 32 24 7 25 27 26 34 27 31 28 6 29 41 30 20 31 9 32 7 33 3 34 5 35 5 36 1 37 8 38 14 39 15 40 12 41 22 95 1 94 2 88 3 13 4 71 5 37 6 45 7 87 8 24 9 76 10 54 11 69 12 95 13 90...
output:
WA
result:
wrong answer Wrong Answer
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:
100%
Accepted
Dependency #2:
0%