QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #87290 | #1212. Navigation | pengyule | 0 | 22ms | 11120kb | C++14 | 680b | 2023-03-12 12:01:07 | 2023-03-12 12:01:09 |
Judging History
Anna
#include <bits/stdc++.h>
#include "Annalib.h"
using namespace std;
const int N=1e5+5;
int u[N],v[N],dep[N],col[N];
vector<int>G[N];
void dfs(int x,int p){
dep[x]=dep[p]+1;
for(int y:G[x])if(y^p){
col[y]=col[x]^(x<y);
dfs(y,x);
}
}
void Anna(int tid,int n,int T,int u[],int v[]){
for(int i=1;i<n;i++){
G[u[i]].emplace_back(v[i]),G[v[i]].emplace_back(u[i]);
}
col[T]=0;
dfs(T,0);
for(int i=1;i<=n;i++)Flag(i,col[i]+1);
}
Bruno
#include <bits/stdc++.h>
#include "Brunolib.h"
using namespace std;
void Bruno(int tid,int S,int flag,int L,int P[],int Q[]){
for(int i=0;i<L;i++){
if((S<P[i])^(flag-1)^(Q[i]-1)){Answer(P[i]);return;}
}
Answer(S);
}
Details
Tip: Click on the bar to expand more detailed information
Subtask #1:
score: 0
Wrong Answer
Test #1:
score: 0
Wrong Answer
time: 22ms
memory: 11048kb
input:
100000 94560 16294 1 91913 94560 94560 69503 94560 39684 47595 94560 94560 96623 8011 94560 94560 15498 94560 92403 94560 84183 94560 44035 39994 94560 82975 94560 94560 30698 94560 17596 93175 94560 12253 94560 94560 60807 94560 16111 35848 94560 94560 19061 94560 25435 64721 94560 94560 79086 9548...
output:
1 94560 2 99999 91913 69503 39684 47595 96623 8011 15498 92403 84183 44035 39994 82975 30698 17596 93175 12253 60807 16111 35848 19061 25435 64721 79086 95487 98059 93865 84074 47584 77418 15271 82666 57858 21726 62847 90603 40247 64714 59668 13698 15586 58276 57618 20231 16177 77966 44363 69669 679...
input:
1 94560 2 99999 91913 69503 39684 47595 96623 8011 15498 92403 84183 44035 39994 82975 30698 17596 93175 12253 60807 16111 35848 19061 25435 64721 79086 95487 98059 93865 84074 47584 77418 15271 82666 57858 21726 62847 90603 40247 64714 59668 13698 15586 58276 57618 20231 16177 77966 44363 69669 679...
output:
91913
result:
wrong answer Wrong Answer [9]
Subtask #2:
score: 0
Wrong Answer
Test #26:
score: 0
Wrong Answer
time: 22ms
memory: 11120kb
input:
100000 57165 10261 2 57165 48992 57165 19387 71033 57165 13350 57165 52013 57165 39911 57165 31569 57165 57165 57655 47865 57165 57165 61895 79639 57165 35978 57165 47454 57165 76859 57165 57165 45447 31140 57165 57165 67169 57165 95791 57165 60405 57165 80905 57165 55354 57165 95642 8667 57165 8827...
output:
2 57165 2 99999 48992 19387 71033 13350 52013 39911 31569 57655 47865 61895 79639 35978 47454 76859 45447 31140 67169 95791 60405 80905 55354 95642 8667 88274 721 61541 31467 62158 93646 5791 37673 90967 70822 50373 6922 9211 12493 55791 99612 86337 52418 27225 13284 54010 57405 99213 36389 5528 532...
input:
2 57165 2 99999 48992 19387 71033 13350 52013 39911 31569 57655 47865 61895 79639 35978 47454 76859 45447 31140 67169 95791 60405 80905 55354 95642 8667 88274 721 61541 31467 62158 93646 5791 37673 90967 70822 50373 6922 9211 12493 55791 99612 86337 52418 27225 13284 54010 57405 99213 36389 5528 532...
output:
48992
result:
wrong answer Wrong Answer [9]
Subtask #3:
score: 0
Wrong Answer
Test #53:
score: 0
Wrong Answer
time: 4ms
memory: 9820kb
input:
5 4 1 3 2 4 3 4 5 4 4 1
output:
3 4 2 4 2 3 5 1 1 2 1 1
input:
3 4 2 4 2 3 5 1 1 2 1 1
output:
2
result:
wrong answer Wrong Answer [9]
Subtask #4:
score: 0
Wrong Answer
Test #85:
score: 0
Wrong Answer
time: 0ms
memory: 10564kb
input:
5 5 4 4 5 1 5 4 5 3 2 5
output:
4 5 2 4 1 4 3 2 1 1 2 2
input:
4 5 2 4 1 4 3 2 1 1 2 2
output:
1
result:
wrong answer Wrong Answer [9]