oj.uz

Submission #556836

# Submission time Handle Problem Language Result Execution time Memory
556836 2022-05-04T03:13:17 Z fcmalkcin Xylophone (JOI18_xylophone) C++17
100 / 100
 68 ms 560 KB 
#include "xylophone.h"

#include <bits/stdc++.h>
using namespace std;

#define ll  int
#define pll pair<ll,ll>
#define ff first
#define ss second
#define pb push_back
#define endl "\n"
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());

const ll maxn=1e5+50;
const ll mod=1e9+7  ;
const ll base=1e9;
/// have a medal in APIO
/// goal 6/7

ll res[maxn];
bool dd[maxn];

bool chk(vector<ll> vt,ll mx,ll n)
{
    ll h=base;
    ll h1=-1;
    for (auto to:vt)
    {
        if (to>=1&&to<=n)
        {
            h1=max(h1,to);
            h=min(h,to);
        }
        else
        {
            return false;
        }
    }
    if (dd[vt[0]]) return false;
    if (h1-h!=mx)
        return false;
    return true;
}
void solve(ll n)
{
    ll l=1, h=n;
    while (l<=h)
    {
        ll mid=(l+h)/2;
        if (query(mid,n)!=n-1)
            h=mid-1;
        else
            l=mid+1;
    }
    ll p=h;
    res[p]=1;
    dd[1]=1;
    if (p>1)
    {
        res[p-1]=query(p-1,p)+1;
        dd[res[p-1]]=1;
    }
    for (int i=p-2; i>=1; i--)
    {
        ll h=query(i,i+1);
        vector<ll> vt;
        vt.pb(res[i+1]-h);
        vt.pb(res[i+1]+h);
        vector<ll> vt2;
        for (auto to:vt)
        {
            vector<ll> vt1;
            vt1.pb(to);
            vt1.pb(res[i+1]);
            if (chk(vt1,h,n))
            {
                vt2.pb(to);
            }
        }
        if (vt2.size()==2)
        {
            ll h=query(i,i+2);
            vt.clear();
            for (auto to:vt2)
            {
                vector<ll> vt1;
                vt1.pb(to);
                vt1.pb(res[i+1]);
                vt1.pb(res[i+2]);
                if (chk(vt1,h,n))
                {
                    vt.pb(to);
                }
            }
            assert(vt.size()==1);
            res[i]=vt.back();
        }
        else
        {
            res[i]=vt2.back();
        }
        dd[res[i]]=1;
    }
    if (p<n)
    {
        res[p+1]=query(p,p+1)+1;
        dd[res[p+1]]=1;
    }
    for (int i=p+2; i<=n; i++)
    {
        ll h=query(i-1,i);
        vector<ll> vt;
        vt.pb(res[i-1]-h);
        vt.pb(res[i-1]+h);
        vector<ll> vt2;
        for (auto to:vt)
        {
            vector<ll> vt1;
            vt1.pb(to);
            vt1.pb(res[i-1]);
            if (chk(vt1,h,n))
            {
                vt2.pb(to);
            }
        }
        if (vt2.size()==2)
        {
            ll h=query(i-2,i);
            vt.clear();
            for (auto to:vt2)
            {
                vector<ll> vt1;
                vt1.pb(to);
                vt1.pb(res[i-1]);
                vt1.pb(res[i-2]);
                if (chk(vt1,h,n))
                {
                    vt.pb(to);
                }
            }
            assert(vt.size()==1);
            res[i]=vt.back();
        }
        else
        {
            res[i]=vt2.back();
        }
        dd[res[i]]=1;
    }
    for (int i=1;i<=n;i++)
    {
        answer(i,res[i]);
    }
}

/*int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    if (fopen("CONVEXHULL.inp", "r"))
    {
        freopen("CONVEXHULL.inp", "r", stdin);
        freopen("CONVEXHULL.out", "w", stdout);
    }

}*/

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 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 1 ms 208 KB Output is correct
8 Correct 2 ms 208 KB Output is correct
9 Correct 2 ms 316 KB Output is correct
10 Correct 1 ms 208 KB Output is correct
11 Correct 1 ms 316 KB Output is correct
12 Correct 2 ms 208 KB Output is correct
13 Correct 2 ms 316 KB Output is correct
14 Correct 4 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 1 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 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 1 ms 208 KB Output is correct
8 Correct 2 ms 208 KB Output is correct
9 Correct 2 ms 316 KB Output is correct
10 Correct 1 ms 208 KB Output is correct
11 Correct 1 ms 316 KB Output is correct
12 Correct 2 ms 208 KB Output is correct
13 Correct 2 ms 316 KB Output is correct
14 Correct 4 ms 208 KB Output is correct
15 Correct 2 ms 208 KB Output is correct
16 Correct 3 ms 208 KB Output is correct
17 Correct 5 ms 208 KB Output is correct
18 Correct 10 ms 208 KB Output is correct
19 Correct 11 ms 208 KB Output is correct
20 Correct 13 ms 208 KB Output is correct
21 Correct 11 ms 208 KB Output is correct
22 Correct 10 ms 208 KB Output is correct
23 Correct 13 ms 208 KB Output is correct
24 Correct 9 ms 316 KB Output is correct
25 Correct 5 ms 312 KB Output is correct
26 Correct 14 ms 324 KB Output is correct
27 Correct 13 ms 324 KB Output is correct
28 Correct 11 ms 208 KB Output is correct
29 Correct 14 ms 208 KB Output is correct
30 Correct 12 ms 328 KB Output is correct

Subtask #3
53.0 / 53.0

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