Submission #432510


Source Code Expand

#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <vector>
#include <queue>
#include <functional>
#include <map>
#include <algorithm>

using namespace std;

int main()
{
	int n,a,b;
	scanf("%d %d %d", &n,&a,&b);
	int pos = 0;
	for (int i = 0; i < n; i++)
	{
		char dir[5];
		int di;
		scanf("%s %d", dir, &di);
		if (di < a)
		{
			di = a;
		}
		else if (di > b)
		{
			di = b;
		}
		if (dir[0] == 'W')
		{
			di = -di;
		}

		pos += di;
	}
	getchar();

	if (pos > 0)
	{
		printf("East %d\n", pos);
	}
	else if (pos < 0)
	{
		printf("West %d\n", -pos);
	}
	else
	{
		printf("0\n");
	}
#ifdef _DEBUG
	printf("Press enter to exit\n");
	getchar();
#endif
	return 0;
}

Submission Info

Submission Time
Task B - 双子とスイカ割り
User bugtori
Language C++ (GCC 4.9.2)
Score 100
Code Size 756 Byte
Status AC
Exec Time 35 ms
Memory 928 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:16:29: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d %d", &n,&a,&b);
                             ^
./Main.cpp:22:27: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%s %d", dir, &di);
                           ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 100 / 100
Status
AC × 3
AC × 33
Set Name Test Cases
Sample sample-01.txt, sample-02.txt, sample-03.txt
All test-01.txt, test-02.txt, test-03.txt, test-04.txt, test-05.txt, test-06.txt, test-07.txt, test-08.txt, test-09.txt, test-10.txt, test-11.txt, test-12.txt, test-13.txt, test-14.txt, test-15.txt, test-16.txt, test-17.txt, test-18.txt, test-19.txt, test-20.txt, test-21.txt, test-22.txt, test-23.txt, test-24.txt, test-25.txt, test-26.txt, test-27.txt, test-28.txt, test-29.txt, test-30.txt, sample-01.txt, sample-02.txt, sample-03.txt
Case Name Status Exec Time Memory
sample-01.txt AC 28 ms 760 KB
sample-02.txt AC 29 ms 780 KB
sample-03.txt AC 30 ms 832 KB
test-01.txt AC 35 ms 796 KB
test-02.txt AC 35 ms 784 KB
test-03.txt AC 25 ms 796 KB
test-04.txt AC 26 ms 736 KB
test-05.txt AC 26 ms 928 KB
test-06.txt AC 26 ms 788 KB
test-07.txt AC 25 ms 792 KB
test-08.txt AC 25 ms 788 KB
test-09.txt AC 28 ms 732 KB
test-10.txt AC 30 ms 792 KB
test-11.txt AC 25 ms 736 KB
test-12.txt AC 25 ms 796 KB
test-13.txt AC 25 ms 740 KB
test-14.txt AC 27 ms 796 KB
test-15.txt AC 25 ms 792 KB
test-16.txt AC 31 ms 784 KB
test-17.txt AC 25 ms 796 KB
test-18.txt AC 25 ms 804 KB
test-19.txt AC 28 ms 748 KB
test-20.txt AC 25 ms 796 KB
test-21.txt AC 25 ms 792 KB
test-22.txt AC 26 ms 740 KB
test-23.txt AC 26 ms 784 KB
test-24.txt AC 25 ms 788 KB
test-25.txt AC 25 ms 792 KB
test-26.txt AC 26 ms 788 KB
test-27.txt AC 26 ms 788 KB
test-28.txt AC 27 ms 784 KB
test-29.txt AC 26 ms 784 KB
test-30.txt AC 26 ms 792 KB