oj.uz

Submission #861106

# Submission time Handle Problem Language Result Execution time Memory
861106 2023-10-15T10:14:29 Z vjudge1 Xylophone (JOI18_xylophone) C++
0 / 100
 1 ms 344 KB 
#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

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]

Subtask #1
0 / 11.0

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

Subtask #2
0 / 36.0

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

Subtask #3
0 / 53.0

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