QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#86890#1212. NavigationIgnotus0 8ms9464kbC++14638b2023-03-11 14:22:542023-03-11 14:22:56

Judging History

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

  • [2023-08-10 23:21:45]
  • System Update: QOJ starts to keep a history of the judgings of all the submissions.
  • [2023-03-11 14:22:56]
  • 评测
  • 测评结果:0
  • 用时:8ms
  • 内存:9464kb
  • [2023-03-11 14:22:54]
  • 提交

Anna

#include <bits/stdc++.h>
#include "Annalib.h"

const int N = 1e5 + 10;

std::vector <int> G[N];

void dfs(int x, int fath, bool col){
	Flag(x, col);
	for(auto y : G[x]) if(y != fath) dfs(y, fath, col ^ (y > x));
}

void Anna(int _, int n, int T, int u[], int v[]){
	for(int i = 0; i < n; ++i) G[u[i]].push_back(v[i]), G[v[i]].push_back(u[i]);
	dfs(T, 0, 0);
}

Bruno

#include <bits/stdc++.h>
#include "Brunolib.h"

const int N = 1e5 + 10;

void Bruno(int _, int S, int sf, int cnt, int adj[], int fl[]){
	for(int i = 0; i < cnt; ++i) if((fl[i] == sf) == (S < adj[i])){
		Answer(adj[i]);
		return void();
	}
	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: 6ms
memory: 8612kb

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:

Wrong Answer [2]

input:

21950 1 0 2
0 0 
0 0 

output:

1

result:

wrong answer Wrong Answer [5]

Subtask #2:

score: 0
Wrong Answer

Test #26:

score: 0
Wrong Answer
time: 4ms
memory: 8460kb

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:

Wrong Answer [2]

input:

21877 1 0 2
0 0 
0 0 

output:

1

result:

wrong answer Wrong Answer [5]

Subtask #3:

score: 0
Wrong Answer

Test #53:

score: 0
Wrong Answer
time: 8ms
memory: 9464kb

input:

5 4 1 3
2 4
3 4
5 4
4 1

output:

Wrong Answer [2]

input:

21992 1 0 2
0 0 
0 0 

output:

1

result:

wrong answer Wrong Answer [5]

Subtask #4:

score: 0
Wrong Answer

Test #85:

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

input:

5 5 4 4
5 1
5 4
5 3
2 5

output:

Wrong Answer [2]

input:

22007 1 0 2
0 0 
0 0 

output:

1

result:

wrong answer Wrong Answer [5]