Submission #1049593

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1049593	2024-08-09T01:10:16 Z	GrindMachine	Sparklers (JOI17_sparklers)	C++17	50 / 100	106 ms	262144 KB

sparklers

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) (int)a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x,y) ((x+y-1)/(y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a,b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a,b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(...) 42
#endif

/*

refs:
edi
stress tested to figure out the bug (ans = 0 case was bugged)
ac code used for stress testing: https://oj.uz/submission/1043916

*/

const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

void solve(int test_case)
{
    ll n,k,t; cin >> n >> k >> t;
    vector<ll> a(n+5);
    rep1(i,n) cin >> a[i];

    auto ok = [&](ll s){
        bool dp[n+5][n+5];
        memset(dp,0,sizeof dp);
        dp[k][k] = 1;
        rev(l,n,1){
            for(int r = l; r <= n; ++r){
                ll len = r-l+1;
                if(!dp[l][r]) conts;

                __int128 lim = (__int128)2*len*t*s;

                // l --> l-1
                if(l-1){
                    ll m = a[l-1]+a[r];
                    if(abs(m-2*a[l-1]) <= lim and abs(m-2*a[r]) <= lim){
                        dp[l-1][r] = 1;
                    }
                }

                // r --> r+1
                if(r+1 <= n){
                    ll m = a[l]+a[r+1];
                    if(abs(m-2*a[r+1]) <= lim and abs(m-2*a[l]) <= lim){
                        dp[l][r+1] = 1;
                    }
                }
            }
        }

        return dp[1][n];
    };

    ll lo = 0, hi = inf1;
    ll ans = -1;

    while(lo <= hi){
        ll mid = (lo+hi) >> 1;
        if(ok(mid)){
            ans = mid;
            hi = mid-1;
        }
        else{
            lo = mid+1;
        }
    }

    cout << ans << endl;
}

int main()
{
    fastio;

    int t = 1;
    // cin >> t;

    rep1(i, t) {
        solve(i);
    }

    return 0;
}

Subtask #1
30.0 / 30.0

#	Verdict	Memory	Grader output
1	Correct	344 KB	Output is correct
2	Correct	348 KB	Output is correct
3	Correct	348 KB	Output is correct
4	Correct	348 KB	Output is correct
5	Correct	348 KB	Output is correct
6	Correct	348 KB	Output is correct
7	Correct	344 KB	Output is correct
8	Correct	348 KB	Output is correct
9	Correct	456 KB	Output is correct
10	Correct	604 KB	Output is correct
11	Correct	348 KB	Output is correct
12	Correct	348 KB	Output is correct
13	Correct	348 KB	Output is correct
14	Correct	348 KB	Output is correct
15	Correct	344 KB	Output is correct
16	Correct	348 KB	Output is correct
17	Correct	348 KB	Output is correct
18	Correct	348 KB	Output is correct
19	Correct	348 KB	Output is correct
20	Correct	348 KB	Output is correct
21	Correct	456 KB	Output is correct

Subtask #2
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	344 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	456 KB	Output is correct
10	Correct	0 ms	604 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	344 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	0 ms	456 KB	Output is correct
22	Correct	17 ms	996 KB	Output is correct
23	Correct	10 ms	600 KB	Output is correct
24	Correct	10 ms	1112 KB	Output is correct
25	Correct	13 ms	1460 KB	Output is correct
26	Correct	26 ms	1452 KB	Output is correct
27	Correct	25 ms	1368 KB	Output is correct
28	Correct	28 ms	1368 KB	Output is correct
29	Correct	29 ms	1372 KB	Output is correct
30	Correct	21 ms	1368 KB	Output is correct
31	Correct	25 ms	1372 KB	Output is correct
32	Correct	29 ms	1372 KB	Output is correct
33	Correct	31 ms	1372 KB	Output is correct
34	Correct	23 ms	1372 KB	Output is correct
35	Correct	31 ms	1456 KB	Output is correct
36	Correct	16 ms	1372 KB	Output is correct
37	Correct	16 ms	1372 KB	Output is correct
38	Correct	28 ms	1232 KB	Output is correct
39	Correct	14 ms	1456 KB	Output is correct
40	Correct	38 ms	1372 KB	Output is correct

Subtask #3
0 / 50.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	344 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	456 KB	Output is correct
10	Correct	0 ms	604 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	344 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	0 ms	456 KB	Output is correct
22	Correct	17 ms	996 KB	Output is correct
23	Correct	10 ms	600 KB	Output is correct
24	Correct	10 ms	1112 KB	Output is correct
25	Correct	13 ms	1460 KB	Output is correct
26	Correct	26 ms	1452 KB	Output is correct
27	Correct	25 ms	1368 KB	Output is correct
28	Correct	28 ms	1368 KB	Output is correct
29	Correct	29 ms	1372 KB	Output is correct
30	Correct	21 ms	1368 KB	Output is correct
31	Correct	25 ms	1372 KB	Output is correct
32	Correct	29 ms	1372 KB	Output is correct
33	Correct	31 ms	1372 KB	Output is correct
34	Correct	23 ms	1372 KB	Output is correct
35	Correct	31 ms	1456 KB	Output is correct
36	Correct	16 ms	1372 KB	Output is correct
37	Correct	16 ms	1372 KB	Output is correct
38	Correct	28 ms	1232 KB	Output is correct
39	Correct	14 ms	1456 KB	Output is correct
40	Correct	38 ms	1372 KB	Output is correct
41	Runtime error	106 ms	262144 KB	Execution killed with signal 9
42	Halted	0 ms	0 KB	-

Submission #1049593

Compilation message

Subtask #1 30.0 / 30.0

Subtask #2 20.0 / 20.0

Subtask #3 0 / 50.0

Subtask #1
30.0 / 30.0

Subtask #2
20.0 / 20.0

Subtask #3
0 / 50.0