oj.uz

Submission #373351

# Submission time Handle Problem Language Result Execution time Memory
373351 2021-03-04T08:58:04 Z BartolM Watching (JOI13_watching) C++17
0 / 100
 130 ms 16256 KB 
#include <bits/stdc++.h>

using namespace std;

#define X first
#define Y second
#define mp make_pair
#define pb push_back
typedef long long ll;
typedef pair <int, int> pii;
typedef pair <int, pii> pip;
typedef pair <pii, int> ppi;
typedef pair <ll, ll> pll;

const int INF=0x3f3f3f3f;
const int N=2005;

int n, A, B;
int p[N];
int dp[N][N];
int nx_w[N], nx_2w[N];

int rek(int pos, int kol) {
    if (kol<0) return INF;
    if (pos==n) return 0;

    int &ret=dp[pos][kol];
    if (ret!=-1) return ret;
    ret=rek(nx_w[pos], kol-1);
    ret=min(ret, rek(nx_2w[pos], kol)+1);
    return ret;
}

int check(int w) {
    for (int i=0; i<n; ++i) {
        nx_w[i]=nx_2w[i]=i+1;
        for (int j=i+1; j<n; ++j) {
            if (p[j]-p[i]<w) nx_w[i]=j+1;
            if (p[j]-p[i]<2*w) nx_2w[i]=j+1;
        }
    }
    memset(dp, -1, sizeof dp);
    return rek(0, A)<=B;
}

void solve() {
    sort(p, p+n);
    int lo=0, hi=1e9, mid;
    while (lo<hi) {
        mid=(lo+hi)/2;
        if (check(mid)) hi=mid;
        else lo=mid+1;
    }
    printf("%d\n", lo);
}

void load() {
    scanf("%d %d %d", &n, &A, &B);
    A=min(A, n); B=min(B, n);
    for (int i=0; i<n; ++i) scanf("%d", p+i);
}

int main() {
    load();
    solve();
    return 0;
}

Compilation message

watching.cpp: In function 'void load()':
watching.cpp:58:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   58 |     scanf("%d %d %d", &n, &A, &B);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
watching.cpp:60:34: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   60 |     for (int i=0; i<n; ++i) scanf("%d", p+i);
      |                             ~~~~~^~~~~~~~~~~

Subtask #1
0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 66 ms 16108 KB Output is correct
2 Incorrect 67 ms 16108 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 130 ms 16108 KB Output is correct
2 Incorrect 65 ms 16256 KB Output isn't correct
3 Halted 0 ms 0 KB -