Submission #155133

#	Time	Username	Problem	Language	Result	Execution time	Memory
155133		karma	Xylophone (JOI18_xylophone)	C++14	0 / 100	2 ms	376 KiB

xylophone

#include "xylophone.h"
#include<bits/stdc++.h>
#define ll       long long

using namespace std;

const int N = 5005;
int a[N], d[2][N], mx, mn;

void solve(int n) {
     a[0] = 0;
     for(int i = 1; i < n; ++i) d[1][i - 1] = query(i, i + 1);
     for(int i = 2; i < n; ++i) d[2][i - 2] = query(i - 1, i + 1);
     a[1] = d[1][0]; bool up = 1;
     for(int i = 2; i < n; ++i) {
        if(d[1][i - 1] + d[1][i - 2] != d[2][i - 2]) up ^= 1;
        a[i] = a[i - 1] + (2 * up - 1) * d[1][i - 1];
     }
     mx = mn = 0;
     for(int i = 1; i < n; ++i) {
        if(a[mx] < a[i]) mx = i;
        if(a[mn] > a[i]) mn = i;
     }
     if(mn < mx) {
        mn = a[mn];
        for(int i = 0; i < n; ++i) answer(i + 1, a[i] - mn + 1);
     } else {
        mx = a[mx];
        for(int i = 0; i < n; ++i) answer(i + 1, mx - a[i] + 1);
     }
}

Compilation message (stderr)

xylophone.cpp: In function 'void solve(int)':
xylophone.cpp:13:36: warning: array subscript is above array bounds [-Warray-bounds]
      for(int i = 2; i < n; ++i) d[2][i - 2] = query(i - 1, i + 1);
                                 ~~~^
xylophone.cpp:16:44: warning: array subscript is above array bounds [-Warray-bounds]
         if(d[1][i - 1] + d[1][i - 2] != d[2][i - 2]) up ^= 1;
                                         ~~~^

• Subtask 1: 0 / 11
• Subtask 2: 0 / 36
• Subtask 3: 0 / 53