oj.uz

Submission #709628

# Submission time Handle Problem Language Result Execution time Memory
709628 2023-03-14T03:47:31 Z Spade1 Xylophone (JOI18_xylophone) C++14
0 / 100
 1 ms 208 KB 
#include <bits/stdc++.h>
//#include "grader.cpp"
#include "xylophone.h"
using namespace std;

int Ar[5050];
bool mark[5050];

void solve(int N) {
    int idx;
    int l = 1, r = N;
    while (l < r) {
        int mid = (l+r)/2;
        if (query(mid+1, N) == N-1) l = mid+1;
        else r = mid;
    }
    idx = l;
    Ar[idx] = 1;
    mark[idx] = 1;

    for (int i = idx+1; i <= N; ++i) {
        int dif = query(i-1, i), cur;
        if (Ar[i-1]+dif>N || mark[Ar[i-1]+dif]) {
            cur = Ar[i-1]-dif;
        }
        else if (Ar[i-1]-dif<1 || mark[Ar[i-1]-dif]) {
            cur = Ar[i-1]+dif;
        }
        else {
            int dif2 = query(i-2, i);
            if (Ar[i-2] > Ar[i-1]+dif){
                if (Ar[i-2] - Ar[i-1] == dif2) cur = Ar[i-1]+dif;
            }
            if (Ar[i-2] < Ar[i-1]+dif) {
                if (Ar[i-1]+dif - min(Ar[i-2], Ar[i-1]) == dif2) cur = Ar[i-1]+dif;
            }
            if (Ar[i-2] > Ar[i-1]-dif){
                if (max(Ar[i-2], Ar[i-1]) - Ar[i-1]+dif == dif2) cur = Ar[i-1]-dif;
            }
            if (Ar[i-2] < Ar[i-1]-dif) {
                if (Ar[i-1] - Ar[i-2] == dif2) cur = Ar[i-1]-dif;
            }
        }
        Ar[i] = cur;
        mark[cur] = 1;
    }

    for (int i = idx-1; i >= 1; --i) {
        int dif = query(i, i+1), cur;
        if (Ar[i+1]+dif>N || mark[Ar[i+1]+dif]) {
            cur = Ar[i+1]-dif;
        }
        else if (Ar[i+1]-dif<1 || mark[Ar[i+1]-dif]) {
            cur = Ar[i+1]+dif;
        }
        else {
            int dif2 = query(i-2, i);
            if (Ar[i+2] > Ar[i+1]+dif){
                if (Ar[i+2] - Ar[i+1] == dif2) cur = Ar[i+1]+dif;
            }
            if (Ar[i+2] < Ar[i+1]+dif) {
                if (Ar[i+1]+dif - min(Ar[i+2], Ar[i+1]) == dif2) cur = Ar[i+1]+dif;
            }
            if (Ar[i+2] > Ar[i+1]-dif){
                if (max(Ar[i+2], Ar[i+1]) - Ar[i+1]+dif == dif2) cur = Ar[i+1]-dif;
            }
            if (Ar[i+2] < Ar[i+1]-dif) {
                if (Ar[i+1] - Ar[i+2] == dif2) cur = Ar[i+1]-dif;
            }
        }
        Ar[i] = cur;
        mark[cur] = 1;
    }

    for (int i = 1; i <= N; ++i) {
        answer(i, Ar[i]);
    }
}

Compilation message

xylophone.cpp: In function 'void solve(int)':
xylophone.cpp:71:15: warning: 'cur' may be used uninitialized in this function [-Wmaybe-uninitialized]
   71 |         Ar[i] = cur;
      |         ~~~~~~^~~~~
xylophone.cpp:44:15: warning: 'cur' may be used uninitialized in this function [-Wmaybe-uninitialized]
   44 |         Ar[i] = cur;
      |         ~~~~~~^~~~~

Subtask #1
0 / 11.0

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

Subtask #2
0 / 36.0

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

Subtask #3
0 / 53.0

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