oj.uz

Submission #230945

# Submission time Handle Problem Language Result Execution time Memory
230945 2020-05-12T05:53:25 Z AlexLuchianov Xylophone (JOI18_xylophone) C++14
100 / 100
 115 ms 632 KB 
#include "xylophone.h"
#include <iostream>

int const nmax = 5000;
static int A[5000];

int diff[1 + nmax];
int change[1 + nmax];
int v[1 + nmax];

void solve(int n) {
  for(int i = 1;i < n; i++)
    diff[i] = query(i, i + 1);
  change[1] = 1;
  for(int i = 2; i < n; i++){
    if(diff[i - 1] + diff[i] == query(i - 1, i + 1))
      change[i] = change[i - 1];
    else
      change[i] = !change[i - 1];
  }
  v[1] = 0;
  for(int i = 2;i <= n; i++)
    if(change[i - 1] == 1)
      v[i] = v[i - 1] + diff[i - 1];
    else
      v[i] = v[i - 1] - diff[i - 1];
  int smin = 0;
  for(int i = 1; i <= n; i++)
    smin = std::min(smin, v[i]);
  for(int i = 1;i <= n; i++)
    v[i] = v[i] - smin + 1;
  int pos1, posn;
  for(int i = 1;i <= n; i++)
    if(v[i] == 1)
      pos1 = i;
    else if(v[i] == n)
      posn = i;
  if(posn < pos1)
    for(int i = 1; i <= n; i++)
      v[i] = n - v[i] + 1;


  for(int i = 1;i <= n; i++)
    answer(i, v[i]);
}
/*
5
2 1 5 3 4
*/

Compilation message

xylophone.cpp:5:12: warning: 'A' defined but not used [-Wunused-variable]
 static int A[5000];
            ^
xylophone.cpp: In function 'void solve(int)':
xylophone.cpp:38:3: warning: 'posn' may be used uninitialized in this function [-Wmaybe-uninitialized]
   if(posn < pos1)
   ^~
xylophone.cpp:38:3: warning: 'pos1' may be used uninitialized in this function [-Wmaybe-uninitialized]

Subtask #1
11.0 / 11.0

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

Subtask #2
36.0 / 36.0

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

Subtask #3
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 256 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 7 ms 384 KB Output is correct
5 Correct 6 ms 384 KB Output is correct
6 Correct 6 ms 384 KB Output is correct
7 Correct 6 ms 384 KB Output is correct
8 Correct 6 ms 384 KB Output is correct
9 Correct 6 ms 384 KB Output is correct
10 Correct 7 ms 384 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 7 ms 384 KB Output is correct
13 Correct 7 ms 384 KB Output is correct
14 Correct 7 ms 256 KB Output is correct
15 Correct 6 ms 384 KB Output is correct
16 Correct 9 ms 384 KB Output is correct
17 Correct 12 ms 384 KB Output is correct
18 Correct 19 ms 384 KB Output is correct
19 Correct 23 ms 384 KB Output is correct
20 Correct 24 ms 384 KB Output is correct
21 Correct 18 ms 384 KB Output is correct
22 Correct 24 ms 384 KB Output is correct
23 Correct 20 ms 632 KB Output is correct
24 Correct 25 ms 384 KB Output is correct
25 Correct 19 ms 376 KB Output is correct
26 Correct 25 ms 384 KB Output is correct
27 Correct 21 ms 380 KB Output is correct
28 Correct 21 ms 384 KB Output is correct
29 Correct 23 ms 384 KB Output is correct
30 Correct 26 ms 376 KB Output is correct
31 Correct 37 ms 376 KB Output is correct
32 Correct 55 ms 384 KB Output is correct
33 Correct 76 ms 384 KB Output is correct
34 Correct 90 ms 520 KB Output is correct
35 Correct 87 ms 384 KB Output is correct
36 Correct 115 ms 376 KB Output is correct
37 Correct 76 ms 384 KB Output is correct
38 Correct 73 ms 376 KB Output is correct
39 Correct 115 ms 376 KB Output is correct
40 Correct 81 ms 504 KB Output is correct
41 Correct 75 ms 380 KB Output is correct
42 Correct 92 ms 384 KB Output is correct
43 Correct 76 ms 376 KB Output is correct
44 Correct 110 ms 504 KB Output is correct
45 Correct 88 ms 384 KB Output is correct
46 Correct 86 ms 376 KB Output is correct
47 Correct 79 ms 384 KB Output is correct
48 Correct 89 ms 384 KB Output is correct
49 Correct 107 ms 384 KB Output is correct
50 Correct 86 ms 376 KB Output is correct
51 Correct 115 ms 380 KB Output is correct
52 Correct 85 ms 404 KB Output is correct
53 Correct 91 ms 504 KB Output is correct
54 Correct 80 ms 392 KB Output is correct
55 Correct 91 ms 432 KB Output is correct
56 Correct 83 ms 376 KB Output is correct
57 Correct 90 ms 376 KB Output is correct
58 Correct 91 ms 500 KB Output is correct
59 Correct 88 ms 516 KB Output is correct
60 Correct 90 ms 504 KB Output is correct