oj.uz

답안 #312341

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
312341 2020-10-13T04:05:47 Z VROOM_VARUN Sparklers (JOI17_sparklers) C++14
100 / 100
 172 ms 6572 KB 
//benq
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
 
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/rope>
 
using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
 
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;
 
typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;
 
typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;
 
template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;
 
#define FOR(i, a, b) for (int i=a; i<(b); i++)
#define F0R(i, a) for (int i=0; i<(a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)
 
#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()
 
const int MOD = 1000000007;
const ll INF = 1e18;
const int MX = 100001;
 
int N,K,T,mid;
vi X;
 
bool good(vd x, vd y) {
    if (x[0] > y[0]) return 0;
    pi L = {0,0}, R = {0,0};
    bool ok = 1;
    while (ok) {
        ok = 0;
        while (L.s < sz(x)-1 && x[L.s+1] <= y[R.f]) {
            ok = 1;
            if (x[++L.s] < x[L.f]) L.f = L.s;
        }
        while (R.s < sz(y)-1 && x[L.f] <= y[R.s+1]) {
            ok = 1;
            if (y[++R.s] > y[R.f]) R.f = R.s;
        }
    }
    return L.s == sz(x)-1 && R.s == sz(y)-1;
}
 
bool OK() {
    vd x,y;
    F0Rd(i,K+1) x.pb((ld)2*mid*T*i-X[i]);
    FOR(i,K,N) y.pb((ld)2*mid*T*i-X[i]);
    if (!good(x,y)) return 0;
    reverse(all(x)), reverse(all(y));
    if (!good(x,y)) return 0;
    return 1;
}
 
int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin >> N >> K >> T; X.resize(N); K--;
    F0R(i,N) cin >> X[i];
    /*mid = 25303;
    cout << OK();
    exit(0);*/
    int lo = 0, hi = 1000000000;
    while (lo < hi) {
        mid = (lo+hi)/2;
        if (OK()) hi = mid;
        else lo = mid+1;
    }
    cout << lo;
}

Subtask #1
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 0 ms 384 KB Output is correct
13 Correct 0 ms 384 KB Output is correct
14 Correct 0 ms 384 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 0 ms 384 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 0 ms 384 KB Output is correct
20 Correct 0 ms 384 KB Output is correct
21 Correct 0 ms 384 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 0 ms 384 KB Output is correct
13 Correct 0 ms 384 KB Output is correct
14 Correct 0 ms 384 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 0 ms 384 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 0 ms 384 KB Output is correct
20 Correct 0 ms 384 KB Output is correct
21 Correct 0 ms 384 KB Output is correct
22 Correct 2 ms 384 KB Output is correct
23 Correct 1 ms 384 KB Output is correct
24 Correct 1 ms 384 KB Output is correct
25 Correct 2 ms 384 KB Output is correct
26 Correct 1 ms 384 KB Output is correct
27 Correct 2 ms 384 KB Output is correct
28 Correct 1 ms 384 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Correct 2 ms 384 KB Output is correct
31 Correct 1 ms 384 KB Output is correct
32 Correct 2 ms 384 KB Output is correct
33 Correct 1 ms 384 KB Output is correct
34 Correct 2 ms 384 KB Output is correct
35 Correct 1 ms 384 KB Output is correct
36 Correct 1 ms 384 KB Output is correct
37 Correct 2 ms 384 KB Output is correct
38 Correct 1 ms 384 KB Output is correct
39 Correct 1 ms 384 KB Output is correct
40 Correct 1 ms 384 KB Output is correct

Subtask #3
50.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 0 ms 384 KB Output is correct
13 Correct 0 ms 384 KB Output is correct
14 Correct 0 ms 384 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 0 ms 384 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 0 ms 384 KB Output is correct
20 Correct 0 ms 384 KB Output is correct
21 Correct 0 ms 384 KB Output is correct
22 Correct 2 ms 384 KB Output is correct
23 Correct 1 ms 384 KB Output is correct
24 Correct 1 ms 384 KB Output is correct
25 Correct 2 ms 384 KB Output is correct
26 Correct 1 ms 384 KB Output is correct
27 Correct 2 ms 384 KB Output is correct
28 Correct 1 ms 384 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Correct 2 ms 384 KB Output is correct
31 Correct 1 ms 384 KB Output is correct
32 Correct 2 ms 384 KB Output is correct
33 Correct 1 ms 384 KB Output is correct
34 Correct 2 ms 384 KB Output is correct
35 Correct 1 ms 384 KB Output is correct
36 Correct 1 ms 384 KB Output is correct
37 Correct 2 ms 384 KB Output is correct
38 Correct 1 ms 384 KB Output is correct
39 Correct 1 ms 384 KB Output is correct
40 Correct 1 ms 384 KB Output is correct
41 Correct 101 ms 3368 KB Output is correct
42 Correct 3 ms 536 KB Output is correct
43 Correct 28 ms 1416 KB Output is correct
44 Correct 149 ms 5572 KB Output is correct
45 Correct 149 ms 5340 KB Output is correct
46 Correct 153 ms 5496 KB Output is correct
47 Correct 170 ms 5420 KB Output is correct
48 Correct 144 ms 5184 KB Output is correct
49 Correct 147 ms 5436 KB Output is correct
50 Correct 147 ms 5404 KB Output is correct
51 Correct 154 ms 5652 KB Output is correct
52 Correct 163 ms 6368 KB Output is correct
53 Correct 157 ms 5428 KB Output is correct
54 Correct 162 ms 6256 KB Output is correct
55 Correct 137 ms 5308 KB Output is correct
56 Correct 147 ms 5568 KB Output is correct
57 Correct 145 ms 5296 KB Output is correct
58 Correct 142 ms 5076 KB Output is correct
59 Correct 156 ms 4584 KB Output is correct
60 Correct 172 ms 6572 KB Output is correct
61 Correct 167 ms 6168 KB Output is correct
62 Correct 149 ms 5592 KB Output is correct
63 Correct 157 ms 6112 KB Output is correct
64 Correct 153 ms 5448 KB Output is correct
65 Correct 144 ms 5028 KB Output is correct
66 Correct 154 ms 5216 KB Output is correct
67 Correct 141 ms 5048 KB Output is correct
68 Correct 159 ms 6460 KB Output is correct
69 Correct 162 ms 6380 KB Output is correct