oj.uz

Submission #210346

# Submission time Handle Problem Language Result Execution time Memory
210346 2020-03-17T06:12:13 Z HNO2 Xylophone (JOI18_xylophone) C++17
47 / 100
 89 ms 532 KB 
#include <bits/stdc++.h>
#include "xylophone.h"
using namespace std;

typedef long long ll;
const int maxn=1e6+7;
const int inf=INT_MAX;
const ll inff=1e18;
const ll mod=1e9+7;
#define pii pair<int,int>
#define mkp make_pair
#define F first
#define S second
#define pb push_back
#define sz(v) ((int)(v).size())
#define all(v) (v).begin(),(v).end()
//#define int ll

#ifdef HNO2
#define IOS
#else
#define endl '\n'
#define IOS ios::sync_with_stdio(0); cin.tie(0);
#endif // HNO2

int ans[5007];
int used[5007];

void solve(int n)
{
    int L=1,R=n;
    while (R-L>1)
    {
        int M=(L+R)>>1;
        if (query(M,n)!=n-1) R=M;
        else L=M;
    }

    int _1_at=L;
    ans[_1_at]=1;
    if (_1_at!=n)
        ans[_1_at+1]=query(_1_at,_1_at+1)+1;
    if (_1_at!=1)
        ans[_1_at-1]=query(_1_at-1,_1_at)+1;
    for (int i=_1_at+1;i<=n-1;i++)
    {
        int tmp1=query(i,i+1),tmp2=query(i-1,i+1);
        if (tmp2==tmp1+abs(ans[i]-ans[i-1]))
        {
            if (ans[i]>ans[i-1]) ans[i+1]=ans[i-1]+tmp2;
            else ans[i+1]=ans[i-1]-tmp2;
        }
        else
        {
            if (ans[i]>ans[i-1]) ans[i+1]=ans[i]-tmp1;
            else ans[i+1]=ans[i]+tmp1;
        }
    }
    for (int i=_1_at;i<=n;i++) used[ans[i]]=1;
    for (int i=_1_at-1;i>=2;i--)
    {
        int tmp1=query(i-1,i);
        if (ans[i]-tmp1<1||used[ans[i]-tmp1])
        {
            ans[i-1]=ans[i]+tmp1;
            used[ans[i-1]]=1;
            continue;
        }
        if (ans[i]-tmp1>n||used[ans[i]+tmp1])
        {
            ans[i-1]=ans[i]-tmp1;
            used[ans[i-1]]=1;
            continue;
        }
        int tmp2=query(i-1,i+1);
        if (tmp2==tmp1+abs(ans[i]-ans[i+1]))
        {
            if (ans[i]>ans[i+1]) ans[i-1]=ans[i+1]+tmp2;
            else ans[i-1]=ans[i+1]-tmp2;
        }
        else
        {
            if (ans[i]>ans[i+1]) ans[i-1]=ans[i]-tmp1;
            else ans[i-1]=ans[i]+tmp1;
        }
        used[ans[i-1]]=1;
    }
    for (int i=1;i<=n;i++) answer(i,ans[i]);
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 248 KB Output is correct
3 Correct 5 ms 256 KB Output is correct
4 Correct 6 ms 248 KB Output is correct
5 Correct 6 ms 376 KB Output is correct
6 Correct 7 ms 248 KB Output is correct
7 Correct 6 ms 248 KB Output is correct
8 Correct 6 ms 248 KB Output is correct
9 Correct 7 ms 376 KB Output is correct
10 Correct 7 ms 376 KB Output is correct
11 Correct 7 ms 248 KB Output is correct
12 Correct 7 ms 376 KB Output is correct
13 Correct 6 ms 248 KB Output is correct
14 Correct 6 ms 376 KB Output is correct
15 Correct 6 ms 248 KB Output is correct

Subtask #2
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 248 KB Output is correct
3 Correct 5 ms 256 KB Output is correct
4 Correct 6 ms 248 KB Output is correct
5 Correct 6 ms 376 KB Output is correct
6 Correct 7 ms 248 KB Output is correct
7 Correct 6 ms 248 KB Output is correct
8 Correct 6 ms 248 KB Output is correct
9 Correct 7 ms 376 KB Output is correct
10 Correct 7 ms 376 KB Output is correct
11 Correct 7 ms 248 KB Output is correct
12 Correct 7 ms 376 KB Output is correct
13 Correct 6 ms 248 KB Output is correct
14 Correct 6 ms 376 KB Output is correct
15 Correct 6 ms 248 KB Output is correct
16 Correct 10 ms 320 KB Output is correct
17 Correct 14 ms 248 KB Output is correct
18 Correct 16 ms 324 KB Output is correct
19 Correct 19 ms 376 KB Output is correct
20 Correct 22 ms 248 KB Output is correct
21 Correct 20 ms 248 KB Output is correct
22 Correct 23 ms 376 KB Output is correct
23 Correct 23 ms 376 KB Output is correct
24 Correct 21 ms 248 KB Output is correct
25 Correct 22 ms 248 KB Output is correct
26 Correct 21 ms 248 KB Output is correct
27 Correct 19 ms 376 KB Output is correct
28 Correct 22 ms 376 KB Output is correct
29 Correct 21 ms 376 KB Output is correct
30 Correct 22 ms 376 KB Output is correct

Subtask #3
0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 248 KB Output is correct
3 Correct 5 ms 256 KB Output is correct
4 Correct 6 ms 248 KB Output is correct
5 Correct 6 ms 376 KB Output is correct
6 Correct 7 ms 248 KB Output is correct
7 Correct 6 ms 248 KB Output is correct
8 Correct 6 ms 248 KB Output is correct
9 Correct 7 ms 376 KB Output is correct
10 Correct 7 ms 376 KB Output is correct
11 Correct 7 ms 248 KB Output is correct
12 Correct 7 ms 376 KB Output is correct
13 Correct 6 ms 248 KB Output is correct
14 Correct 6 ms 376 KB Output is correct
15 Correct 6 ms 248 KB Output is correct
16 Correct 10 ms 320 KB Output is correct
17 Correct 14 ms 248 KB Output is correct
18 Correct 16 ms 324 KB Output is correct
19 Correct 19 ms 376 KB Output is correct
20 Correct 22 ms 248 KB Output is correct
21 Correct 20 ms 248 KB Output is correct
22 Correct 23 ms 376 KB Output is correct
23 Correct 23 ms 376 KB Output is correct
24 Correct 21 ms 248 KB Output is correct
25 Correct 22 ms 248 KB Output is correct
26 Correct 21 ms 248 KB Output is correct
27 Correct 19 ms 376 KB Output is correct
28 Correct 22 ms 376 KB Output is correct
29 Correct 21 ms 376 KB Output is correct
30 Correct 22 ms 376 KB Output is correct
31 Correct 44 ms 248 KB Output is correct
32 Correct 55 ms 248 KB Output is correct
33 Correct 70 ms 376 KB Output is correct
34 Correct 70 ms 376 KB Output is correct
35 Correct 80 ms 532 KB Output is correct
36 Incorrect 89 ms 376 KB Wrong Answer [2]
37 Halted 0 ms 0 KB -