# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
28082 | EyeOfSol (#71) | The Ant and The Bitcoin (FXCUP2_ant) | C++11 | 0 ms | 2020 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;
int n, l, t;
int mokx(int a, int b) {
if (a>=0) return a/b;
return (a-b+1)/b;
}
int loc(int a, int dir, int t) {
int v = a*dir+t;
if (mokx(v,l)%2) return l-(v%l+l)%l;
return (v%l+l)%l;
}
vector<int> vec;
int main() {
int i;
scanf("%d%d%d",&n,&l,&t);
for (i=0;i<n;i++) {
int a; char ch;
scanf("%d %c",&a,&ch);
if (ch=='L') vec.push_back(loc(a,-1,t));
else vec.push_back(loc(a,1,t));
}
int id;
scanf("%d",&id); id--;
int v = vec[id];
sort(vec.begin(),vec.end());
for (i=0;i<vec.size();i++) {
if (vec[i]==v) printf("%d\n",i+1);
}
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |