Submission #861106

#TimeUsernameProblemLanguageResultExecution timeMemory
861106vjudge1Xylophone (JOI18_xylophone)C++98
0 / 100
1 ms344 KiB
#include "xylophone.h" #include <bits/stdc++.h> using namespace std; void solve(int n) { int A[n + 1]; A[2] = query(1, 2); for (int i = 2; i < n; i++) { int x = query(i, i + 1); int 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); } int mn = *min_element(A + 1, A + n + 1); int u, v; for (int 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:21:40: warning: 'u' may be used uninitialized in this function [-Wmaybe-uninitialized]
   21 |     for (int i = 1; i <= n; i++) answer(i, flag ? A[i] + 1 : n - A[i]);
      |                                  ~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
xylophone.cpp:21:40: warning: 'v' 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...