oj.uz

Submission #1072551

# Submission time Handle Problem Language Result Execution time Memory
1072551 2024-08-23T21:51:12 Z AdamGS Park (JOI17_park) C++17
67 / 100
 78 ms 1880 KB 
#include "park.h"
#include<bits/stdc++.h>
using namespace std;
#define rep(a, b) for(int a = 0; a < (b); ++a)
#define st first
#define nd second
#define pb push_back
#define all(a) a.begin(), a.end()
const int LIM=1407;
static int Place[1400];
vector<int>V[LIM], pos;
int odw[LIM], n, ile;
void DFS(int x, int o) {
	for(auto i : V[x]) if(i!=o) DFS(i, x);
	pos.pb(x);
}
int znajdz_ojca(int x) {
	pos.clear();
	DFS(0, 0);
	reverse(all(pos));
	int po=0, ko=(int)pos.size()-1;
	while(po<ko) {
		int sr=(po+ko)/2;
		rep(i, n) Place[i]=0;
		rep(i, sr+1) Place[pos[i]]=1;
		rep(i, n) if(!odw[i]) Place[i]=1;
		if(Ask(0, x, Place)) ko=sr; else po=sr+1;
	}
	return pos[po];
}
void sciezka(int a, int b) {
	rep(i, n) Place[i]=0;
	Place[a]=Place[b]=1;
	if(Ask(min(a, b), max(a, b), Place)) {
		odw[b]=1; ++ile;
		V[a].pb(b);
		V[b].pb(a);
		Answer(min(a, b), max(a, b));
		return;
	}
	vector<int>T;
	rep(i, n) if(!odw[i] && i!=b) T.pb(i);
	int po=0, ko=(int)T.size()-1;
	while(po<ko) {
		int sr=(po+ko)/2;
		rep(i, n) Place[i]=0;
		rep(i, sr+1) Place[T[i]]=1;
		Place[a]=Place[b]=1;
		if(Ask(min(a, b), max(a, b), Place)) ko=sr; else po=sr+1;
	}
	sciezka(a, T[po]);
	sciezka(T[po], b);
}
void Detect(int T, int N) {
	n=N;
	odw[0]=ile=1;
	while(ile<n) {
		int x=-1;
		rep(i, n) if(!odw[i]) {
			x=i;
			break;
		}
		int p=znajdz_ojca(x);
		sciezka(p, x);
	}
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Wrong Answer[6]
2 Halted 0 ms 0 KB -

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 600 KB Output is correct
2 Correct 71 ms 648 KB Output is correct
3 Correct 58 ms 1880 KB Output is correct
4 Correct 24 ms 604 KB Output is correct
5 Correct 24 ms 604 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 78 ms 604 KB Output is correct
2 Correct 64 ms 600 KB Output is correct
3 Correct 62 ms 604 KB Output is correct
4 Correct 63 ms 604 KB Output is correct
5 Correct 59 ms 604 KB Output is correct
6 Correct 64 ms 604 KB Output is correct
7 Correct 67 ms 600 KB Output is correct
8 Correct 62 ms 600 KB Output is correct

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 348 KB Output is correct
2 Correct 69 ms 600 KB Output is correct
3 Correct 57 ms 636 KB Output is correct
4 Correct 52 ms 604 KB Output is correct
5 Correct 48 ms 600 KB Output is correct
6 Correct 50 ms 604 KB Output is correct
7 Correct 47 ms 604 KB Output is correct
8 Correct 56 ms 604 KB Output is correct
9 Correct 57 ms 604 KB Output is correct
10 Correct 54 ms 604 KB Output is correct
11 Correct 57 ms 764 KB Output is correct
12 Correct 63 ms 600 KB Output is correct
13 Correct 37 ms 600 KB Output is correct
14 Correct 66 ms 604 KB Output is correct
15 Correct 37 ms 604 KB Output is correct
16 Correct 63 ms 604 KB Output is correct
17 Correct 25 ms 600 KB Output is correct
18 Correct 60 ms 604 KB Output is correct
19 Correct 35 ms 600 KB Output is correct
20 Correct 55 ms 604 KB Output is correct

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Incorrect 60 ms 604 KB Wrong Answer[6]
2 Halted 0 ms 0 KB -