제출 #502321

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
502321		vrohak	Xylophone (JOI18_xylophone)	C++14	0 / 100	0 ms	200 KiB

xylophone

#include <bits/stdc++.h>
 
#include "xylophone.h"
 
using namespace std;
 
void solve(int n) {
   // ako je x pozitivan //ako je x pozitivan //ako je x pozitivan //ako je x
   // pozitivan //ako je x pozitivan //ako je x pozitivan //ako je x pozitivan
   // //ako je x pozitivan
 
   int rj1[n+1], rj2[n+1];
   int d[n+1], t[n+1], odg1, odg2, odg3;
  bool sss=true;
  
  for(int i=1;i<=n;i++){
    d[i] = query(i, i+1);
    if(i!=1) t[i] = query(i-1, i+1);
  }
 
   odg2=d[0];
 
   rj1[1] = 0; rj1[2] = odg2;
  
   for (int i = 3; i <= n; i++) {
      odg1 = d[i-2];
      odg2 = d[i-1];
 	  odg3 = t[i-1];
      if(odg1+odg2 != odg3){
        sss = !sss;
      }
      rj1[i] = rj1[i-1] + odg2 * (sss * 2 - 1);
   }
 
   int mn = 0, mx=0;
   for (int i = 1; i <= n; i++) {
      mn = min(mn, rj1[i]);
      mx = max(mx, rj1[i]);
   }
   mn = abs(mn) + 1;
   for (int i = 1; i <= n; i++) {
     rj2[i] = mx-rj1[i]+1;
      rj1[i] = rj1[i] + mn;
   }
 
   int idx1, idxn;
   for (int i = 1; i <= n; i++) {
      if(rj1[i] == 1) idx1 = i;
      if(rj1[i] == n) idxn = i;
   }
 
   if (idx1 < idxn) {
      for (int i = 1; i <= n; i++) {
         answer(i, rj1[i]);
      }
   } else {
      for (int i = 1; i <= n; i++) {
         answer(i, rj2[i]);
      }
   }
 
   return;
}

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

xylophone.cpp: In function 'void solve(int)':
xylophone.cpp:52:4: warning: 'idx1' may be used uninitialized in this function [-Wmaybe-uninitialized]
   52 |    if (idx1 < idxn) {
      |    ^~
xylophone.cpp:52:4: warning: 'idxn' may be used uninitialized in this function [-Wmaybe-uninitialized]

• Subtask 1: 0 / 11
• Subtask 2: 0 / 36
• Subtask 3: 0 / 53