oj.uz

Submission #416395

# Submission time Handle Problem Language Result Execution time Memory
416395 2021-06-02T11:01:09 Z NintsiChkhaidze Xylophone (JOI18_xylophone) C++14
0 / 100
 0 ms 328 KB 
#include <iostream>
#include "xylophone.h"
using namespace std;

int a[5005];
void solve(int n) {
    a[1] = 0,a[2] = query(1,2);
    int x = a[2];
    for (int i=2;i<n;i++){
        int y = query(i,i+1),z = query(i-1,i+1);
        if (x + y == z){
            if (a[i] > a[i - 1]) a[i + 1] = a[i] + y;
            else a[i + 1] = a[i] - y;
        }
        else{
            if (a[i] > a[i - 1]) a[i + 1] = a[i] - y;
            else a[i + 1] = a[i] + y;
        }
        x = y;
    }
    int ind1=0,ind2=0,maxx = -1e9,minn = 1e9;
    for (int i=1;i<=n;i++){
        if (a[i] < minn) ind1 = i,minn = a[i];
        if (a[i] > maxx) ind2 = i,maxx = a[i];
    }
    minn = 1e9;
    if (ind2 < ind1){
        for (int i=1;i<=n;i++)
            a[i] = -a[i];
        minn = -maxx;
    }
    for (int i=1;i<=n;i++)
        answer(i,a[i] + 1 - minn);
}

Subtask #1
0 / 11.0

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

Subtask #2
0 / 36.0

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

Subtask #3
0 / 53.0

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