# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
28132 | tlwpdus 팬클럽 회장 (#71) | The Ant and The Bitcoin (FXCUP2_ant) | C++14 | 46 ms | 5536 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 <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
int n, k, p[100010];
ll l, t, bx;
pll ix[100010], x[100010];
int main(){
scanf("%d%lld%lld", &n, &l, &t);
for(int i = 1; i <= n; i++){
char buf[3]; ll cx;
scanf("%lld%s", &cx, buf);
ix[i] = {cx, i};
if(buf[0] == 'R'){
cx += t;
cx %= 2 * l;
if(cx > l) cx = 2 * l - cx;
}
else{
cx = l - cx;
cx += t;
cx %= 2 * l;
if(cx > l) cx = 2 * l - cx;
cx = l - cx;
}
x[i] = {cx, i};
}
scanf("%d", &k);
sort(ix + 1, ix + n + 1);
sort(x + 1, x + n + 1);
for(int i = 1; i <= n; i++){
if(x[i].second == k){
k = i;
break;
}
}
printf("%d\n", ix[k].second);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |