oj.uz

Submission #399436

# Submission time Handle Problem Language Result Execution time Memory
399436 2021-05-05T19:33:21 Z duality Sparklers (JOI17_sparklers) C++11
50 / 100
 78 ms 9268 KB 
#define DEBUG 0

#include <bits/stdc++.h>
using namespace std;

#if DEBUG
// basic debugging macros
int __i__,__j__;
#define printLine(l) for(__i__=0;__i__<l;__i__++){cout<<"-";}cout<<endl
#define printLine2(l,c) for(__i__=0;__i__<l;__i__++){cout<<c;}cout<<endl
#define printVar(n) cout<<#n<<": "<<n<<endl
#define printArr(a,l) cout<<#a<<": ";for(__i__=0;__i__<l;__i__++){cout<<a[__i__]<<" ";}cout<<endl
#define print2dArr(a,r,c) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<a[__i__][__j__]<<" ";}cout<<endl;}
#define print2dArr2(a,r,c,l) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<setw(l)<<setfill(' ')<<a[__i__][__j__]<<" ";}cout<<endl;}

// advanced debugging class
// debug 1,2,'A',"test";
class _Debug {
    public:
        template<typename T>
        _Debug& operator,(T val) {
            cout << val << endl;
            return *this;
        }
};
#define debug _Debug(),
#else
#define printLine(l)
#define printLine2(l,c)
#define printVar(n)
#define printArr(a,l)
#define print2dArr(a,r,c)
#define print2dArr2(a,r,c,l)
#define debug
#endif

// define
#define MAX_VAL 999999999
#define MAX_VAL_2 999999999999999999LL
#define EPS 1e-6
#define mp make_pair
#define pb push_back

// typedef
typedef unsigned int UI;
typedef long long int LLI;
typedef unsigned long long int ULLI;
typedef unsigned short int US;
typedef pair<int,int> pii;
typedef pair<LLI,LLI> plli;
typedef vector<int> vi;
typedef vector<LLI> vlli;
typedef vector<pii> vpii;
typedef vector<plli> vplli;

// ---------- END OF TEMPLATE ----------

int X[100000];
LLI l[1000][1000],r[1000][1000];
int main() {
    int i;
    int N,K,T;
    scanf("%d %d %d",&N,&K,&T),K--;
    for (i = 0; i < N; i++) scanf("%d",&X[i]);

    int j;
    int s = 0,e = 1e9;
    while (s < e) {
        int m = (s+e) / 2;

        for (i = K; i >= 0; i--) {
            for (j = K; j < N; j++) {
                if ((i == K) && (j == K)) l[K][K] = r[K][K] = X[K];
                else {
                    l[i][j] = 1e18,r[i][j] = -1e18;
                    int t = j-i;
                    if (i < K) {
                        LLI L = max(X[i]-(LLI) t*m,l[i+1][j]-m);
                        LLI R = min(X[i]+(LLI) t*m,r[i+1][j]+m);
                        if (L <= R) l[i][j] = min(l[i][j],L),r[i][j] = max(r[i][j],R);
                    }
                    if (j > K) {
                        LLI L = max(X[j]-(LLI) t*m,l[i][j-1]-m);
                        LLI R = min(X[j]+(LLI) t*m,r[i][j-1]+m);
                        if (L <= R) l[i][j] = min(l[i][j],L),r[i][j] = max(r[i][j],R);
                    }
                }
            }
        }
        if (l[0][N-1] <= r[0][N-1]) e = m;
        else s = m+1;
    }
    printf("%d\n",(s+T-1)/T);

    return 0;
}

Compilation message

sparklers.cpp: In function 'int main()':
sparklers.cpp:63:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   63 |     scanf("%d %d %d",&N,&K,&T),K--;
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~
sparklers.cpp:64:34: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   64 |     for (i = 0; i < N; i++) scanf("%d",&X[i]);
      |                             ~~~~~^~~~~~~~~~~~

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 324 KB Output is correct
2 Correct 1 ms 296 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 436 KB Output is correct
5 Correct 1 ms 460 KB Output is correct
6 Correct 1 ms 432 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 280 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 308 KB Output is correct
13 Correct 1 ms 460 KB Output is correct
14 Correct 1 ms 460 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 432 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 324 KB Output is correct
2 Correct 1 ms 296 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 436 KB Output is correct
5 Correct 1 ms 460 KB Output is correct
6 Correct 1 ms 432 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 280 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 308 KB Output is correct
13 Correct 1 ms 460 KB Output is correct
14 Correct 1 ms 460 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 432 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 34 ms 4344 KB Output is correct
23 Correct 18 ms 2824 KB Output is correct
24 Correct 8 ms 972 KB Output is correct
25 Correct 4 ms 588 KB Output is correct
26 Correct 29 ms 2380 KB Output is correct
27 Correct 35 ms 2924 KB Output is correct
28 Correct 62 ms 8764 KB Output is correct
29 Correct 62 ms 9164 KB Output is correct
30 Correct 56 ms 9164 KB Output is correct
31 Correct 50 ms 9268 KB Output is correct
32 Correct 61 ms 7500 KB Output is correct
33 Correct 78 ms 7372 KB Output is correct
34 Correct 34 ms 9092 KB Output is correct
35 Correct 56 ms 9156 KB Output is correct
36 Correct 21 ms 1484 KB Output is correct
37 Correct 20 ms 1596 KB Output is correct
38 Correct 56 ms 9224 KB Output is correct
39 Correct 17 ms 8504 KB Output is correct
40 Correct 62 ms 5876 KB Output is correct

Subtask #3
0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 324 KB Output is correct
2 Correct 1 ms 296 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 436 KB Output is correct
5 Correct 1 ms 460 KB Output is correct
6 Correct 1 ms 432 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 280 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 308 KB Output is correct
13 Correct 1 ms 460 KB Output is correct
14 Correct 1 ms 460 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 432 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 34 ms 4344 KB Output is correct
23 Correct 18 ms 2824 KB Output is correct
24 Correct 8 ms 972 KB Output is correct
25 Correct 4 ms 588 KB Output is correct
26 Correct 29 ms 2380 KB Output is correct
27 Correct 35 ms 2924 KB Output is correct
28 Correct 62 ms 8764 KB Output is correct
29 Correct 62 ms 9164 KB Output is correct
30 Correct 56 ms 9164 KB Output is correct
31 Correct 50 ms 9268 KB Output is correct
32 Correct 61 ms 7500 KB Output is correct
33 Correct 78 ms 7372 KB Output is correct
34 Correct 34 ms 9092 KB Output is correct
35 Correct 56 ms 9156 KB Output is correct
36 Correct 21 ms 1484 KB Output is correct
37 Correct 20 ms 1596 KB Output is correct
38 Correct 56 ms 9224 KB Output is correct
39 Correct 17 ms 8504 KB Output is correct
40 Correct 62 ms 5876 KB Output is correct
41 Runtime error 11 ms 1532 KB Execution killed with signal 11
42 Halted 0 ms 0 KB -