oj.uz

Submission #67545

# Submission time Handle Problem Language Result Execution time Memory
67545 2018-08-14T21:23:40 Z JustasZ Xylophone (JOI18_xylophone) C++14
0 / 100
 2 ms 248 KB 
#include "xylophone.h"
#include <bits/stdc++.h>
#define pb push_back
#define all(a) a.begin(), a.end()
#define sz(a) (int)a.size()
#define x first
#define y second
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int>pii;
const int maxn=1e5+100;
void solve(int n)
{
    int arr[maxn];
    int two[maxn], three[maxn], sgn[maxn];
    for(int i=1; i<=n-1; i++)
        two[i]=query(i, i+1);
    for(int i=1; i<=n-2; i++)
        three[i]=query(i, i+2);
    if(three[1]==two[1]+two[2])
        sgn[1]=sgn[2]=1;
    else sgn[1]=1, sgn[2]=-1;
    for(int i=3; i<=n-1; i++)
    {
        if(two[i-1]+two[i]!=three[i-1])
            sgn[i]=-sgn[i-1];
        else sgn[i]=sgn[i-1];
    }
    arr[1]=1;
    int mn=INT_MAX;
    for(int i=2; i<=n; i++)
    {
        arr[i]=arr[i-1]+sgn[i-1]*two[i-1];
        mn=min(mn, arr[i]);
    }
    int add=1-mn;
    for(int i=1; i<=n; i++)
        arr[i]+=add;
    for(int i=1; i<=n; i++)
    {
        if(arr[i]==1)break;
        if(arr[i]==n)
        {
            for(int j=1; j<=n; j++)
                arr[j]=n-arr[j]+1;
            break;
        }
    }
    for(int i=1; i<=n; i++)
        answer(i, arr[i]);
}

Subtask #1
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 248 KB Wrong Answer [4]
2 Halted 0 ms 0 KB -

Subtask #2
0 / 36.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 248 KB Wrong Answer [4]
2 Halted 0 ms 0 KB -

Subtask #3
0 / 53.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 248 KB Wrong Answer [4]
2 Halted 0 ms 0 KB -