oj.uz

Submission #320798

# Submission time Handle Problem Language Result Execution time Memory
320798 2020-11-10T01:14:38 Z mohamedsobhi777 Xylophone (JOI18_xylophone) C++14
0 / 100
 1 ms 512 KB 
#include "xylophone.h"
#include <bits/stdc++.h>

using namespace std;

int n;

int a1;
int arr[10000 + 5];

void conLhs()
{
        if (a1 > 1)
                arr[a1 - 1] = query(a1 - 1, a1) + 1;
        for (int i = a1 - 2; i > 0; --i)
        {
                int q1 = query(i, i + 1);
                int q2 = abs(arr[i + 1] - arr[i + 2]);
                int q3 = query(i, i + 2);
                int sgn = ((q1 + q2 == q3 && arr[i + 1] > arr[i + 2]) ||
                                   (arr[i + 1] < arr[i + 2] && q1 + q2 != q3)
                               ? 1
                               : -1);
                arr[i] = arr[i + 1] + q1 * sgn;
        }
}

void conMhs()
{
        if (a1 + 1 <= n)
                arr[a1 + 1] = query(a1, a1 + 1) + 1;
        for (int i = a1 + 2; i <= n; ++i)
        {
                int q1 = query(i - 1, i);
                int q2 = abs(arr[i - 1] - arr[i - 2]);
                int q3 = query(i - 2, i);
                int sgn = ((q1 + q2 == q3 && arr[i - 1] > arr[i - 2]) ||
                                   (arr[i - 1] < arr[i - 2] && q1 + q2 != q3)
                               ? 1
                               : -1);
                arr[i] = arr[i - 1] + q1 * sgn;
        }
}

void solve(int N)
{
        n = N;
        int l = 1, r = N;
        while (l <= r)
        {
                int mid = (l + r) >> 1;
                if (query(mid, r) == N - 1)
                {
                        a1 = mid;
                        l = mid + 1;
                }
                else
                        r = mid - 1;
        }
        arr[a1] = 1;

        conLhs();
        conMhs();
        for (int i = 1; i <= N; ++i)
        {
                answer(i, arr[i]);
                //printf("%d ", arr[i]);
        }
}

Subtask #1
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 512 KB Output is correct
2 Incorrect 1 ms 364 KB Wrong Answer [1]
3 Halted 0 ms 0 KB -

Subtask #2
0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 512 KB Output is correct
2 Incorrect 1 ms 364 KB Wrong Answer [1]
3 Halted 0 ms 0 KB -

Subtask #3
0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 512 KB Output is correct
2 Incorrect 1 ms 364 KB Wrong Answer [1]
3 Halted 0 ms 0 KB -