oj.uz

Submission #210292

# Submission time Handle Problem Language Result Execution time Memory
210292 2020-03-17T02:10:22 Z casperwang Xylophone (JOI18_xylophone) C++14
100 / 100
 106 ms 420 KB 
#include <bits/stdc++.h>
#include "xylophone.h"
using namespace std;

const int MAXN = 5000;
int m;
int a[MAXN+1];
int d[MAXN+1];
bool p[MAXN+1];

void solve(int n) {
  for (int i = 2; i <= n; i++)
    d[i] = query(i-1, i);
  for (int i = 3; i <= n; i++) {
    if (d[i-1] + d[i] == query(i-2, i)) {
      p[i] = p[i-1];
    } else p[i] = !p[i-1];
  }
  for (int i = 2; i <= n; i++) {
    if (p[i]) a[i] = a[i-1] + d[i];
    else a[i] = a[i-1] - d[i];
    m = min(m, a[i]);
  }
  for (int i = 1; i <= n; i++)
    a[i] = a[i] - m + 1;
  bool tf = 0, t = 0;
  for (int i = 1; i <= n; i++) {
    if (a[i] == 1) t = 1;
    if (a[i] == n && !t) tf = 1;
  }
  if (tf)
    for (int i = 1; i <= n; i++)
      a[i] = n - a[i] + 1;
  for (int i = 1; i <= n; i++)
    answer(i, a[i]);
}

Subtask #1
11.0 / 11.0

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

Subtask #2
36.0 / 36.0

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

Subtask #3
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 248 KB Output is correct
2 Correct 5 ms 248 KB Output is correct
3 Correct 5 ms 248 KB Output is correct
4 Correct 5 ms 248 KB Output is correct
5 Correct 6 ms 376 KB Output is correct
6 Correct 7 ms 376 KB Output is correct
7 Correct 6 ms 376 KB Output is correct
8 Correct 6 ms 248 KB Output is correct
9 Correct 6 ms 248 KB Output is correct
10 Correct 6 ms 248 KB Output is correct
11 Correct 7 ms 248 KB Output is correct
12 Correct 7 ms 328 KB Output is correct
13 Correct 7 ms 248 KB Output is correct
14 Correct 6 ms 376 KB Output is correct
15 Correct 7 ms 248 KB Output is correct
16 Correct 8 ms 376 KB Output is correct
17 Correct 15 ms 328 KB Output is correct
18 Correct 21 ms 376 KB Output is correct
19 Correct 24 ms 248 KB Output is correct
20 Correct 22 ms 332 KB Output is correct
21 Correct 24 ms 248 KB Output is correct
22 Correct 19 ms 248 KB Output is correct
23 Correct 24 ms 248 KB Output is correct
24 Correct 21 ms 376 KB Output is correct
25 Correct 23 ms 376 KB Output is correct
26 Correct 22 ms 376 KB Output is correct
27 Correct 23 ms 376 KB Output is correct
28 Correct 23 ms 376 KB Output is correct
29 Correct 23 ms 376 KB Output is correct
30 Correct 20 ms 376 KB Output is correct
31 Correct 43 ms 248 KB Output is correct
32 Correct 61 ms 420 KB Output is correct
33 Correct 89 ms 348 KB Output is correct
34 Correct 83 ms 376 KB Output is correct
35 Correct 93 ms 376 KB Output is correct
36 Correct 90 ms 376 KB Output is correct
37 Correct 80 ms 376 KB Output is correct
38 Correct 90 ms 376 KB Output is correct
39 Correct 92 ms 376 KB Output is correct
40 Correct 79 ms 376 KB Output is correct
41 Correct 91 ms 376 KB Output is correct
42 Correct 80 ms 376 KB Output is correct
43 Correct 80 ms 376 KB Output is correct
44 Correct 98 ms 376 KB Output is correct
45 Correct 91 ms 376 KB Output is correct
46 Correct 76 ms 380 KB Output is correct
47 Correct 91 ms 380 KB Output is correct
48 Correct 80 ms 376 KB Output is correct
49 Correct 81 ms 376 KB Output is correct
50 Correct 57 ms 324 KB Output is correct
51 Correct 87 ms 376 KB Output is correct
52 Correct 84 ms 372 KB Output is correct
53 Correct 94 ms 376 KB Output is correct
54 Correct 80 ms 376 KB Output is correct
55 Correct 83 ms 376 KB Output is correct
56 Correct 106 ms 376 KB Output is correct
57 Correct 94 ms 376 KB Output is correct
58 Correct 92 ms 376 KB Output is correct
59 Correct 79 ms 380 KB Output is correct
60 Correct 84 ms 376 KB Output is correct