oj.uz

Submission #704274

# Submission time Handle Problem Language Result Execution time Memory
704274 2023-03-02T02:32:35 Z Tuanlinh123 Xylophone (JOI18_xylophone) C++17
47 / 100
 90 ms 436 KB 
#include<bits/stdc++.h>
#include "xylophone.h"
#define ll int
using namespace std;

ll a[100005];
bool seen[100005];

ll calc(ll a, ll b, ll dis1, ll dis2)
{
    if (a<b)
    {
        if (dis1==dis2 || dis2==b-a)
            return a+dis1;
        return a-dis1;
    }
    if (dis1==dis2 || dis2==a-b)
        return a-dis1;
    return a+dis1;
}

void solve1(ll L, ll n)
{
    for (ll i=L-2; i>=1; i--)
    {
        ll val=query(i, i+1);
        if (a[i+1]-val<0 || seen[a[i+1]-val])
            a[i]=a[i+1]+val;
        else if (a[i+1]+val>n || seen[a[i+1]+val])
            a[i]=a[i+1]-val;
        else
            a[i]=calc(a[i+1], a[i+2], val, query(i, i+2));
        seen[a[i]]=1;
    }
}

void solve2(ll L, ll R, ll n)
{
    for (ll i=L+2; i<R; i++)
    {
        ll val=query(i-1, i);
        if (a[i-1]-val<0 || seen[a[i-1]-val])
            a[i]=a[i-1]+val;
        else if (a[i-1]+val>n || seen[a[i-1]+val])
            a[i]=a[i-1]-val;
        a[i]=calc(a[i-1], a[i-2], val, query(i-2, i));
        seen[a[i]]=1;
    }
}

void solve3(ll R, ll n)
{
    for (ll i=R+2; i<=n; i++)
    {
        ll val=query(i-1, i);
        if (a[i-1]-val<0 || seen[a[i-1]-val])
            a[i]=a[i-1]+val;
        else if (a[i-1]+val>n || seen[a[i-1]+val])
            a[i]=a[i-1]-val;
        a[i]=calc(a[i-1], a[i-2], val, query(i-2, i));
        seen[a[i]]=1;
    }
}

void solve(ll n)
{
//    freopen("output.txt", "w", stdout);
    srand((ll)time(0));
    ll L=1, R=n;
    ll lo=L, hi=R, val=query(lo, hi);
    while (hi-lo>1)
    {
        ll mid=(hi+lo)/2;
        if (query(L, mid)!=val)
            lo=mid;
        else hi=mid;
    }
    if (query(L, lo)!=val)
        R=hi;
    else R=lo;
    lo=L, hi=R;
    while (hi-lo>1)
    {
        ll mid=(hi+lo)/2;
        if (query(mid, R)!=val)
            hi=mid;
        else lo=mid;
    }
    if (query(hi, R)!=val)
        L=lo;
    else R=hi;
    a[L]=1; a[R]=n;
//    cout << L << " " << R << "\n";
    if (L>1) a[L-1]=a[L]+query(L-1, L);
    a[L+1]=a[L]+query(L, L+1);
    if (R<n) a[R+1]=a[R]-query(R, R+1);
    ll order[3];
    order[0]=0, order[1]=1, order[2]=2;
    for (ll i=1; i<=10; i++)
    {
        ll l=abs(rand())%3, r=abs(rand())%3;
        swap(order[l], order[r]);
    }
    for (ll i=0; i<3; i++)
    {
        ll t=order[i];
        if (t==0)
            solve1(L, n);
        else if (t==1)
            solve2(L, R, n);
        else solve3(R, n);
    }
//    for (ll i=0; i<3; i++)
//        cout << order[i] << " ";
//    cout << "\n";
//    for (ll i=1; i<=n; i++)
//        cout << a[i] << " ";
//    cout << "\n";
    for (ll i=1; i<=n; i++)
        answer(i, a[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 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 1 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 3 ms 256 KB Output is correct
8 Correct 2 ms 208 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 208 KB Output is correct
12 Correct 2 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 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 1 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 1 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 3 ms 256 KB Output is correct
8 Correct 2 ms 208 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 208 KB Output is correct
12 Correct 2 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 2 ms 208 KB Output is correct
16 Correct 2 ms 208 KB Output is correct
17 Correct 9 ms 208 KB Output is correct
18 Correct 13 ms 208 KB Output is correct
19 Correct 14 ms 208 KB Output is correct
20 Correct 21 ms 208 KB Output is correct
21 Correct 15 ms 312 KB Output is correct
22 Correct 19 ms 208 KB Output is correct
23 Correct 14 ms 320 KB Output is correct
24 Correct 9 ms 312 KB Output is correct
25 Correct 19 ms 208 KB Output is correct
26 Correct 18 ms 208 KB Output is correct
27 Correct 14 ms 300 KB Output is correct
28 Correct 16 ms 308 KB Output is correct
29 Correct 18 ms 208 KB Output is correct
30 Correct 21 ms 208 KB Output is correct

Subtask #3
0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 1 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 3 ms 256 KB Output is correct
8 Correct 2 ms 208 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 208 KB Output is correct
12 Correct 2 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 2 ms 208 KB Output is correct
16 Correct 2 ms 208 KB Output is correct
17 Correct 9 ms 208 KB Output is correct
18 Correct 13 ms 208 KB Output is correct
19 Correct 14 ms 208 KB Output is correct
20 Correct 21 ms 208 KB Output is correct
21 Correct 15 ms 312 KB Output is correct
22 Correct 19 ms 208 KB Output is correct
23 Correct 14 ms 320 KB Output is correct
24 Correct 9 ms 312 KB Output is correct
25 Correct 19 ms 208 KB Output is correct
26 Correct 18 ms 208 KB Output is correct
27 Correct 14 ms 300 KB Output is correct
28 Correct 16 ms 308 KB Output is correct
29 Correct 18 ms 208 KB Output is correct
30 Correct 21 ms 208 KB Output is correct
31 Correct 26 ms 308 KB Output is correct
32 Correct 39 ms 292 KB Output is correct
33 Correct 73 ms 328 KB Output is correct
34 Correct 35 ms 312 KB Output is correct
35 Correct 73 ms 436 KB Output is correct
36 Incorrect 90 ms 304 KB Wrong Answer [2]
37 Halted 0 ms 0 KB -