oj.uz

Submission #788009

# Submission time Handle Problem Language Result Execution time Memory
788009 2023-07-19T16:06:10 Z Rafi22 Xylophone (JOI18_xylophone) C++14
100 / 100
 55 ms 452 KB 
#include <bits/stdc++.h>
#include "xylophone.h"
 
using namespace std;
 
#define endl '\n'
#define st first
#define nd second
#define pb push_back
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
#define ll long long
ll mod=1000000007;
int inf=1000000007;
ll infl=1000000000000000007;
 
const int N=5007;
 
int a[N];
bool is[N];
 
void Set(int i,int x)
{
    a[i]=x;
    is[x]=1;
}
 
void solve(int n)
{
    int l=1,r=n,sr,k;
    while(l<=r)
    {
        sr=(l+r)/2;
        if(query(sr,n)==n-1)
        {
            k=sr;
            l=sr+1;
        }
        else r=sr-1;
    }
    Set(k,1);
    if(k+1<=n) Set(k+1,query(k,k+1)+1);
    for(int i=k+2;i<=n;i++)
    {
        int d=query(i-1,i);
        if(a[i-1]-d<1||is[a[i-1]-d]) Set(i,a[i-1]+d);
        else if(a[i-1]+d>n||is[a[i-1]+d]) Set(i,a[i-1]-d);
        else
        {
            int l=query(i-2,i);
            if(l==max(d,abs(a[i-1]-a[i-2])))
            {
                if(a[i-2]<a[i-1]) Set(i,a[i-1]-d);
                else Set(i,a[i-1]+d);
            }
            else
            {
                if(a[i-2]<a[i-1]) Set(i,a[i-1]+d);
                else Set(i,a[i-1]-d);
            }
        }
    }
    if(k-1>0) Set(k-1,query(k-1,k)+1);
    for(int i=k-2;i>0;i--)
    {
        int d=query(i,i+1);
        if(a[i+1]-d<1||is[a[i+1]-d]) Set(i,a[i+1]+d);
        else if(a[i+1]+d>n||is[a[i+1]+d]) Set(i,a[i+1]-d);
        else
        {
            int l=query(i,i+2);
            if(l==max(d,abs(a[i+1]-a[i+2])))
            {
                if(a[i+2]<a[i+1]) Set(i,a[i+1]-d);
                else Set(i,a[i+1]+d);
            }
            else
            {
                if(a[i+2]<a[i+1]) Set(i,a[i+1]+d);
                else Set(i,a[i+1]-d);
            }
        }
    }
    for(int i=1;i<=n;i++) answer(i,a[i]);
}
/*
int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    solve()
 
 
 
 
    return 0;
}*/

Compilation message

xylophone.cpp: In function 'void solve(int)':
xylophone.cpp:63:28: warning: 'k' may be used uninitialized in this function [-Wmaybe-uninitialized]
   63 |     if(k-1>0) Set(k-1,query(k-1,k)+1);
      |                       ~~~~~^~~~~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 2 ms 208 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 1 ms 208 KB Output is correct
7 Correct 1 ms 208 KB Output is correct
8 Correct 1 ms 208 KB Output is correct
9 Correct 1 ms 308 KB Output is correct
10 Correct 1 ms 208 KB Output is correct
11 Correct 1 ms 208 KB Output is correct
12 Correct 1 ms 208 KB Output is correct
13 Correct 1 ms 296 KB Output is correct
14 Correct 2 ms 208 KB Output is correct
15 Correct 2 ms 208 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 0 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 2 ms 208 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 1 ms 208 KB Output is correct
7 Correct 1 ms 208 KB Output is correct
8 Correct 1 ms 208 KB Output is correct
9 Correct 1 ms 308 KB Output is correct
10 Correct 1 ms 208 KB Output is correct
11 Correct 1 ms 208 KB Output is correct
12 Correct 1 ms 208 KB Output is correct
13 Correct 1 ms 296 KB Output is correct
14 Correct 2 ms 208 KB Output is correct
15 Correct 2 ms 208 KB Output is correct
16 Correct 2 ms 208 KB Output is correct
17 Correct 5 ms 308 KB Output is correct
18 Correct 10 ms 208 KB Output is correct
19 Correct 9 ms 308 KB Output is correct
20 Correct 9 ms 312 KB Output is correct
21 Correct 11 ms 208 KB Output is correct
22 Correct 12 ms 296 KB Output is correct
23 Correct 9 ms 308 KB Output is correct
24 Correct 9 ms 208 KB Output is correct
25 Correct 7 ms 312 KB Output is correct
26 Correct 10 ms 296 KB Output is correct
27 Correct 11 ms 304 KB Output is correct
28 Correct 10 ms 308 KB Output is correct
29 Correct 9 ms 208 KB Output is correct
30 Correct 11 ms 312 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 0 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 2 ms 208 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 1 ms 208 KB Output is correct
7 Correct 1 ms 208 KB Output is correct
8 Correct 1 ms 208 KB Output is correct
9 Correct 1 ms 308 KB Output is correct
10 Correct 1 ms 208 KB Output is correct
11 Correct 1 ms 208 KB Output is correct
12 Correct 1 ms 208 KB Output is correct
13 Correct 1 ms 296 KB Output is correct
14 Correct 2 ms 208 KB Output is correct
15 Correct 2 ms 208 KB Output is correct
16 Correct 2 ms 208 KB Output is correct
17 Correct 5 ms 308 KB Output is correct
18 Correct 10 ms 208 KB Output is correct
19 Correct 9 ms 308 KB Output is correct
20 Correct 9 ms 312 KB Output is correct
21 Correct 11 ms 208 KB Output is correct
22 Correct 12 ms 296 KB Output is correct
23 Correct 9 ms 308 KB Output is correct
24 Correct 9 ms 208 KB Output is correct
25 Correct 7 ms 312 KB Output is correct
26 Correct 10 ms 296 KB Output is correct
27 Correct 11 ms 304 KB Output is correct
28 Correct 10 ms 308 KB Output is correct
29 Correct 9 ms 208 KB Output is correct
30 Correct 11 ms 312 KB Output is correct
31 Correct 24 ms 296 KB Output is correct
32 Correct 32 ms 304 KB Output is correct
33 Correct 49 ms 300 KB Output is correct
34 Correct 22 ms 312 KB Output is correct
35 Correct 53 ms 452 KB Output is correct
36 Correct 47 ms 304 KB Output is correct
37 Correct 44 ms 308 KB Output is correct
38 Correct 41 ms 296 KB Output is correct
39 Correct 44 ms 304 KB Output is correct
40 Correct 43 ms 304 KB Output is correct
41 Correct 50 ms 300 KB Output is correct
42 Correct 24 ms 304 KB Output is correct
43 Correct 42 ms 300 KB Output is correct
44 Correct 28 ms 308 KB Output is correct
45 Correct 55 ms 376 KB Output is correct
46 Correct 42 ms 300 KB Output is correct
47 Correct 50 ms 292 KB Output is correct
48 Correct 53 ms 300 KB Output is correct
49 Correct 42 ms 320 KB Output is correct
50 Correct 38 ms 428 KB Output is correct
51 Correct 55 ms 300 KB Output is correct
52 Correct 37 ms 304 KB Output is correct
53 Correct 37 ms 316 KB Output is correct
54 Correct 41 ms 304 KB Output is correct
55 Correct 36 ms 300 KB Output is correct
56 Correct 55 ms 300 KB Output is correct
57 Correct 47 ms 308 KB Output is correct
58 Correct 35 ms 332 KB Output is correct
59 Correct 39 ms 296 KB Output is correct
60 Correct 45 ms 304 KB Output is correct