제출 #702889

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
702889		hmm789	Xylophone (JOI18_xylophone)	C++14	47 / 100	71 ms	304 KiB

xylophone

#include "xylophone.h"

static int A[5000];

void solve(int n) {
	int a[n], ans[n+1];
	for(int i = 1; i < n; i++) a[i] = query(i, i+1);
	int l = 1, r = n;
	while(l < r) {
		int m = (l+r)/2;
		if(query(m, n) == n-1) l = m+1;
		else r = m;
	}
	ans[l-1] = 1;
	ans[l] = a[l-1]+1;
	for(int i = l+1; i <= n; i++) {
		int tmp = query(i-2, i);
		//~ printf("a %d %d %d %d %d\n", i, tmp, a[i-1], ans[i-2], ans[i-1]);
		if(tmp == a[i-1] && ans[i-2] > ans[i-1] || tmp > a[i-1] && tmp != a[i-2] && ans[i-2] < ans[i-1] || tmp > a[i-1] && tmp == a[i-2] && ans[i-2] > ans[i-1]) {
			ans[i] = ans[i-1]+a[i-1];
			//~ printf("b");
		}
		else {
			ans[i] = ans[i-1]-a[i-1];
			//~ printf("c");
		}
	}
	for(int i = l-2; i >= 1; i--) {
		int tmp = query(i, i+2);
		if(tmp == a[i] && ans[i+2] > ans[i+1] || tmp > a[i] && tmp != a[i+1] && ans[i+2] < ans[i+1] || tmp > a[i] && tmp == a[i+1] && ans[i+2] > ans[i+1]) ans[i] = ans[i+1]+a[i];
		else ans[i] = ans[i+1]-a[i];
	}
	//~ printf("%d\n", l);
	//~ for(int i = 1; i <= n; i++) printf("%d ", ans[i]);
	//~ printf("\n");
	for(int i = 1; i <= n; i++) answer(i, ans[i]);
}

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

xylophone.cpp: In function 'void solve(int)':
xylophone.cpp:19:20: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
   19 |   if(tmp == a[i-1] && ans[i-2] > ans[i-1] || tmp > a[i-1] && tmp != a[i-2] && ans[i-2] < ans[i-1] || tmp > a[i-1] && tmp == a[i-2] && ans[i-2] > ans[i-1]) {
      |      ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
xylophone.cpp:19:132: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
   19 |   if(tmp == a[i-1] && ans[i-2] > ans[i-1] || tmp > a[i-1] && tmp != a[i-2] && ans[i-2] < ans[i-1] || tmp > a[i-1] && tmp == a[i-2] && ans[i-2] > ans[i-1]) {
      |                                                                                                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
xylophone.cpp:30:18: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
   30 |   if(tmp == a[i] && ans[i+2] > ans[i+1] || tmp > a[i] && tmp != a[i+1] && ans[i+2] < ans[i+1] || tmp > a[i] && tmp == a[i+1] && ans[i+2] > ans[i+1]) ans[i] = ans[i+1]+a[i];
      |      ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
xylophone.cpp:30:126: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
   30 |   if(tmp == a[i] && ans[i+2] > ans[i+1] || tmp > a[i] && tmp != a[i+1] && ans[i+2] < ans[i+1] || tmp > a[i] && tmp == a[i+1] && ans[i+2] > ans[i+1]) ans[i] = ans[i+1]+a[i];
      |                                                                                                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
xylophone.cpp: At global scope:
xylophone.cpp:3:12: warning: 'A' defined but not used [-Wunused-variable]
    3 | static int A[5000];
      |            ^

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