oj.uz

Submission #821609

# Submission time Handle Problem Language Result Execution time Memory
821609 2023-08-11T12:03:59 Z AdamGS Park (JOI17_park) C++17
77 / 100
 78 ms 1876 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) {
	if(N<=250) {
		rep(i, N) Place[i]=0;
		rep(i, N) rep(j, i) {
			Place[j]=Place[i]=1;
			if(Ask(j, i, Place)) Answer(j, i);
			Place[j]=Place[i]=0;
		}
		return;
	}
	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
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 4 ms 340 KB Output is correct
3 Correct 6 ms 500 KB Output is correct
4 Correct 4 ms 340 KB Output is correct
5 Correct 3 ms 340 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 600 KB Output is correct
2 Correct 72 ms 468 KB Output is correct
3 Correct 58 ms 1876 KB Output is correct
4 Correct 20 ms 596 KB Output is correct
5 Correct 19 ms 676 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 63 ms 468 KB Output is correct
2 Correct 69 ms 468 KB Output is correct
3 Correct 64 ms 468 KB Output is correct
4 Correct 77 ms 468 KB Output is correct
5 Correct 60 ms 480 KB Output is correct
6 Correct 62 ms 472 KB Output is correct
7 Correct 71 ms 472 KB Output is correct
8 Correct 63 ms 464 KB Output is correct

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 340 KB Output is correct
2 Correct 61 ms 468 KB Output is correct
3 Correct 59 ms 468 KB Output is correct
4 Correct 49 ms 528 KB Output is correct
5 Correct 46 ms 584 KB Output is correct
6 Correct 47 ms 596 KB Output is correct
7 Correct 44 ms 596 KB Output is correct
8 Correct 56 ms 528 KB Output is correct
9 Correct 56 ms 520 KB Output is correct
10 Correct 52 ms 596 KB Output is correct
11 Correct 54 ms 608 KB Output is correct
12 Correct 61 ms 572 KB Output is correct
13 Correct 34 ms 564 KB Output is correct
14 Correct 71 ms 624 KB Output is correct
15 Correct 33 ms 596 KB Output is correct
16 Correct 64 ms 468 KB Output is correct
17 Correct 19 ms 644 KB Output is correct
18 Correct 61 ms 576 KB Output is correct
19 Correct 31 ms 596 KB Output is correct
20 Correct 51 ms 468 KB Output is correct

Subtask #5
0 / 23.0

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