Submission #860882

#TimeUsernameProblemLanguageResultExecution timeMemory
860882EntityPlanttXylophone (JOI18_xylophone)C++14
11 / 100
5 ms440 KiB
#include "xylophone.h"
#include <bits/stdc++.h>
using namespace std;
int a[500];
void solve(int n) {
    int x, y, i, u, v, mn;
    a[2] = query(1, 2);
    for (i = 2; i < n; i++) {
        x = query(i, i + 1); y = query(i - 1, i + 1);
        a[i + 1] = a[i] + x * (a[i] - a[i - 1] < 0 ? 1 : -1) * (y == x + abs(a[i] - a[i - 1]) ? -1 : 1);
    }
    mn = *min_element(a + 1, a + n + 1);
    for (i = 1; i <= n; i++) {
        a[i] -= mn;
        if (!a[i]) u = i;
        if (a[i] == n - 1) v = i;
    }
    bool flag = u < v;
    for (int i = 1; i <= n; i++) answer(i, flag ? a[i] + 1 : n - a[i]);
}

Compilation message (stderr)

xylophone.cpp: In function 'void solve(int)':
xylophone.cpp:19:40: warning: 'v' may be used uninitialized in this function [-Wmaybe-uninitialized]
   19 |     for (int i = 1; i <= n; i++) answer(i, flag ? a[i] + 1 : n - a[i]);
      |                                  ~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
xylophone.cpp:19:40: warning: 'u' may be used uninitialized in this function [-Wmaybe-uninitialized]
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...