oj.uz

Submission #969700

# Submission time Handle Problem Language Result Execution time Memory
969700 2024-04-25T13:25:25 Z penguin133 Park (JOI17_park) C++17
20 / 100
 451 ms 1112 KB 
#include <bits/stdc++.h>
using namespace std;
#include "park.h"
//#define int long long
#define pi pair<int, int>
#define pii pair<int, pi>
#define fi first
#define se second
#ifdef _WIN32
#define getchar_unlocked _getchar_nolock
#endif
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

static int Place[1400], p2[1400];

void dnc(vector <int> shit){
	if(shit.size() <= 1)return;
	vector <int> nxtstuff, die[7];
	int bru = shit[rng()%shit.size()];
	for(int i = 0; i < (int)shit.size(); i++){
		if(shit[i] == bru)continue;
		Place[bru] = Place[shit[i]] = 1;
		int a = bru, b = shit[i];
		if(a > b)swap(a, b);
		if(Ask(a, b, Place)){
			nxtstuff.push_back(shit[i]);
			Answer(a, b);
		}
		Place[bru] = Place[shit[i]] = 0;
	}
	for(int i = 0; i < 1400; i++)p2[i] = 0;
	for(auto i : shit)p2[i] = 1;
	for(auto i : shit){
		if(i == bru)continue;
		bool f = 0;
		for(auto j : nxtstuff)if(i == j)f = 1;
		if(f)continue;
		int lo = 0, hi = (int)nxtstuff.size() - 1, tmp = (int)nxtstuff.size();
		while(lo <= hi){
			int mid = (lo + hi) >> 1;
			for(int k = mid + 1; k < (int)nxtstuff.size(); k++)p2[nxtstuff[k]] = 0;
			int a = bru, b = i;
			if(a > b)swap(a, b);
			int res = Ask(a, b, p2);
			for(auto k : nxtstuff)p2[k] = 1;
			if(res){
				tmp = mid;
				hi = mid - 1;
			}
			else lo = mid + 1;
		}
		die[tmp].push_back(i);
	}
	for(int i = 0; i < (int)nxtstuff.size(); i++){
		die[i].push_back(nxtstuff[i]);
		dnc(die[i]);
	}
}

void Detect(int T, int N) {
	if(T == 1){
		for(int i = 0; i < N; i++){
			for(int j = i + 1; j < N; j++){
				Place[i] = Place[j] = 1;
				if(Ask(i, j, Place))Answer(i, j);
				Place[i] = Place[j] = 0;
			}
		}
		return;
	}
	vector <int> lol;
	for(int i = 0; i < N; i++)lol.push_back(i);
	shuffle(lol.begin(), lol.end(), rng);
	dnc(lol);
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 3 ms 348 KB Output is correct
3 Correct 4 ms 348 KB Output is correct
4 Correct 4 ms 472 KB Output is correct
5 Correct 4 ms 348 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 59 ms 604 KB Output is correct
2 Correct 60 ms 624 KB Output is correct
3 Correct 52 ms 600 KB Output is correct
4 Correct 104 ms 616 KB Output is correct
5 Correct 79 ms 1112 KB Output is correct

Subtask #3
0 / 27.0

# Verdict Execution time Memory Grader output
1 Incorrect 192 ms 628 KB Wrong Answer[5]
2 Halted 0 ms 0 KB -

Subtask #4
0 / 30.0

# Verdict Execution time Memory Grader output
1 Incorrect 161 ms 596 KB Wrong Answer[5]
2 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Incorrect 451 ms 888 KB Wrong Answer[5]
2 Halted 0 ms 0 KB -