oj.uz

답안 #595341

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
595341 2022-07-13T16:12:35 Z Lucpp Shortcut (IOI16_shortcut) C++17
0 / 100
 1 ms 300 KB 
#include "shortcut.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1e18;

int n;
vector<ll> x;

bool solve(vector<tuple<ll, ll, ll>> sq){
    ll x1 = -INF, y1 = -INF, x2 = INF, y2 = INF;
    for(auto [xc, yc, r] : sq){
        x1 = max(x1, xc-r);
        x2 = min(x2, xc+r);
        y1 = max(y1, yc-r);
        y2 = min(y2, yc+r);
    }
    if(x1 > x2 || y1 > y2) return false;
    for(int i = 0; i < n; i++){
        for(int j = 0; j < n; j++){
            if(x[i]-x[j] >= x1-y2 && x[i]-x[j] <= x2-y1 && x[i]+x[j] <= x2+y2 && x[i]+x[j] >= x1+y1){
                return true;
            }
        }
    }
    return false;
}

ll find_shortcut(int n_, vector<int> len, vector<int> d, int c) {
    n = n_;
    x.resize(n);
    x[0] = 0;
    for(int i = 0; i < n-1; i++) x[i+1] = x[i]+len[i];
    ll M = x.back()+*max_element(d.begin(), d.end())*2;
    ll lo = 0, hi = M;
    for(ll mid=(lo+hi)/2; lo<hi; mid=(lo+hi)/2){
        vector<tuple<ll, ll, ll>> sq;
        for(int i = 0; i < n; i++){
            for(int j = i+1; j < n; j++){
                if(abs(x[i]-x[j])+d[i]+d[j] <= mid) continue;
                sq.emplace_back(x[i], x[j], mid-c-d[i]-d[j]);
            }
        }
        if(solve(sq)) hi = mid;
        else lo = mid+1;
    }
    return lo;
}

Subtask #1
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB n = 4, 80 is a correct answer
2 Correct 1 ms 212 KB n = 9, 110 is a correct answer
3 Correct 0 ms 212 KB n = 4, 21 is a correct answer
4 Correct 1 ms 296 KB n = 3, 4 is a correct answer
5 Correct 1 ms 212 KB n = 2, 62 is a correct answer
6 Correct 1 ms 212 KB n = 2, 3 is a correct answer
7 Correct 0 ms 212 KB n = 3, 29 is a correct answer
8 Correct 0 ms 212 KB n = 2, 3 is a correct answer
9 Correct 1 ms 292 KB n = 2, 3 is a correct answer
10 Correct 0 ms 212 KB n = 2, 2000000001 is a correct answer
11 Correct 1 ms 212 KB n = 2, 3000000000 is a correct answer
12 Correct 1 ms 212 KB n = 3, 3000000000 is a correct answer
13 Correct 0 ms 212 KB n = 3, 3000000000 is a correct answer
14 Correct 1 ms 300 KB n = 4, 3000000001 is a correct answer
15 Correct 0 ms 296 KB n = 4, 4000000000 is a correct answer
16 Incorrect 0 ms 212 KB n = 5, incorrect answer: jury 4000000000 vs contestant 3000000001
17 Halted 0 ms 0 KB -

Subtask #2
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB n = 4, 80 is a correct answer
2 Correct 1 ms 212 KB n = 9, 110 is a correct answer
3 Correct 0 ms 212 KB n = 4, 21 is a correct answer
4 Correct 1 ms 296 KB n = 3, 4 is a correct answer
5 Correct 1 ms 212 KB n = 2, 62 is a correct answer
6 Correct 1 ms 212 KB n = 2, 3 is a correct answer
7 Correct 0 ms 212 KB n = 3, 29 is a correct answer
8 Correct 0 ms 212 KB n = 2, 3 is a correct answer
9 Correct 1 ms 292 KB n = 2, 3 is a correct answer
10 Correct 0 ms 212 KB n = 2, 2000000001 is a correct answer
11 Correct 1 ms 212 KB n = 2, 3000000000 is a correct answer
12 Correct 1 ms 212 KB n = 3, 3000000000 is a correct answer
13 Correct 0 ms 212 KB n = 3, 3000000000 is a correct answer
14 Correct 1 ms 300 KB n = 4, 3000000001 is a correct answer
15 Correct 0 ms 296 KB n = 4, 4000000000 is a correct answer
16 Incorrect 0 ms 212 KB n = 5, incorrect answer: jury 4000000000 vs contestant 3000000001
17 Halted 0 ms 0 KB -

Subtask #3
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB n = 4, 80 is a correct answer
2 Correct 1 ms 212 KB n = 9, 110 is a correct answer
3 Correct 0 ms 212 KB n = 4, 21 is a correct answer
4 Correct 1 ms 296 KB n = 3, 4 is a correct answer
5 Correct 1 ms 212 KB n = 2, 62 is a correct answer
6 Correct 1 ms 212 KB n = 2, 3 is a correct answer
7 Correct 0 ms 212 KB n = 3, 29 is a correct answer
8 Correct 0 ms 212 KB n = 2, 3 is a correct answer
9 Correct 1 ms 292 KB n = 2, 3 is a correct answer
10 Correct 0 ms 212 KB n = 2, 2000000001 is a correct answer
11 Correct 1 ms 212 KB n = 2, 3000000000 is a correct answer
12 Correct 1 ms 212 KB n = 3, 3000000000 is a correct answer
13 Correct 0 ms 212 KB n = 3, 3000000000 is a correct answer
14 Correct 1 ms 300 KB n = 4, 3000000001 is a correct answer
15 Correct 0 ms 296 KB n = 4, 4000000000 is a correct answer
16 Incorrect 0 ms 212 KB n = 5, incorrect answer: jury 4000000000 vs contestant 3000000001
17 Halted 0 ms 0 KB -

Subtask #4
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB n = 4, 80 is a correct answer
2 Correct 1 ms 212 KB n = 9, 110 is a correct answer
3 Correct 0 ms 212 KB n = 4, 21 is a correct answer
4 Correct 1 ms 296 KB n = 3, 4 is a correct answer
5 Correct 1 ms 212 KB n = 2, 62 is a correct answer
6 Correct 1 ms 212 KB n = 2, 3 is a correct answer
7 Correct 0 ms 212 KB n = 3, 29 is a correct answer
8 Correct 0 ms 212 KB n = 2, 3 is a correct answer
9 Correct 1 ms 292 KB n = 2, 3 is a correct answer
10 Correct 0 ms 212 KB n = 2, 2000000001 is a correct answer
11 Correct 1 ms 212 KB n = 2, 3000000000 is a correct answer
12 Correct 1 ms 212 KB n = 3, 3000000000 is a correct answer
13 Correct 0 ms 212 KB n = 3, 3000000000 is a correct answer
14 Correct 1 ms 300 KB n = 4, 3000000001 is a correct answer
15 Correct 0 ms 296 KB n = 4, 4000000000 is a correct answer
16 Incorrect 0 ms 212 KB n = 5, incorrect answer: jury 4000000000 vs contestant 3000000001
17 Halted 0 ms 0 KB -

Subtask #5
0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB n = 4, 80 is a correct answer
2 Correct 1 ms 212 KB n = 9, 110 is a correct answer
3 Correct 0 ms 212 KB n = 4, 21 is a correct answer
4 Correct 1 ms 296 KB n = 3, 4 is a correct answer
5 Correct 1 ms 212 KB n = 2, 62 is a correct answer
6 Correct 1 ms 212 KB n = 2, 3 is a correct answer
7 Correct 0 ms 212 KB n = 3, 29 is a correct answer
8 Correct 0 ms 212 KB n = 2, 3 is a correct answer
9 Correct 1 ms 292 KB n = 2, 3 is a correct answer
10 Correct 0 ms 212 KB n = 2, 2000000001 is a correct answer
11 Correct 1 ms 212 KB n = 2, 3000000000 is a correct answer
12 Correct 1 ms 212 KB n = 3, 3000000000 is a correct answer
13 Correct 0 ms 212 KB n = 3, 3000000000 is a correct answer
14 Correct 1 ms 300 KB n = 4, 3000000001 is a correct answer
15 Correct 0 ms 296 KB n = 4, 4000000000 is a correct answer
16 Incorrect 0 ms 212 KB n = 5, incorrect answer: jury 4000000000 vs contestant 3000000001
17 Halted 0 ms 0 KB -

Subtask #6
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB n = 4, 80 is a correct answer
2 Correct 1 ms 212 KB n = 9, 110 is a correct answer
3 Correct 0 ms 212 KB n = 4, 21 is a correct answer
4 Correct 1 ms 296 KB n = 3, 4 is a correct answer
5 Correct 1 ms 212 KB n = 2, 62 is a correct answer
6 Correct 1 ms 212 KB n = 2, 3 is a correct answer
7 Correct 0 ms 212 KB n = 3, 29 is a correct answer
8 Correct 0 ms 212 KB n = 2, 3 is a correct answer
9 Correct 1 ms 292 KB n = 2, 3 is a correct answer
10 Correct 0 ms 212 KB n = 2, 2000000001 is a correct answer
11 Correct 1 ms 212 KB n = 2, 3000000000 is a correct answer
12 Correct 1 ms 212 KB n = 3, 3000000000 is a correct answer
13 Correct 0 ms 212 KB n = 3, 3000000000 is a correct answer
14 Correct 1 ms 300 KB n = 4, 3000000001 is a correct answer
15 Correct 0 ms 296 KB n = 4, 4000000000 is a correct answer
16 Incorrect 0 ms 212 KB n = 5, incorrect answer: jury 4000000000 vs contestant 3000000001
17 Halted 0 ms 0 KB -

Subtask #7
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB n = 4, 80 is a correct answer
2 Correct 1 ms 212 KB n = 9, 110 is a correct answer
3 Correct 0 ms 212 KB n = 4, 21 is a correct answer
4 Correct 1 ms 296 KB n = 3, 4 is a correct answer
5 Correct 1 ms 212 KB n = 2, 62 is a correct answer
6 Correct 1 ms 212 KB n = 2, 3 is a correct answer
7 Correct 0 ms 212 KB n = 3, 29 is a correct answer
8 Correct 0 ms 212 KB n = 2, 3 is a correct answer
9 Correct 1 ms 292 KB n = 2, 3 is a correct answer
10 Correct 0 ms 212 KB n = 2, 2000000001 is a correct answer
11 Correct 1 ms 212 KB n = 2, 3000000000 is a correct answer
12 Correct 1 ms 212 KB n = 3, 3000000000 is a correct answer
13 Correct 0 ms 212 KB n = 3, 3000000000 is a correct answer
14 Correct 1 ms 300 KB n = 4, 3000000001 is a correct answer
15 Correct 0 ms 296 KB n = 4, 4000000000 is a correct answer
16 Incorrect 0 ms 212 KB n = 5, incorrect answer: jury 4000000000 vs contestant 3000000001
17 Halted 0 ms 0 KB -

Subtask #8
0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB n = 4, 80 is a correct answer
2 Correct 1 ms 212 KB n = 9, 110 is a correct answer
3 Correct 0 ms 212 KB n = 4, 21 is a correct answer
4 Correct 1 ms 296 KB n = 3, 4 is a correct answer
5 Correct 1 ms 212 KB n = 2, 62 is a correct answer
6 Correct 1 ms 212 KB n = 2, 3 is a correct answer
7 Correct 0 ms 212 KB n = 3, 29 is a correct answer
8 Correct 0 ms 212 KB n = 2, 3 is a correct answer
9 Correct 1 ms 292 KB n = 2, 3 is a correct answer
10 Correct 0 ms 212 KB n = 2, 2000000001 is a correct answer
11 Correct 1 ms 212 KB n = 2, 3000000000 is a correct answer
12 Correct 1 ms 212 KB n = 3, 3000000000 is a correct answer
13 Correct 0 ms 212 KB n = 3, 3000000000 is a correct answer
14 Correct 1 ms 300 KB n = 4, 3000000001 is a correct answer
15 Correct 0 ms 296 KB n = 4, 4000000000 is a correct answer
16 Incorrect 0 ms 212 KB n = 5, incorrect answer: jury 4000000000 vs contestant 3000000001
17 Halted 0 ms 0 KB -