제출 #218340

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
218340		Lawliet	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++17	8 / 100	3099 ms	4216 KiB

sortbooks

#include <bits/stdc++.h>

using namespace std;

const int MAXN = 1000010;

int n, q;

int v[MAXN];

int main()
{
	scanf("%d %d",&n,&q);

	for(int i = 1 ; i <= n ; i++)
		scanf("%d",&v[i]);

	for(int i = 1 ; i <= q ; i++)
	{
		int L, R, k;
		scanf("%d %d %d",&L,&R,&k);

		int mx = 0;

		for(int a = L ; a <= R ; a++)
		{
			for(int b = a ; b >= L ; b--)
			{
				if( v[b] <= v[a] ) continue;
				mx = max( mx , v[b] + v[a] );
			}
		}

		if( mx <= k ) printf("1\n");
		else printf("0\n");
	}
}

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

sortbooks.cpp: In function 'int main()':
sortbooks.cpp:13:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d",&n,&q);
  ~~~~~^~~~~~~~~~~~~~~
sortbooks.cpp:16:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d",&v[i]);
   ~~~~~^~~~~~~~~~~~
sortbooks.cpp:21:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d %d",&L,&R,&k);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 8 / 8
• Subtask 2: 0 / 9
• Subtask 3: 0 / 13
• Subtask 4: 0 / 17
• Subtask 5: 0 / 30
• Subtask 6: 0 / 23