Submission #28114

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
28114	2017-07-15T11:02:12 Z	aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa(#1199, suhgyuho_william)	The Ant and The Bitcoin (FXCUP2_ant)	C++14	0 / 1	0 ms	3584 KB

ant

#include <bits/stdc++.h>
#include <unistd.h>

#define pii pair<int,int>
#define pb push_back
#define lld long long

using namespace std;

int N; lld L,T;
struct data{
	lld x;
	int num;
}a[100002];

int main(){
	scanf("%d %lld %lld",&N,&L,&T);
	T %= (L*2);
	vector<pii> X;
	for(int i=1; i<=N; i++){
		char s[10];
		scanf("%lld %s",&a[i].x,s);
		X.pb({a[i].x,i});
		a[i].num = i;
		if(s[0] == 'L'){
			if(T <= a[i].x) a[i].x -= T;
			else if(T <= a[i].x+L) a[i].x = T-a[i].x;
			else a[i].x = a[i].x+L*2-T;
		}else{
			if(T <= L-a[i].x) a[i].x += T;
			else if(T <= L*2-a[i].x) a[i].x = -a[i].x + L*2 - T;
			else a[i].x = T-(L*2-a[i].x);
		}
		//printf("x = %lld\n",a[i].x);
	}
	int where; scanf("%d",&where);
	sort(a+1,a+N+1,[&](data &x,data &y){
		return x.x < y.x;
	});
	sort(X.begin(),X.end());
	//where = X[where-1].second;
	for(int i=1; i<=N; i++){
		if(a[i].num == where){
			printf("%d\n",i);
			break;
		}
	}

	return 0;
}	

Compilation message

ant.cpp: In function 'int main()':
ant.cpp:17:32: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %lld %lld",&N,&L,&T);
                                ^
ant.cpp:22:29: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld %s",&a[i].x,s);
                             ^
ant.cpp:36:31: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  int where; scanf("%d",&where);
                               ^

Subtask #1

0 / 1.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	3584 KB	Output is correct
2	Incorrect	0 ms	3584 KB	Output isn't correct
3	Halted	0 ms	0 KB	-