oj.uz

Submission #739460

# Submission time Handle Problem Language Result Execution time Memory
739460 2023-05-10T13:31:55 Z Valters07 Xylophone (JOI18_xylophone) C++14
100 / 100
 173 ms 556 KB 
#include <bits/stdc++.h>
#include "xylophone.h"
using namespace std;
const int N = 5005;

int a[N];
int nxt2[N], nxt3[N];

void solve(int n)
{
    for(int i = 1;i<n;i++)
        nxt2[i]=query(i,i+1);
    for(int i = 1;i<n-1;i++)
        nxt3[i]=query(i,i+2);
    a[1]=nxt2[1];
    for(int i = 3;i<=n;i++)
    {
        bool t1 = (nxt2[i-2]+nxt2[i-1]==nxt3[i-2]);
        bool t2 = (a[i-2]<a[i-1]);
        if(t1^t2)
            a[i]=a[i-1]-nxt2[i-1];
        else
            a[i]=a[i-1]+nxt2[i-1];
    }
    int mipos = 1, mapos = 1;
    for(int i = 1;i<=n;i++)
    {
        if(a[mipos]>a[i])
            mipos=i;
        if(a[mapos]<a[i])
            mapos=i;
    }
    if(mipos>mapos)
    {
        swap(mipos,mapos);
        for(int i = 1;i<=n;i++)
            a[i]=-a[i];
    }
    int pl = -a[mipos]+1;
    for(int i = 1;i<=n;i++)
        a[i]+=pl;
    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 1 ms 300 KB Output is correct
2 Correct 1 ms 208 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 2 ms 288 KB Output is correct
7 Correct 3 ms 208 KB Output is correct
8 Correct 2 ms 308 KB Output is correct
9 Correct 3 ms 208 KB Output is correct
10 Correct 3 ms 208 KB Output is correct
11 Correct 3 ms 208 KB Output is correct
12 Correct 3 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 208 KB Output is correct

Subtask #2
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 300 KB Output is correct
2 Correct 1 ms 208 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 2 ms 288 KB Output is correct
7 Correct 3 ms 208 KB Output is correct
8 Correct 2 ms 308 KB Output is correct
9 Correct 3 ms 208 KB Output is correct
10 Correct 3 ms 208 KB Output is correct
11 Correct 3 ms 208 KB Output is correct
12 Correct 3 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 208 KB Output is correct
16 Correct 4 ms 208 KB Output is correct
17 Correct 8 ms 208 KB Output is correct
18 Correct 16 ms 208 KB Output is correct
19 Correct 22 ms 304 KB Output is correct
20 Correct 16 ms 208 KB Output is correct
21 Correct 19 ms 300 KB Output is correct
22 Correct 25 ms 296 KB Output is correct
23 Correct 16 ms 304 KB Output is correct
24 Correct 19 ms 292 KB Output is correct
25 Correct 16 ms 304 KB Output is correct
26 Correct 20 ms 300 KB Output is correct
27 Correct 22 ms 208 KB Output is correct
28 Correct 17 ms 296 KB Output is correct
29 Correct 19 ms 296 KB Output is correct
30 Correct 15 ms 368 KB Output is correct

Subtask #3
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 300 KB Output is correct
2 Correct 1 ms 208 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 2 ms 288 KB Output is correct
7 Correct 3 ms 208 KB Output is correct
8 Correct 2 ms 308 KB Output is correct
9 Correct 3 ms 208 KB Output is correct
10 Correct 3 ms 208 KB Output is correct
11 Correct 3 ms 208 KB Output is correct
12 Correct 3 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 208 KB Output is correct
16 Correct 4 ms 208 KB Output is correct
17 Correct 8 ms 208 KB Output is correct
18 Correct 16 ms 208 KB Output is correct
19 Correct 22 ms 304 KB Output is correct
20 Correct 16 ms 208 KB Output is correct
21 Correct 19 ms 300 KB Output is correct
22 Correct 25 ms 296 KB Output is correct
23 Correct 16 ms 304 KB Output is correct
24 Correct 19 ms 292 KB Output is correct
25 Correct 16 ms 304 KB Output is correct
26 Correct 20 ms 300 KB Output is correct
27 Correct 22 ms 208 KB Output is correct
28 Correct 17 ms 296 KB Output is correct
29 Correct 19 ms 296 KB Output is correct
30 Correct 15 ms 368 KB Output is correct
31 Correct 22 ms 308 KB Output is correct
32 Correct 65 ms 424 KB Output is correct
33 Correct 90 ms 556 KB Output is correct
34 Correct 108 ms 316 KB Output is correct
35 Correct 100 ms 552 KB Output is correct
36 Correct 89 ms 432 KB Output is correct
37 Correct 100 ms 292 KB Output is correct
38 Correct 89 ms 308 KB Output is correct
39 Correct 93 ms 292 KB Output is correct
40 Correct 108 ms 320 KB Output is correct
41 Correct 67 ms 304 KB Output is correct
42 Correct 59 ms 300 KB Output is correct
43 Correct 104 ms 300 KB Output is correct
44 Correct 53 ms 304 KB Output is correct
45 Correct 92 ms 324 KB Output is correct
46 Correct 90 ms 352 KB Output is correct
47 Correct 108 ms 328 KB Output is correct
48 Correct 79 ms 328 KB Output is correct
49 Correct 84 ms 328 KB Output is correct
50 Correct 93 ms 328 KB Output is correct
51 Correct 126 ms 296 KB Output is correct
52 Correct 105 ms 304 KB Output is correct
53 Correct 104 ms 312 KB Output is correct
54 Correct 80 ms 324 KB Output is correct
55 Correct 173 ms 308 KB Output is correct
56 Correct 102 ms 308 KB Output is correct
57 Correct 80 ms 320 KB Output is correct
58 Correct 96 ms 324 KB Output is correct
59 Correct 115 ms 424 KB Output is correct
60 Correct 42 ms 412 KB Output is correct