oj.uz

Submission #28174

# Submission time Handle Problem Language Result Execution time Memory
28174 2017-07-15T14:08:39 Z IE(#1205, kriii) The Ant and The Bitcoin (FXCUP2_ant) C++
1 / 1
 56 ms 3464 KB 
#include <stdio.h>
#include <algorithm>
using namespace std;

int N; long long T,L,A[100100];
pair<long long, int> O[100100];

int main()
{
	scanf ("%d %lld %lld",&N,&L,&T);

	for (int i=0;i<N;i++){
		long long x; char S[5];
		scanf ("%lld %s",&x,S);
		O[i] = {x,i+1};
		if (S[0] == 'L') x = 2 * L - x;
		x = (x + T) % (2 * L);
		if (x >= L) x = 2 * L - x;
		A[i] = x;
	}

	int V; scanf ("%d",&V);
	long long g = O[V-1].first;
	sort(O,O+N);

	long long f = A[lower_bound(O,O+N,make_pair(g,0))->second-1];
	sort(A,A+N);
	printf ("%d\n",O[lower_bound(A,A+N,f)-A].second);

	return 0;
}

Compilation message

ant.cpp: In function 'int main()':
ant.cpp:15:16: warning: extended initializer lists only available with -std=c++11 or -std=gnu++11
   O[i] = {x,i+1};
                ^
ant.cpp:15:8: warning: extended initializer lists only available with -std=c++11 or -std=gnu++11
   O[i] = {x,i+1};
        ^
ant.cpp:10:33: 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:14:25: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf ("%lld %s",&x,S);
                         ^
ant.cpp:22:24: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  int V; scanf ("%d",&V);
                        ^

Subtask #1
1.0 / 1.0

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