oj.uz

Submission #168784

# Submission time Handle Problem Language Result Execution time Memory
168784 2019-12-16T09:56:31 Z popovicirobert Shortcut (IOI16_shortcut) C++14
0 / 100
 2 ms 380 KB 
#include "shortcut.h"
#include <bits/stdc++.h>
#define ll long long

using namespace std;

vector <int> dif_ord, sum_ord;
vector <ll> x, d;

inline bool check(ll k, int n, int c) {
    vector <int> sgn = {1, -1};
    int pos[2][2][2][2];
    ll vals[2][2][2][2];

    memset(pos, 0, sizeof(pos));
    for(int conf = 0; conf < 8; conf++) {
        vals[conf >> 2][(conf >> 1) & 1][0][conf & 1] = -2e9 - 5;
        vals[conf >> 2][(conf >> 1) & 1][1][conf & 1] = 2e9 + 5;
    }

    auto upd = [&](int p, int conf) {
        int a = (conf >> 2), b = (conf >> 1) % 2, c = conf % 2;
        int v = x[p] * sgn[a] + d[p] * sgn[b];
        if(c == 0) { // mx
            if(vals[a][b][c][0] < v) {
                pos[a][b][c][1] = pos[a][b][c][0];
                vals[a][b][c][1] = vals[a][b][c][0];
                pos[a][b][c][0] = p;
                vals[a][b][c][0] = v;
            }
            else if(vals[a][b][c][1] < v) {
                pos[a][b][c][1] = p;
                vals[a][b][c][1] = v;
            }
        }
        else { // mn
            if(vals[a][b][c][0] > v) {
                pos[a][b][c][1] = pos[a][b][c][0];
                vals[a][b][c][1] = vals[a][b][c][0];
                pos[a][b][c][0] = p;
                vals[a][b][c][0] = v;
            }
            else if(vals[a][b][c][1] > v) {
                pos[a][b][c][1] = p;
                vals[a][b][c][1] = v;
            }
        }
    };

    int i = 0;
    ll A = -1e18, B = 1e18, a = -1e18, b = 1e18;

    auto get = [&](int a, int b, int c, int p) {
        if(pos[a][b][c][0] == p) {
            return vals[a][b][c][1];
        }
        return vals[a][b][c][0];
    };

    for(auto j : sum_ord) {
        while(i < n && x[dif_ord[i]] - d[dif_ord[i]] < x[j] + d[j] - k) {
            for(int conf = 0; conf < 8; conf++) {
                upd(dif_ord[i], conf);
            }
            i++;
        }
        B = min(B, (k - c) + x[j] - d[j] + get(0, 1, 1, j));
        A = max(A, x[j] + d[j] - (k - c) + get(0, 0, 0, j));
        b = min(b, (k - c) + x[j] - d[j] - get(0, 0, 0, j));
        a = max(a, x[j] + d[j] - (k - c) - get(0, 1, 1, j));
    }

    //cerr << k << " " << a << " " << b << " " << A << " " << B << "\n";

    // A <= y + z <= B
    // a <= z - y <= b   =>  y + a <= z <= y + b
    // 2 * y + a <= B
    // 2 * y + b >= A
    // (A - b) / 2 <= y <= (B - a) / 2

    A = max(A, 0LL);
    a = max(a, 0LL);

    ll C = max(0LL, A - b), D = B - a;

    if(A <= B && a <= b && C <= D && (C != D || C % 2 == 0)) {
        return 1;
    }
    return 0;
}

long long find_shortcut(int n, vector<int> l, vector<int> D, int c) {

    x.resize(n + 1), d.resize(n + 1);

    int i;
    for(i = 2; i <= n; i++) {
        x[i] = x[i - 1] + l[i - 2];
    }
    for(i = n; i >= 1; i--) {
        d[i] = D[i - 1];
    }

    dif_ord.resize(n), sum_ord.resize(n);
    iota(dif_ord.begin(), dif_ord.end(), 1);
    iota(sum_ord.begin(), sum_ord.end(), 1);

    sort(dif_ord.begin(), dif_ord.end(), [&](const int &a, const int &b) {
                return x[a] - d[a] < x[b] - d[b];
         });
    sort(sum_ord.begin(), sum_ord.end(), [&](const int &a, const int &b) {
                return x[a] + d[a] < x[b] + d[b];
         });

    ll res = 0;
    for(ll step = 1LL << 50; step; step >>= 1) {
        if(check(res + step, n, c) == 0) {
            res += step;
        }
    }

    return res + 1;
}

Subtask #1
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB n = 4, 80 is a correct answer
2 Correct 2 ms 256 KB n = 9, 110 is a correct answer
3 Correct 2 ms 256 KB n = 4, 21 is a correct answer
4 Correct 2 ms 376 KB n = 3, 4 is a correct answer
5 Correct 2 ms 256 KB n = 2, 62 is a correct answer
6 Correct 2 ms 380 KB n = 2, 3 is a correct answer
7 Correct 2 ms 376 KB n = 3, 29 is a correct answer
8 Correct 2 ms 256 KB n = 2, 3 is a correct answer
9 Correct 2 ms 256 KB n = 2, 3 is a correct answer
10 Correct 2 ms 256 KB n = 2, 2000000001 is a correct answer
11 Correct 2 ms 256 KB n = 2, 3000000000 is a correct answer
12 Correct 2 ms 256 KB n = 3, 3000000000 is a correct answer
13 Correct 2 ms 256 KB n = 3, 3000000000 is a correct answer
14 Correct 2 ms 376 KB n = 4, 3000000001 is a correct answer
15 Correct 2 ms 256 KB n = 4, 4000000000 is a correct answer
16 Incorrect 2 ms 376 KB n = 5, incorrect answer: jury 4000000000 vs contestant 3500000001
17 Halted 0 ms 0 KB -

Subtask #2
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB n = 4, 80 is a correct answer
2 Correct 2 ms 256 KB n = 9, 110 is a correct answer
3 Correct 2 ms 256 KB n = 4, 21 is a correct answer
4 Correct 2 ms 376 KB n = 3, 4 is a correct answer
5 Correct 2 ms 256 KB n = 2, 62 is a correct answer
6 Correct 2 ms 380 KB n = 2, 3 is a correct answer
7 Correct 2 ms 376 KB n = 3, 29 is a correct answer
8 Correct 2 ms 256 KB n = 2, 3 is a correct answer
9 Correct 2 ms 256 KB n = 2, 3 is a correct answer
10 Correct 2 ms 256 KB n = 2, 2000000001 is a correct answer
11 Correct 2 ms 256 KB n = 2, 3000000000 is a correct answer
12 Correct 2 ms 256 KB n = 3, 3000000000 is a correct answer
13 Correct 2 ms 256 KB n = 3, 3000000000 is a correct answer
14 Correct 2 ms 376 KB n = 4, 3000000001 is a correct answer
15 Correct 2 ms 256 KB n = 4, 4000000000 is a correct answer
16 Incorrect 2 ms 376 KB n = 5, incorrect answer: jury 4000000000 vs contestant 3500000001
17 Halted 0 ms 0 KB -

Subtask #3
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB n = 4, 80 is a correct answer
2 Correct 2 ms 256 KB n = 9, 110 is a correct answer
3 Correct 2 ms 256 KB n = 4, 21 is a correct answer
4 Correct 2 ms 376 KB n = 3, 4 is a correct answer
5 Correct 2 ms 256 KB n = 2, 62 is a correct answer
6 Correct 2 ms 380 KB n = 2, 3 is a correct answer
7 Correct 2 ms 376 KB n = 3, 29 is a correct answer
8 Correct 2 ms 256 KB n = 2, 3 is a correct answer
9 Correct 2 ms 256 KB n = 2, 3 is a correct answer
10 Correct 2 ms 256 KB n = 2, 2000000001 is a correct answer
11 Correct 2 ms 256 KB n = 2, 3000000000 is a correct answer
12 Correct 2 ms 256 KB n = 3, 3000000000 is a correct answer
13 Correct 2 ms 256 KB n = 3, 3000000000 is a correct answer
14 Correct 2 ms 376 KB n = 4, 3000000001 is a correct answer
15 Correct 2 ms 256 KB n = 4, 4000000000 is a correct answer
16 Incorrect 2 ms 376 KB n = 5, incorrect answer: jury 4000000000 vs contestant 3500000001
17 Halted 0 ms 0 KB -

Subtask #4
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB n = 4, 80 is a correct answer
2 Correct 2 ms 256 KB n = 9, 110 is a correct answer
3 Correct 2 ms 256 KB n = 4, 21 is a correct answer
4 Correct 2 ms 376 KB n = 3, 4 is a correct answer
5 Correct 2 ms 256 KB n = 2, 62 is a correct answer
6 Correct 2 ms 380 KB n = 2, 3 is a correct answer
7 Correct 2 ms 376 KB n = 3, 29 is a correct answer
8 Correct 2 ms 256 KB n = 2, 3 is a correct answer
9 Correct 2 ms 256 KB n = 2, 3 is a correct answer
10 Correct 2 ms 256 KB n = 2, 2000000001 is a correct answer
11 Correct 2 ms 256 KB n = 2, 3000000000 is a correct answer
12 Correct 2 ms 256 KB n = 3, 3000000000 is a correct answer
13 Correct 2 ms 256 KB n = 3, 3000000000 is a correct answer
14 Correct 2 ms 376 KB n = 4, 3000000001 is a correct answer
15 Correct 2 ms 256 KB n = 4, 4000000000 is a correct answer
16 Incorrect 2 ms 376 KB n = 5, incorrect answer: jury 4000000000 vs contestant 3500000001
17 Halted 0 ms 0 KB -

Subtask #5
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB n = 4, 80 is a correct answer
2 Correct 2 ms 256 KB n = 9, 110 is a correct answer
3 Correct 2 ms 256 KB n = 4, 21 is a correct answer
4 Correct 2 ms 376 KB n = 3, 4 is a correct answer
5 Correct 2 ms 256 KB n = 2, 62 is a correct answer
6 Correct 2 ms 380 KB n = 2, 3 is a correct answer
7 Correct 2 ms 376 KB n = 3, 29 is a correct answer
8 Correct 2 ms 256 KB n = 2, 3 is a correct answer
9 Correct 2 ms 256 KB n = 2, 3 is a correct answer
10 Correct 2 ms 256 KB n = 2, 2000000001 is a correct answer
11 Correct 2 ms 256 KB n = 2, 3000000000 is a correct answer
12 Correct 2 ms 256 KB n = 3, 3000000000 is a correct answer
13 Correct 2 ms 256 KB n = 3, 3000000000 is a correct answer
14 Correct 2 ms 376 KB n = 4, 3000000001 is a correct answer
15 Correct 2 ms 256 KB n = 4, 4000000000 is a correct answer
16 Incorrect 2 ms 376 KB n = 5, incorrect answer: jury 4000000000 vs contestant 3500000001
17 Halted 0 ms 0 KB -

Subtask #6
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB n = 4, 80 is a correct answer
2 Correct 2 ms 256 KB n = 9, 110 is a correct answer
3 Correct 2 ms 256 KB n = 4, 21 is a correct answer
4 Correct 2 ms 376 KB n = 3, 4 is a correct answer
5 Correct 2 ms 256 KB n = 2, 62 is a correct answer
6 Correct 2 ms 380 KB n = 2, 3 is a correct answer
7 Correct 2 ms 376 KB n = 3, 29 is a correct answer
8 Correct 2 ms 256 KB n = 2, 3 is a correct answer
9 Correct 2 ms 256 KB n = 2, 3 is a correct answer
10 Correct 2 ms 256 KB n = 2, 2000000001 is a correct answer
11 Correct 2 ms 256 KB n = 2, 3000000000 is a correct answer
12 Correct 2 ms 256 KB n = 3, 3000000000 is a correct answer
13 Correct 2 ms 256 KB n = 3, 3000000000 is a correct answer
14 Correct 2 ms 376 KB n = 4, 3000000001 is a correct answer
15 Correct 2 ms 256 KB n = 4, 4000000000 is a correct answer
16 Incorrect 2 ms 376 KB n = 5, incorrect answer: jury 4000000000 vs contestant 3500000001
17 Halted 0 ms 0 KB -

Subtask #7
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB n = 4, 80 is a correct answer
2 Correct 2 ms 256 KB n = 9, 110 is a correct answer
3 Correct 2 ms 256 KB n = 4, 21 is a correct answer
4 Correct 2 ms 376 KB n = 3, 4 is a correct answer
5 Correct 2 ms 256 KB n = 2, 62 is a correct answer
6 Correct 2 ms 380 KB n = 2, 3 is a correct answer
7 Correct 2 ms 376 KB n = 3, 29 is a correct answer
8 Correct 2 ms 256 KB n = 2, 3 is a correct answer
9 Correct 2 ms 256 KB n = 2, 3 is a correct answer
10 Correct 2 ms 256 KB n = 2, 2000000001 is a correct answer
11 Correct 2 ms 256 KB n = 2, 3000000000 is a correct answer
12 Correct 2 ms 256 KB n = 3, 3000000000 is a correct answer
13 Correct 2 ms 256 KB n = 3, 3000000000 is a correct answer
14 Correct 2 ms 376 KB n = 4, 3000000001 is a correct answer
15 Correct 2 ms 256 KB n = 4, 4000000000 is a correct answer
16 Incorrect 2 ms 376 KB n = 5, incorrect answer: jury 4000000000 vs contestant 3500000001
17 Halted 0 ms 0 KB -

Subtask #8
0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB n = 4, 80 is a correct answer
2 Correct 2 ms 256 KB n = 9, 110 is a correct answer
3 Correct 2 ms 256 KB n = 4, 21 is a correct answer
4 Correct 2 ms 376 KB n = 3, 4 is a correct answer
5 Correct 2 ms 256 KB n = 2, 62 is a correct answer
6 Correct 2 ms 380 KB n = 2, 3 is a correct answer
7 Correct 2 ms 376 KB n = 3, 29 is a correct answer
8 Correct 2 ms 256 KB n = 2, 3 is a correct answer
9 Correct 2 ms 256 KB n = 2, 3 is a correct answer
10 Correct 2 ms 256 KB n = 2, 2000000001 is a correct answer
11 Correct 2 ms 256 KB n = 2, 3000000000 is a correct answer
12 Correct 2 ms 256 KB n = 3, 3000000000 is a correct answer
13 Correct 2 ms 256 KB n = 3, 3000000000 is a correct answer
14 Correct 2 ms 376 KB n = 4, 3000000001 is a correct answer
15 Correct 2 ms 256 KB n = 4, 4000000000 is a correct answer
16 Incorrect 2 ms 376 KB n = 5, incorrect answer: jury 4000000000 vs contestant 3500000001
17 Halted 0 ms 0 KB -