oj.uz

Submission #28127

# Submission time Handle Problem Language Result Execution time Memory
28127 2017-07-15T11:41:51 Z Shocking Hot(#1201, khsoo01) The Ant and The Bitcoin (FXCUP2_ant) C++14
1 / 1
 46 ms 4460 KB 
#include<bits/stdc++.h>
#define X first
#define Y second
using namespace std;
typedef long long ll;
ll n, l, t, x, d[100005];
pair<ll, ll> a[100005];

bool f[100005];

int main()
{
	scanf("%lld%lld%lld",&n,&l,&t);
	for(ll i=1;i<=n;i++) {
		char T[2]; a[i].Y = i;
		scanf("%lld%s",&a[i].X,T);
		if(T[0] == 'L') f[i] = true;
	}
	scanf("%lld",&x);
	sort(a+1, a+1+n);
	for(ll i=1;i<=n;i++) {
		d[i] = a[i].Y;
		a[i].Y = (d[i] == x);
		if(f[d[i]]) a[i].X -= t;
		else a[i].X += t;
		a[i].X = (a[i].X % (2*l) + 2*l) % (2*l);
		if(a[i].X >= l) a[i].X = 2*l - a[i].X;
	}
	sort(a+1, a+1+n);
	for(ll i=1;i<=n;i++) {
		if(a[i].Y) {printf("%lld\n",d[i]); return 0;}
	}
}

Compilation message

ant.cpp: In function 'int main()':
ant.cpp:13:32: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%lld%lld%lld",&n,&l,&t);
                                ^
ant.cpp:16:28: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld%s",&a[i].X,T);
                            ^
ant.cpp:19:18: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%lld",&x);
                  ^

Subtask #1
1.0 / 1.0

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