제출 #602526

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
602526		cheissmart	Shortcut (IOI16_shortcut)	C++14	0 / 100	1 ms	340 KiB

shortcut

// 花啊啊啊啊啊啊啊啊啊啊啊啊
#include "shortcut.h"
#pragma GCC optimize("O3", "no-stack-protector")
#include <bits/stdc++.h>
#define IO_OP std::ios::sync_with_stdio(0); std::cin.tie(0);
#define F first
#define S second
#define V vector
#define PB push_back
#define EB emplace_back
#define MP make_pair
#define SZ(v) int((v).size())
#define ALL(v) (v).begin(), (v).end()
 
using namespace std;
 
typedef long long ll;
typedef pair<int, int> pi;
typedef V<int> vi;
 
const int INF = 1e9 + 7, N = 1e6 + 7;
const ll oo = 1e18;

void cmax(ll& a, ll b) {
    a = max(a, b);
}
void cmin(ll& a, ll b) {
    a = min(a, b);
}

int pa[N], pb[N], aux[N];
ll a[N], b[N], pos[N];

ll find_shortcut(int n, vi l, vi d, int c) {
    assert(SZ(l) == n - 1);
    assert(SZ(d) == n);
    for(int i = 1; i < n; i++)
        pos[i] = l[i - 1] + pos[i - 1];
 
    for(int i = 0; i < n; i++)
        a[i] = pos[i] + d[i];
    for(int i = 0; i < n; i++)
        b[i] = pos[i] - d[i];
 
    iota(pa, pa + n, 0);
    iota(pb, pb + n, 0);
    sort(pa, pa + n, [&] (int x, int y) {
        return a[x] < a[y];
    });
    sort(pb, pb + n, [&] (int x, int y) {
        return b[x] < b[y];
    });

    auto ok = [&] (ll k) {
        ll lb_sum = -oo, rb_sum = oo;
        ll lb_dif = -oo, rb_dif = oo;
        for(int i = 0; i < n; i++) {
            for(int j = 0; j < n; j++) {
                if(a[j] - b[i] > k) {
                    cmax(lb_sum, a[i] + a[j] + c - k);
                    cmin(rb_sum, b[i] + b[j] + k - c);
                    cmax(lb_dif, a[i] - b[j] - k + c);
                    cmin(rb_dif, b[i] - a[j] + k - c);
                }
            }
        }        
        if(lb_sum > rb_sum) return false;
        if(lb_dif > rb_dif) return false;
        for(int i = 0; i < n - 1; i++) {
            ll lb = max(lb_sum - pos[i], pos[i] - rb_dif), rb = min(rb_sum - pos[i], pos[i] - lb_dif);
            if(lb <= rb) {
                int j = lower_bound(pos + i + 1, pos + n, lb) - pos;
                if(j < n && pos[j] <= rb) {
                    // assert(lb_sum <= pos[i] + pos[j] && pos[i] + pos[j] <= rb_sum);
                    // assert(lb_dif <= pos[i] - pos[j] && pos[i] - pos[j] <= rb_dif);
                    return true;
                }
            }
        }
        return false;
    };
 
    ll lb = pos[n - 1] / 3, rb = 1e15;
    while(lb <= rb) {
        ll mb = (lb + rb) / 2;
        if(ok(mb)) rb = mb - 1;
        else lb = mb + 1;
    }
    return lb;
}

• Subtask 1: 0 / 9
• Subtask 2: 0 / 14
• Subtask 3: 0 / 8
• Subtask 4: 0 / 7
• Subtask 5: 0 / 33
• Subtask 6: 0 / 22
• Subtask 7: 0 / 4
• Subtask 8: 0 / 3