oj.uz

Submission #144748

# Submission time Handle Problem Language Result Execution time Memory
144748 2019-08-17T15:49:53 Z mhy908 Xylophone (JOI18_xylophone) C++14
100 / 100
 121 ms 448 KB 
#include "xylophone.h"
#include <bits/stdc++.h>
#define inf 987654321
using namespace std;
typedef long long LL;

int arr[5010];
int dp[5010];
int ans[5010];

void solve(int n) {
    for(int i=2; i<=n; i++) {
        arr[i]=query(i-1, i);
    }
    dp[2]=1;
    for(int i=3; i<=n; i++) {
        int temp=query(i-2, i);
        if(temp!=arr[i-1]+arr[i])
            dp[i]=-dp[i-1];
        else
            dp[i]=dp[i-1];
    }
    int minnum=1, minmin=0, maxnum=1, maxmax=0;
    for(int i=2; i<=n; i++) {
        arr[i]*=dp[i];
        ans[i]=ans[i-1]+arr[i];
        if(maxmax<ans[i]) {
            maxmax=ans[i];
            maxnum=i;
        }
        if(minmin>ans[i]) {
            minmin=ans[i];
            minnum=i;
        }
    }
    if(minnum>maxnum) {
        minnum=1, minmin=0, maxnum=1, maxmax=0;
        for(int i=2; i<=n; i++) {
            arr[i]*=-1;
            ans[i]=ans[i-1]+arr[i];
            if(maxmax<ans[i]) {
                maxmax=ans[i];
                maxnum=i;
            }
            if(minmin>ans[i]) {
                minmin=ans[i];
                minnum=i;
            }
        }
    }
    for(int i=1; i<=n; i++){
        answer(i, ans[i]-minmin+1);
    }
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 2 ms 396 KB Output is correct
3 Correct 3 ms 248 KB Output is correct
4 Correct 4 ms 404 KB Output is correct
5 Correct 4 ms 248 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 4 ms 376 KB Output is correct
8 Correct 4 ms 324 KB Output is correct
9 Correct 5 ms 296 KB Output is correct
10 Correct 4 ms 376 KB Output is correct
11 Correct 5 ms 376 KB Output is correct
12 Correct 4 ms 376 KB Output is correct
13 Correct 4 ms 380 KB Output is correct
14 Correct 3 ms 400 KB Output is correct
15 Correct 4 ms 376 KB Output is correct

Subtask #2
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 2 ms 396 KB Output is correct
3 Correct 3 ms 248 KB Output is correct
4 Correct 4 ms 404 KB Output is correct
5 Correct 4 ms 248 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 4 ms 376 KB Output is correct
8 Correct 4 ms 324 KB Output is correct
9 Correct 5 ms 296 KB Output is correct
10 Correct 4 ms 376 KB Output is correct
11 Correct 5 ms 376 KB Output is correct
12 Correct 4 ms 376 KB Output is correct
13 Correct 4 ms 380 KB Output is correct
14 Correct 3 ms 400 KB Output is correct
15 Correct 4 ms 376 KB Output is correct
16 Correct 7 ms 248 KB Output is correct
17 Correct 9 ms 328 KB Output is correct
18 Correct 19 ms 248 KB Output is correct
19 Correct 17 ms 376 KB Output is correct
20 Correct 25 ms 376 KB Output is correct
21 Correct 25 ms 292 KB Output is correct
22 Correct 27 ms 248 KB Output is correct
23 Correct 24 ms 376 KB Output is correct
24 Correct 14 ms 316 KB Output is correct
25 Correct 21 ms 332 KB Output is correct
26 Correct 26 ms 248 KB Output is correct
27 Correct 21 ms 332 KB Output is correct
28 Correct 20 ms 324 KB Output is correct
29 Correct 20 ms 376 KB Output is correct
30 Correct 23 ms 328 KB Output is correct

Subtask #3
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 2 ms 396 KB Output is correct
3 Correct 3 ms 248 KB Output is correct
4 Correct 4 ms 404 KB Output is correct
5 Correct 4 ms 248 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 4 ms 376 KB Output is correct
8 Correct 4 ms 324 KB Output is correct
9 Correct 5 ms 296 KB Output is correct
10 Correct 4 ms 376 KB Output is correct
11 Correct 5 ms 376 KB Output is correct
12 Correct 4 ms 376 KB Output is correct
13 Correct 4 ms 380 KB Output is correct
14 Correct 3 ms 400 KB Output is correct
15 Correct 4 ms 376 KB Output is correct
16 Correct 7 ms 248 KB Output is correct
17 Correct 9 ms 328 KB Output is correct
18 Correct 19 ms 248 KB Output is correct
19 Correct 17 ms 376 KB Output is correct
20 Correct 25 ms 376 KB Output is correct
21 Correct 25 ms 292 KB Output is correct
22 Correct 27 ms 248 KB Output is correct
23 Correct 24 ms 376 KB Output is correct
24 Correct 14 ms 316 KB Output is correct
25 Correct 21 ms 332 KB Output is correct
26 Correct 26 ms 248 KB Output is correct
27 Correct 21 ms 332 KB Output is correct
28 Correct 20 ms 324 KB Output is correct
29 Correct 20 ms 376 KB Output is correct
30 Correct 23 ms 328 KB Output is correct
31 Correct 44 ms 344 KB Output is correct
32 Correct 35 ms 400 KB Output is correct
33 Correct 83 ms 344 KB Output is correct
34 Correct 85 ms 376 KB Output is correct
35 Correct 83 ms 384 KB Output is correct
36 Correct 121 ms 356 KB Output is correct
37 Correct 56 ms 400 KB Output is correct
38 Correct 95 ms 356 KB Output is correct
39 Correct 62 ms 352 KB Output is correct
40 Correct 91 ms 336 KB Output is correct
41 Correct 102 ms 448 KB Output is correct
42 Correct 74 ms 332 KB Output is correct
43 Correct 62 ms 356 KB Output is correct
44 Correct 102 ms 340 KB Output is correct
45 Correct 68 ms 352 KB Output is correct
46 Correct 58 ms 376 KB Output is correct
47 Correct 58 ms 376 KB Output is correct
48 Correct 57 ms 332 KB Output is correct
49 Correct 54 ms 340 KB Output is correct
50 Correct 54 ms 356 KB Output is correct
51 Correct 58 ms 376 KB Output is correct
52 Correct 62 ms 376 KB Output is correct
53 Correct 71 ms 436 KB Output is correct
54 Correct 66 ms 400 KB Output is correct
55 Correct 52 ms 348 KB Output is correct
56 Correct 100 ms 360 KB Output is correct
57 Correct 62 ms 416 KB Output is correct
58 Correct 86 ms 352 KB Output is correct
59 Correct 59 ms 376 KB Output is correct
60 Correct 56 ms 376 KB Output is correct