| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 28162 | IE (#71) | 개미와 비트코인 (FXCUP2_ant) | C++98 | 0 ms | 1508 KiB | 
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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 = (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)
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
