Submission #28163

#TimeUsernameProblemLanguageResultExecution timeMemory
28163IE (#71)The Ant and The Bitcoin (FXCUP2_ant)C++98
0 / 1
0 ms1508 KiB
#include <stdio.h>
#include <algorithm>
using namespace std;

int N,T,L,V,A[100100];

int main()
{
	scanf ("%d %d %d",&N,&L,&T);

	for (int i=0;i<N;i++){
		int x; char S[5];
		scanf ("%d %s",&x,S);
		if (S[0] == 'L') x = 2 * L - x;
		x = ((long long)x + T) % (2 * L);
		if (x >= L) x = 2 * L - x;
		A[i] = x;
	}

	scanf ("%d",&V);
	int f = A[V-1];

	sort(A,A+N);
	int a = lower_bound(A,A+N,f) - A;
	printf ("%d\n",a+1);

	return 0;
}

Compilation message (stderr)

ant.cpp: In function 'int main()':
ant.cpp:9:29: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf ("%d %d %d",&N,&L,&T);
                             ^
ant.cpp:13:23: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf ("%d %s",&x,S);
                       ^
ant.cpp:20:17: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf ("%d",&V);
                 ^
#Verdict Execution timeMemoryGrader output
Fetching results...