oj.uz

답안 #771462

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
771462 2023-07-03T03:41:25 Z horiiseun 구경하기 (JOI13_watching) C++17
100 / 100
 341 ms 31852 KB 
#include <iostream>
#include <vector>
#include <tuple>
#include <queue>
#include <stack>
#include <deque>
#include <set>
#include <map>
#include <cmath>
#include <random>
#include <string>
#include <cassert>
#include <climits>
#include <algorithm>
#include <unordered_set>
#include <unordered_map>
using namespace std;

#define ll long long
#define f first
#define s second

void __print(int x) { cerr << x; }
void __print(long x) { cerr << x; }
void __print(long long x) { cerr << x; }
void __print(unsigned x) { cerr << x; }
void __print(unsigned long x) { cerr << x; }
void __print(unsigned long long x) { cerr << x; }
void __print(float x) { cerr << x; }
void __print(double x) { cerr << x; }
void __print(long double x) { cerr << x; }
void __print(char x) { cerr << '\'' << x << '\''; }
void __print(const char *x) { cerr << '\"' << x << '\"'; }
void __print(const string &x) { cerr << '\"' << x << '\"'; }
void __print(bool x) { cerr << (x ? "true" : "false"); }

template<typename A> void __print(const A &x);
template<typename A, typename B> void __print(const pair<A, B> &p);
template<typename... A> void __print(const tuple<A...> &t);
template<typename T> void __print(stack<T> s);
template<typename T> void __print(queue<T> q);
template<typename T, typename... U> void __print(priority_queue<T, U...> q);

template<typename A> void __print(const A &x) {
    bool first = true;
    cerr << '{';
    for (const auto &i : x) {
        cerr << (first ? "" : ","), __print(i);
        first = false;
    }
    cerr << '}';
}

template<typename A, typename B> void __print(const pair<A, B> &p) {
    cerr << '(';
    __print(p.f);
    cerr << ',';
    __print(p.s);
    cerr << ')';
}

template<typename... A> void __print(const tuple<A...> &t) {
    bool first = true;
    cerr << '(';
    apply([&first] (const auto &...args) { ((cerr << (first ? "" : ","), __print(args), first = false), ...); }, t);
    cerr << ')';
}

template<typename T> void __print(stack<T> s) {
    vector<T> debugVector;
    while (!s.empty()) {
        T t = s.top();
        debugVector.push_back(t);
        s.pop();
    }
    reverse(debugVector.begin(), debugVector.end());
    __print(debugVector);
}

template<typename T> void __print(queue<T> q) {
    vector<T> debugVector;
    while (!q.empty()) {
        T t = q.front();
        debugVector.push_back(t);
        q.pop();
    }
    __print(debugVector);
}

template<typename T, typename... U> void __print(priority_queue<T, U...> q) {
    vector<T> debugVector;
    while (!q.empty()) {
        T t = q.top();
        debugVector.push_back(t);
        q.pop();
    }
    __print(debugVector);
}

void _print() { cerr << "]\n"; }

template <typename Head, typename... Tail> void _print(const Head &H, const Tail &...T) {
    __print(H);
    if (sizeof...(T)) cerr << ", ";
    _print(T...);
}

#ifdef DEBUG
	#define D(...) cerr << "Line: " << __LINE__ << " [" << #__VA_ARGS__ << "] = ["; _print(__VA_ARGS__)
#else
	#define D(...)
#endif

int n, p, q, pos[2005][2];
ll l, r, dp[2005][2005];
vector<ll> a;

bool valid(ll x) {
	for (int j = 0, idx; j < 2; j++) {
		idx = 1;
		for (int i = 1; i <= n; i++) {
			while (a[idx] + (ll) (j + 1) * x - 1 < a[i]) {
				idx++;
			}
			pos[i][j] = idx;
		}
	}
	fill(&dp[0][0], &dp[0][0] + sizeof(dp) / sizeof(dp[0][0]), 1e12);
	dp[0][0] = 0;
	for (int i = 1; i <= n; i++) {
		for (int j = 0; j <= q; j++) {
			if (j) {
				dp[i][j] = min(dp[i][j], dp[pos[i][1] - 1][j - 1]);
			}
			dp[i][j] = min(dp[i][j], dp[pos[i][0] - 1][j] + 1);
		}
	}
	ll mn = 1e12;
	for (int i = 0; i <= q; i++) {
		mn = min(mn, dp[n][i]);
	}
	return mn <= p;
}

int main() {

	ios_base::sync_with_stdio(false);
	cin.tie(0);

	cin >> n >> p >> q;
	a.push_back(0);
	for (int i = 0, x; i < n; i++) {
		cin >> x;
		a.push_back(x);
	}
	sort(a.begin(), a.end());

	if (max(p, q) >= n) {
		cout << 1 << "\n";
		exit(0);
	}

	l = 0, r = 1e9;
	while (l + 1 != r) {
		ll m = (l + r) / 2;
		if (valid(m)) r = m;
		else l = m;
	}

	cout << r << "\n";

}

Subtask #1
50.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 99 ms 31784 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 97 ms 31764 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 100 ms 31788 KB Output is correct
8 Correct 93 ms 31780 KB Output is correct
9 Correct 96 ms 31700 KB Output is correct
10 Correct 94 ms 31780 KB Output is correct
11 Correct 97 ms 31788 KB Output is correct
12 Correct 102 ms 31700 KB Output is correct
13 Correct 101 ms 31700 KB Output is correct
14 Correct 96 ms 31700 KB Output is correct
15 Correct 97 ms 31796 KB Output is correct

Subtask #2
50.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 102 ms 31828 KB Output is correct
2 Correct 95 ms 31780 KB Output is correct
3 Correct 281 ms 31844 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 104 ms 31828 KB Output is correct
8 Correct 196 ms 31836 KB Output is correct
9 Correct 119 ms 31840 KB Output is correct
10 Correct 123 ms 31828 KB Output is correct
11 Correct 341 ms 31844 KB Output is correct
12 Correct 227 ms 31836 KB Output is correct
13 Correct 103 ms 31836 KB Output is correct
14 Correct 102 ms 31828 KB Output is correct
15 Correct 106 ms 31852 KB Output is correct