oj.uz

Submission #152814

# Submission time Handle Problem Language Result Execution time Memory
152814 2019-09-09T16:11:56 Z doowey Xylophone (JOI18_xylophone) C++14
100 / 100
 134 ms 508 KB 
#include <bits/stdc++.h>
#include "xylophone.h"

using namespace std;

typedef long long ll;

const int N = 5005;
int to[N];
int thr[N];
int sign[N];
int bal[N];

void solve(int n) {
  for(int i = 1; i <= n - 1; i ++ ){
    to[i] = query(i, i + 1);
  }
  for(int i = 1; i <= n - 2; i ++ ){
    thr[i] = query(i, i + 2);
  }
  sign[2] = 1;
  for(int i = 3; i <= n; i ++ ){
    if(to[i - 2] + to[i - 1] != thr[i - 2]){
      sign[i] = 1 - sign[i - 1];
    }
    else{
      sign[i] = sign[i - 1];
    }
  }
  int sg;
  for(int i = 2; i <= n; i ++ ){
    if(sign[i] == 1) sg = +1;
    else sg = -1;
    bal[i] = bal[i - 1] + sg * to[i - 1];
  }
  int low = 1;
  int high = 1;
  for(int i = 2; i <= n; i ++ ){
    if(bal[i] < bal[low])
      low = i;
    if(bal[i] > bal[high])
      high = i;
  }
  if(low > high){
    for(int i = 2 ; i <= n; i ++ ){
      sign[i] = 1 - sign[i];
    }
  }
  low = 0;
  for(int i = 2; i <= n; i ++ ){
    if(sign[i] == 1) sg = +1;
    else sg = -1;
    bal[i] = bal[i - 1] + sg * to[i - 1];
    low = min(low, bal[i]);
  }
  for(int i = 1; i <= n; i ++ ){
    answer(i, bal[i] - low + 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 248 KB Output is correct
3 Correct 2 ms 316 KB Output is correct
4 Correct 4 ms 376 KB Output is correct
5 Correct 5 ms 380 KB Output is correct
6 Correct 5 ms 380 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 4 ms 248 KB Output is correct
9 Correct 4 ms 248 KB Output is correct
10 Correct 4 ms 248 KB Output is correct
11 Correct 5 ms 248 KB Output is correct
12 Correct 4 ms 248 KB Output is correct
13 Correct 3 ms 312 KB Output is correct
14 Correct 5 ms 320 KB Output is correct
15 Correct 4 ms 248 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 248 KB Output is correct
3 Correct 2 ms 316 KB Output is correct
4 Correct 4 ms 376 KB Output is correct
5 Correct 5 ms 380 KB Output is correct
6 Correct 5 ms 380 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 4 ms 248 KB Output is correct
9 Correct 4 ms 248 KB Output is correct
10 Correct 4 ms 248 KB Output is correct
11 Correct 5 ms 248 KB Output is correct
12 Correct 4 ms 248 KB Output is correct
13 Correct 3 ms 312 KB Output is correct
14 Correct 5 ms 320 KB Output is correct
15 Correct 4 ms 248 KB Output is correct
16 Correct 8 ms 248 KB Output is correct
17 Correct 11 ms 376 KB Output is correct
18 Correct 11 ms 316 KB Output is correct
19 Correct 14 ms 324 KB Output is correct
20 Correct 23 ms 316 KB Output is correct
21 Correct 13 ms 312 KB Output is correct
22 Correct 14 ms 376 KB Output is correct
23 Correct 24 ms 504 KB Output is correct
24 Correct 13 ms 400 KB Output is correct
25 Correct 24 ms 248 KB Output is correct
26 Correct 26 ms 308 KB Output is correct
27 Correct 13 ms 400 KB Output is correct
28 Correct 25 ms 404 KB Output is correct
29 Correct 22 ms 376 KB Output is correct
30 Correct 13 ms 400 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 248 KB Output is correct
3 Correct 2 ms 316 KB Output is correct
4 Correct 4 ms 376 KB Output is correct
5 Correct 5 ms 380 KB Output is correct
6 Correct 5 ms 380 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 4 ms 248 KB Output is correct
9 Correct 4 ms 248 KB Output is correct
10 Correct 4 ms 248 KB Output is correct
11 Correct 5 ms 248 KB Output is correct
12 Correct 4 ms 248 KB Output is correct
13 Correct 3 ms 312 KB Output is correct
14 Correct 5 ms 320 KB Output is correct
15 Correct 4 ms 248 KB Output is correct
16 Correct 8 ms 248 KB Output is correct
17 Correct 11 ms 376 KB Output is correct
18 Correct 11 ms 316 KB Output is correct
19 Correct 14 ms 324 KB Output is correct
20 Correct 23 ms 316 KB Output is correct
21 Correct 13 ms 312 KB Output is correct
22 Correct 14 ms 376 KB Output is correct
23 Correct 24 ms 504 KB Output is correct
24 Correct 13 ms 400 KB Output is correct
25 Correct 24 ms 248 KB Output is correct
26 Correct 26 ms 308 KB Output is correct
27 Correct 13 ms 400 KB Output is correct
28 Correct 25 ms 404 KB Output is correct
29 Correct 22 ms 376 KB Output is correct
30 Correct 13 ms 400 KB Output is correct
31 Correct 30 ms 376 KB Output is correct
32 Correct 41 ms 392 KB Output is correct
33 Correct 99 ms 376 KB Output is correct
34 Correct 94 ms 340 KB Output is correct
35 Correct 102 ms 380 KB Output is correct
36 Correct 54 ms 388 KB Output is correct
37 Correct 132 ms 460 KB Output is correct
38 Correct 75 ms 376 KB Output is correct
39 Correct 55 ms 444 KB Output is correct
40 Correct 134 ms 464 KB Output is correct
41 Correct 102 ms 336 KB Output is correct
42 Correct 102 ms 340 KB Output is correct
43 Correct 101 ms 508 KB Output is correct
44 Correct 112 ms 404 KB Output is correct
45 Correct 66 ms 444 KB Output is correct
46 Correct 80 ms 464 KB Output is correct
47 Correct 55 ms 316 KB Output is correct
48 Correct 113 ms 376 KB Output is correct
49 Correct 108 ms 432 KB Output is correct
50 Correct 68 ms 376 KB Output is correct
51 Correct 71 ms 332 KB Output is correct
52 Correct 104 ms 324 KB Output is correct
53 Correct 98 ms 376 KB Output is correct
54 Correct 118 ms 376 KB Output is correct
55 Correct 91 ms 392 KB Output is correct
56 Correct 85 ms 456 KB Output is correct
57 Correct 96 ms 448 KB Output is correct
58 Correct 72 ms 412 KB Output is correct
59 Correct 104 ms 336 KB Output is correct
60 Correct 106 ms 376 KB Output is correct