# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
28171 | IE (#71) | The Ant and The Bitcoin (FXCUP2_ant) | C++98 | 0 ms | 2680 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; long long T,L,V,O[100100],A[100100];
int main()
{
scanf ("%d %lld %lld",&N,&L,&T);
for (int i=0;i<N;i++){
long long x; char S[5];
scanf ("%lld %s",&x,S);
O[i] = x;
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);
long long g = O[V-1];
sort(O,O+N);
long long f = A[lower_bound(O,O+N,g)-O];
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... |