제출 #155133

#제출 시각아이디문제언어결과실행 시간메모리
155133karmaXylophone (JOI18_xylophone)C++14
0 / 100
2 ms376 KiB
#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); } }

컴파일 시 표준 에러 (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;
                                         ~~~^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...