oj.uz

Submission #399478

# Submission time Handle Problem Language Result Execution time Memory
399478 2021-05-05T21:50:08 Z duality Sparklers (JOI17_sparklers) C++11
50 / 100
 30 ms 4032 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];
int poss[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)) poss[K][K] = 1;
                else {
                    if (X[j]-X[i] > 2LL*m*(j-i)) poss[i][j] = 0;
                    else {
                        poss[i][j] = 0;
                        if (i < K) poss[i][j] |= poss[i+1][j];
                        if (j > K) poss[i][j] |= poss[i][j-1];
                    }
                }
            }
        }
        if (poss[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 332 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 300 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 308 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 308 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 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 204 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 208 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 332 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 300 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 308 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 308 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 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 204 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 208 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 13 ms 1228 KB Output is correct
23 Correct 7 ms 972 KB Output is correct
24 Correct 4 ms 460 KB Output is correct
25 Correct 4 ms 332 KB Output is correct
26 Correct 12 ms 972 KB Output is correct
27 Correct 14 ms 972 KB Output is correct
28 Correct 25 ms 2600 KB Output is correct
29 Correct 24 ms 2860 KB Output is correct
30 Correct 18 ms 3424 KB Output is correct
31 Correct 20 ms 3288 KB Output is correct
32 Correct 24 ms 2112 KB Output is correct
33 Correct 30 ms 2080 KB Output is correct
34 Correct 16 ms 3532 KB Output is correct
35 Correct 21 ms 2868 KB Output is correct
36 Correct 8 ms 628 KB Output is correct
37 Correct 8 ms 632 KB Output is correct
38 Correct 23 ms 3048 KB Output is correct
39 Correct 8 ms 4032 KB Output is correct
40 Correct 25 ms 1612 KB Output is correct

Subtask #3
0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 300 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 308 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 308 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 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 204 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 208 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 13 ms 1228 KB Output is correct
23 Correct 7 ms 972 KB Output is correct
24 Correct 4 ms 460 KB Output is correct
25 Correct 4 ms 332 KB Output is correct
26 Correct 12 ms 972 KB Output is correct
27 Correct 14 ms 972 KB Output is correct
28 Correct 25 ms 2600 KB Output is correct
29 Correct 24 ms 2860 KB Output is correct
30 Correct 18 ms 3424 KB Output is correct
31 Correct 20 ms 3288 KB Output is correct
32 Correct 24 ms 2112 KB Output is correct
33 Correct 30 ms 2080 KB Output is correct
34 Correct 16 ms 3532 KB Output is correct
35 Correct 21 ms 2868 KB Output is correct
36 Correct 8 ms 628 KB Output is correct
37 Correct 8 ms 632 KB Output is correct
38 Correct 23 ms 3048 KB Output is correct
39 Correct 8 ms 4032 KB Output is correct
40 Correct 25 ms 1612 KB Output is correct
41 Runtime error 12 ms 1616 KB Execution killed with signal 11
42 Halted 0 ms 0 KB -