oj.uz

Submission #566159

# Submission time Handle Problem Language Result Execution time Memory
566159 2022-05-21T23:12:21 Z Uzouf Xylophone (JOI18_xylophone) C++14
100 / 100
 102 ms 1112 KB 
#include <bits/stdc++.h>
#include "xylophone.h"
using namespace std;

map<pair<int,int>,int> df;
int sign[5005];
int og[5005],ans[5005];
 
void solve(int N) {
    for (int i=1;i<=N;i++) {
      if (i+1<=N) {
        df[{i,i+1}]=query(i,i+1);
      }
      if (i+2<=N)  {
        df[{i,i+2}]=query(i,i+2);
      }
    }
  
  for (int i=2;i<=N-1;i++) {
      if (df[{i-1,i+1}]==df[{i-1,i}]+df[{i,i+1}]) sign[i]=sign[i-1];
      else sign[i]=sign[i-1]^1;
    }
 
    int mn=0;
    og[1]=0;
    for (int i=1;i<=N-1;i++) {
      if (sign[i]==0) {
        og[i+1]=og[i]+df[{i,i+1}];
      }
      else {
        og[i+1]=og[i]-df[{i,i+1}];
      }
      mn=min(mn,og[i+1]);
    }
 
    mn=1-mn;
    bool f1=false,gg=false;
    for (int i=1;i<=N;i++) {
      //cout<<og[i]<<' ';
      ans[i]=og[i]+mn;
      if (ans[i]==1) f1=true;
      if (ans[i]==N && !f1) gg=true;
    }
 
    for (int i=1;i<=N;i++) {
      if (gg) ans[i]=N+1-ans[i];
      answer(i,ans[i]);
    }
  
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 1 ms 300 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 3 ms 208 KB Output is correct
5 Correct 2 ms 208 KB Output is correct
6 Correct 3 ms 208 KB Output is correct
7 Correct 2 ms 208 KB Output is correct
8 Correct 2 ms 304 KB Output is correct
9 Correct 3 ms 208 KB Output is correct
10 Correct 3 ms 208 KB Output is correct
11 Correct 2 ms 308 KB Output is correct
12 Correct 2 ms 208 KB Output is correct
13 Correct 2 ms 208 KB Output is correct
14 Correct 2 ms 208 KB Output is correct
15 Correct 3 ms 336 KB Output is correct

Subtask #2
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 1 ms 300 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 3 ms 208 KB Output is correct
5 Correct 2 ms 208 KB Output is correct
6 Correct 3 ms 208 KB Output is correct
7 Correct 2 ms 208 KB Output is correct
8 Correct 2 ms 304 KB Output is correct
9 Correct 3 ms 208 KB Output is correct
10 Correct 3 ms 208 KB Output is correct
11 Correct 2 ms 308 KB Output is correct
12 Correct 2 ms 208 KB Output is correct
13 Correct 2 ms 208 KB Output is correct
14 Correct 2 ms 208 KB Output is correct
15 Correct 3 ms 336 KB Output is correct
16 Correct 3 ms 436 KB Output is correct
17 Correct 8 ms 352 KB Output is correct
18 Correct 18 ms 336 KB Output is correct
19 Correct 16 ms 360 KB Output is correct
20 Correct 16 ms 336 KB Output is correct
21 Correct 18 ms 336 KB Output is correct
22 Correct 25 ms 360 KB Output is correct
23 Correct 23 ms 376 KB Output is correct
24 Correct 21 ms 360 KB Output is correct
25 Correct 21 ms 368 KB Output is correct
26 Correct 17 ms 348 KB Output is correct
27 Correct 16 ms 488 KB Output is correct
28 Correct 19 ms 376 KB Output is correct
29 Correct 20 ms 312 KB Output is correct
30 Correct 10 ms 440 KB Output is correct

Subtask #3
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 1 ms 300 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 3 ms 208 KB Output is correct
5 Correct 2 ms 208 KB Output is correct
6 Correct 3 ms 208 KB Output is correct
7 Correct 2 ms 208 KB Output is correct
8 Correct 2 ms 304 KB Output is correct
9 Correct 3 ms 208 KB Output is correct
10 Correct 3 ms 208 KB Output is correct
11 Correct 2 ms 308 KB Output is correct
12 Correct 2 ms 208 KB Output is correct
13 Correct 2 ms 208 KB Output is correct
14 Correct 2 ms 208 KB Output is correct
15 Correct 3 ms 336 KB Output is correct
16 Correct 3 ms 436 KB Output is correct
17 Correct 8 ms 352 KB Output is correct
18 Correct 18 ms 336 KB Output is correct
19 Correct 16 ms 360 KB Output is correct
20 Correct 16 ms 336 KB Output is correct
21 Correct 18 ms 336 KB Output is correct
22 Correct 25 ms 360 KB Output is correct
23 Correct 23 ms 376 KB Output is correct
24 Correct 21 ms 360 KB Output is correct
25 Correct 21 ms 368 KB Output is correct
26 Correct 17 ms 348 KB Output is correct
27 Correct 16 ms 488 KB Output is correct
28 Correct 19 ms 376 KB Output is correct
29 Correct 20 ms 312 KB Output is correct
30 Correct 10 ms 440 KB Output is correct
31 Correct 39 ms 500 KB Output is correct
32 Correct 58 ms 732 KB Output is correct
33 Correct 84 ms 788 KB Output is correct
34 Correct 80 ms 1112 KB Output is correct
35 Correct 82 ms 972 KB Output is correct
36 Correct 83 ms 916 KB Output is correct
37 Correct 96 ms 880 KB Output is correct
38 Correct 82 ms 996 KB Output is correct
39 Correct 90 ms 916 KB Output is correct
40 Correct 83 ms 968 KB Output is correct
41 Correct 95 ms 980 KB Output is correct
42 Correct 71 ms 952 KB Output is correct
43 Correct 74 ms 964 KB Output is correct
44 Correct 88 ms 1000 KB Output is correct
45 Correct 85 ms 1072 KB Output is correct
46 Correct 87 ms 932 KB Output is correct
47 Correct 102 ms 872 KB Output is correct
48 Correct 81 ms 984 KB Output is correct
49 Correct 101 ms 892 KB Output is correct
50 Correct 87 ms 888 KB Output is correct
51 Correct 89 ms 900 KB Output is correct
52 Correct 101 ms 956 KB Output is correct
53 Correct 94 ms 984 KB Output is correct
54 Correct 91 ms 1052 KB Output is correct
55 Correct 97 ms 972 KB Output is correct
56 Correct 89 ms 976 KB Output is correct
57 Correct 97 ms 952 KB Output is correct
58 Correct 90 ms 900 KB Output is correct
59 Correct 87 ms 912 KB Output is correct
60 Correct 95 ms 1048 KB Output is correct