Submission #28096

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
28096	2017-07-15T10:32:41 Z	EyeOfSol(#1198, tlwpdus)	The Ant and The Bitcoin (FXCUP2_ant)	C++11	1 / 1	49 ms	3656 KB

ant

#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+t*dir;
	if (mokx(v,l)%2) return l-(v%l+l)%l;
	return (v%l+l)%l;
}

int arr[100100], ord[100100];
vector<int> vec;

int main() {
	int i;
	scanf("%d%d%d",&n,&l,&t);
	for (i=0;i<n;i++) {
		char ch;
		ord[i] = i;
		scanf("%d %c",&arr[i],&ch);
		if (ch=='L') vec.push_back(loc(arr[i],-1,t));
		else vec.push_back(loc(arr[i],1,t));
	}
	sort(ord,ord+n,[](int a, int b){return arr[a]<arr[b];});
	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",ord[i]+1);
	}

    return 0;
}

Compilation message

ant.cpp: In function 'int main()':
ant.cpp:36:12: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (i=0;i<vec.size();i++) {
            ^
ant.cpp:23:26: 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:27:29: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %c",&arr[i],&ch);
                             ^
ant.cpp:33:17: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&id); id--;
                 ^

Subtask #1

1.0 / 1.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	2804 KB	Output is correct
2	Correct	0 ms	2804 KB	Output is correct
3	Correct	0 ms	2804 KB	Output is correct
4	Correct	0 ms	2804 KB	Output is correct
5	Correct	0 ms	2804 KB	Output is correct
6	Correct	0 ms	2804 KB	Output is correct
7	Correct	0 ms	2804 KB	Output is correct
8	Correct	0 ms	2804 KB	Output is correct
9	Correct	0 ms	2804 KB	Output is correct
10	Correct	0 ms	2804 KB	Output is correct
11	Correct	0 ms	2804 KB	Output is correct
12	Correct	0 ms	2804 KB	Output is correct
13	Correct	43 ms	3656 KB	Output is correct
14	Correct	43 ms	3656 KB	Output is correct
15	Correct	33 ms	3656 KB	Output is correct
16	Correct	49 ms	3656 KB	Output is correct
17	Correct	43 ms	3656 KB	Output is correct
18	Correct	43 ms	3656 KB	Output is correct
19	Correct	39 ms	3656 KB	Output is correct
20	Correct	36 ms	3656 KB	Output is correct