Submission #855935


Source Code Expand

Copy
#include <bits/stdc++.h>
using namespace std;
int N, L, Q, A, B;
int hotels[1005];
int main()
{
	//freopen("infile.txt", "r", stdin);
	scanf("%d", &N);
	for(int n=1; n<=N; n++)
	{
		scanf("%d", &hotels[n]);
	}
	scanf("%d", &L);
	scanf("%d", &Q);
	for(int q=0; q<Q; q++)
	{
		scanf("%d %d", &A, &B);
		int numdays =0;
		int dist=0;
		for(int a=min(A, B); a<max(A, B); a++)
		{
			if(dist+hotels[a+1]-hotels[a] <=L)
			{
				dist+=hotels[a+1]-hotels[a];
			}
			else
			{
				dist=hotels[a+1]-hotels[a];
				numdays++;
			}
		}
		printf("%d\n", numdays+1);
	}
}

Submission Info

Submission Time
Task E - Tak and Hotels
User beeshi
Language C++14 (GCC 5.4.1)
Score 200
Code Size 592 Byte
Status RE
Exec Time 228 ms
Memory 256 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:8:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &N);
                 ^
./Main.cpp:11:26: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &hotels[n]);
                          ^
./Main.cpp:13:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &L);
                 ^
./Main.cpp:14:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &Q);
                 ^
./Main.cpp:17:25: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d", &A, &B);
                         ^

Judge Result

Set Name Sample Subtask1 All
Score / Max Score 0 / 0 200 / 200 0 / 500
Status
AC × 1
AC × 14
AC × 14
RE × 13
Set Name Test Cases
Sample example_01.txt
Subtask1 example_01.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt
All example_01.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask2_01.txt, subtask2_02.txt, subtask2_03.txt, subtask2_04.txt, subtask2_05.txt, subtask2_06.txt, subtask2_07.txt, subtask2_08.txt, subtask2_09.txt, subtask2_10.txt, subtask2_11.txt, subtask2_12.txt, subtask2_13.txt
Case Name Status Exec Time Memory
example_01.txt AC 4 ms 256 KB
subtask1_01.txt AC 4 ms 256 KB
subtask1_02.txt AC 4 ms 256 KB
subtask1_03.txt AC 5 ms 256 KB
subtask1_04.txt AC 5 ms 256 KB
subtask1_05.txt AC 5 ms 256 KB
subtask1_06.txt AC 4 ms 256 KB
subtask1_07.txt AC 4 ms 256 KB
subtask1_08.txt AC 5 ms 256 KB
subtask1_09.txt AC 5 ms 256 KB
subtask1_10.txt AC 5 ms 256 KB
subtask1_11.txt AC 5 ms 256 KB
subtask1_12.txt AC 5 ms 256 KB
subtask1_13.txt AC 5 ms 256 KB
subtask2_01.txt RE 228 ms 256 KB
subtask2_02.txt RE 189 ms 256 KB
subtask2_03.txt RE 189 ms 256 KB
subtask2_04.txt RE 189 ms 256 KB
subtask2_05.txt RE 191 ms 256 KB
subtask2_06.txt RE 192 ms 256 KB
subtask2_07.txt RE 190 ms 256 KB
subtask2_08.txt RE 189 ms 256 KB
subtask2_09.txt RE 189 ms 256 KB
subtask2_10.txt RE 188 ms 256 KB
subtask2_11.txt RE 190 ms 256 KB
subtask2_12.txt RE 188 ms 256 KB
subtask2_13.txt RE 188 ms 256 KB