oj.uz

Submission #553959

# Submission time Handle Problem Language Result Execution time Memory
553959 2022-04-27T12:16:54 Z AA_Surely Watching (JOI13_watching) C++17
50 / 100
 1000 ms 15932 KB 
#include <bits/stdc++.h>

#define FOR(i,x,n) 	for(int i=x; i<n; i++)
#define F0R(i,n) 	FOR(i,0,n)
#define ROF(i,x,n) 	for(int i=n-1; i>=x; i--)
#define R0F(i,n) 	ROF(i,0,n)

#define WTF 		cout << "WTF" << endl

#define IOS 		ios::sync_with_stdio(false); cin.tie(0)
#define F 			first
#define S	 		second
#define pb 			push_back

#define ALL(x) 		x.begin(), x.end()
#define RALL(x) 	x.rbegin(), x.rend()

using namespace std;
typedef long long 		LL;

typedef pair<int, int> 	PII;
typedef pair<LL, LL> 	PLL;

typedef vector<int> 	VI;
typedef vector<LL> 		VLL;
typedef vector<PII> 	VPII;
typedef vector<PLL> 	VPLL;

const int N = 2000 + 7;
const int ALPHA = 27;
const int INF = 1e9 + 7;
const int MOD = 1e9 + 7;
const int LOG = 22;

int n, s, b;
int ns[N], dp[N][N];
// dp[i][j] = until i'th place, having j small cameras.

inline bool check(int w) {
    FOR(i, 1, n + 1) F0R(j, n + 1) {
        int pl = lower_bound(ns + 1, ns + n + 1, ns[i] - 2 * w + 1) - ns;
        //cout << "when updating " << i << ' ' << j << " using " << pl - 1 << ' ' << j << endl;

        dp[i][j] = dp[pl - 1][j] + 1;
        if (j) {
            pl = lower_bound(ns + 1, ns + n + 1, ns[i] - w + 1) - ns;
            dp[i][j] = min(dp[i][j], dp[pl - 1][j - 1]);
            //cout << "but when updating " << i << ' ' << j << " using " << pl - 1 << ' ' << j - 1 << endl;
        }
    }
    
    //cout << "check(" << w << ") = " << dp[n][min(n, s)] << endl;
    //FOR(i, 1, n + 1) F0R(j, n + 1) cout << dp[i][j] << " \n"[j == n];
    
    return (dp[n][min(n, s)] <= b);
}

int main() {
    IOS;
    
    cin >> n >> s >> b;
    FOR(i, 1, n + 1) cin >> ns[i];
    ns[0] = -INF;

    sort(ns + 1, ns + n + 1);
    int l = 1, r = INF;

    while(l < r) {
        int mid = (l + r) >> 1;
        if (check(mid)) r = mid;
        else l = mid + 1;
    }

    cout << l;
}

Subtask #1
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 768 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 6 ms 788 KB Output is correct
5 Correct 6 ms 792 KB Output is correct
6 Correct 6 ms 712 KB Output is correct
7 Correct 5 ms 716 KB Output is correct
8 Correct 7 ms 792 KB Output is correct
9 Correct 7 ms 852 KB Output is correct
10 Correct 6 ms 716 KB Output is correct
11 Correct 7 ms 724 KB Output is correct
12 Correct 7 ms 712 KB Output is correct
13 Correct 6 ms 724 KB Output is correct
14 Correct 6 ms 716 KB Output is correct
15 Correct 7 ms 716 KB Output is correct

Subtask #2
0 / 50.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1093 ms 15932 KB Time limit exceeded
2 Halted 0 ms 0 KB -