oj.uz

Submission #709565

# Submission time Handle Problem Language Result Execution time Memory
709565 2023-03-13T23:19:15 Z ToroTN Xylophone (JOI18_xylophone) C++14
100 / 100
 119 ms 500 KB 
#include<bits/stdc++.h>
using namespace std;
#include "xylophone.h"
//#include "grader.cpp"
//static int A[5000];

int n,dis[5005][2],arr[5005],flip[5005],mn,mx,idx_mn,idx_mx;
void solve(int N) 
{
    n=N;
	for(int i=1;i<=n;i++) 
    {
        if(i+1<=n)dis[i][0]=query(i,i+1);
        if(i+2<=n)dis[i][1]=query(i,i+2);
	}
    /*for(int i=1;i<n;i++)printf("%d ",dis[i][0]);
    printf("\n");
    for(int i=1;i<n-1;i++)printf("%d ",dis[i][1]);
    printf("\n");*/
    arr[1]=0;
    arr[2]=dis[1][0];
    for(int i=2;i<n;i++)
    {
        if(dis[i-1][1]==dis[i-1][0]+dis[i][0])
        {
            if(arr[i]>arr[i-1])
            {
                arr[i+1]=arr[i]+dis[i][0];
            }else
            {
                arr[i+1]=arr[i]-dis[i][0];
            }
        }else if(dis[i-1][0]==dis[i-1][1])
        {
            if(arr[i]>arr[i-1])
            {
                arr[i+1]=arr[i]-dis[i][0];
            }else
            {
                arr[i+1]=arr[i]+dis[i][0];
            }
        }else
        {
            if(arr[i]>arr[i-1])
            {
                arr[i+1]=arr[i]-dis[i][0];
            }else
            {
                arr[i+1]=arr[i]+dis[i][0];
            }
        }
    }
    for(int i=1;i<=n;i++)flip[i]=-arr[i];
    mn=1e9;
    mx=-1e9;
    for(int i=1;i<=n;i++)
    {
        if(arr[i]>mx)
        {
            mx=arr[i],idx_mx=i;
        }
        if(arr[i]<mn)
        {
            mn=arr[i],idx_mn=i;
        }
    }
    if(idx_mn<idx_mx)
    {
        for(int i=1;i<=n;i++)
        {
            answer(i,arr[i]+1-mn);
        }
    }else
    {
        mn=1e9;
        mx=-1e9;
        for(int i=1;i<=n;i++)
        {
            if(flip[i]>mx)
            {
                mx=flip[i],idx_mx=i;
            }
            if(flip[i]<mn)
            {
                mn=flip[i],idx_mn=i;
            }
        }
        for(int i=1;i<=n;i++)
        {
            answer(i,flip[i]+1-mn);
        }
    }
}

Subtask #1
11.0 / 11.0

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

Subtask #2
36.0 / 36.0

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

Subtask #3
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 296 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 308 KB Output is correct
4 Correct 2 ms 208 KB Output is correct
5 Correct 2 ms 208 KB Output is correct
6 Correct 2 ms 208 KB Output is correct
7 Correct 2 ms 208 KB Output is correct
8 Correct 2 ms 208 KB Output is correct
9 Correct 2 ms 308 KB Output is correct
10 Correct 2 ms 312 KB Output is correct
11 Correct 2 ms 208 KB Output is correct
12 Correct 3 ms 208 KB Output is correct
13 Correct 3 ms 208 KB Output is correct
14 Correct 2 ms 208 KB Output is correct
15 Correct 1 ms 208 KB Output is correct
16 Correct 5 ms 312 KB Output is correct
17 Correct 9 ms 208 KB Output is correct
18 Correct 17 ms 208 KB Output is correct
19 Correct 19 ms 308 KB Output is correct
20 Correct 17 ms 312 KB Output is correct
21 Correct 18 ms 312 KB Output is correct
22 Correct 15 ms 304 KB Output is correct
23 Correct 15 ms 308 KB Output is correct
24 Correct 19 ms 296 KB Output is correct
25 Correct 24 ms 208 KB Output is correct
26 Correct 8 ms 308 KB Output is correct
27 Correct 19 ms 208 KB Output is correct
28 Correct 25 ms 312 KB Output is correct
29 Correct 20 ms 304 KB Output is correct
30 Correct 20 ms 312 KB Output is correct
31 Correct 29 ms 328 KB Output is correct
32 Correct 77 ms 312 KB Output is correct
33 Correct 89 ms 500 KB Output is correct
34 Correct 83 ms 320 KB Output is correct
35 Correct 45 ms 416 KB Output is correct
36 Correct 86 ms 436 KB Output is correct
37 Correct 82 ms 308 KB Output is correct
38 Correct 87 ms 320 KB Output is correct
39 Correct 77 ms 304 KB Output is correct
40 Correct 95 ms 328 KB Output is correct
41 Correct 77 ms 412 KB Output is correct
42 Correct 81 ms 320 KB Output is correct
43 Correct 72 ms 328 KB Output is correct
44 Correct 86 ms 296 KB Output is correct
45 Correct 77 ms 328 KB Output is correct
46 Correct 87 ms 312 KB Output is correct
47 Correct 108 ms 404 KB Output is correct
48 Correct 95 ms 428 KB Output is correct
49 Correct 75 ms 304 KB Output is correct
50 Correct 108 ms 320 KB Output is correct
51 Correct 101 ms 444 KB Output is correct
52 Correct 93 ms 320 KB Output is correct
53 Correct 103 ms 292 KB Output is correct
54 Correct 90 ms 420 KB Output is correct
55 Correct 106 ms 308 KB Output is correct
56 Correct 91 ms 308 KB Output is correct
57 Correct 84 ms 436 KB Output is correct
58 Correct 86 ms 416 KB Output is correct
59 Correct 96 ms 328 KB Output is correct
60 Correct 119 ms 320 KB Output is correct