제출 #145449

#제출 시각아이디문제언어결과실행 시간메모리
145449faremyXylophone (JOI18_xylophone)C++14
0 / 100
2 ms400 KiB
#include "xylophone.h" #include <iostream> #include <algorithm> static int A[5000]; const int MAXN = 5e3; int diff[MAXN]; int direction[MAXN]; int relAns[MAXN]; void solve(int N) { for (int i = 1; i < N; i++) diff[i - 1] = query(i, i + 1); direction[0] = 1; for (int i = 2; i < N; i++) { direction[i - 1] = direction[i - 2]; if (query(i - 1, i + 1) != diff[i - 2] + diff[i - 1]) direction[i - 1] *= -1; } for (int i = 1; i < N; i++) relAns[i] = relAns[i - 1] + diff[i - 1] * direction[i - 1]; if (query(1, N) != relAns[N - 1]) for (int i = 1; i < N; i++) relAns[i] *= -1; int min = 0; for (int i = 1; i < N; i++) min = std::min(min, relAns[i]); for (int i = 0; i < N; i++) answer(i + 1, relAns[i] - min + 1); }

컴파일 시 표준 에러 (stderr) 메시지

xylophone.cpp:7:12: warning: 'A' defined but not used [-Wunused-variable]
 static int A[5000];
            ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...