Submission #432706
Source Code Expand
#include <cstdio> #include <cmath> using namespace std; int main(){ const int MAX_N = 100; int N, A, B, d[MAX_N]; char str[5]; int pos; scanf("%d%d%d", &N, &A, &B); for(int i = 0; i < N; i++){ scanf("%s%d", str, d + i); if(d[i] < A) d[i] = A; else if(d[i] > B) d[i] = B; if(str[0] == 'W') d[i] *= -1; } pos = 0; for(int i = 0; i < N; i++){ pos += d[i]; } if(pos < 0){ printf("West "); pos *= -1; } else if(pos > 0){ printf("East "); } printf("%d\n", pos); return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - 双子とスイカ割り |
User | kurisutankun |
Language | C++ (GCC 4.9.2) |
Score | 100 |
Code Size | 545 Byte |
Status | AC |
Exec Time | 23 ms |
Memory | 804 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:11: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:13:28: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%s%d", str, d + i); ^
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 100 / 100 | ||||
Status |
|
|
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 | 23 ms | 696 KB |
sample-02.txt | AC | 21 ms | 796 KB |
sample-03.txt | AC | 21 ms | 656 KB |
test-01.txt | AC | 20 ms | 788 KB |
test-02.txt | AC | 22 ms | 676 KB |
test-03.txt | AC | 22 ms | 708 KB |
test-04.txt | AC | 22 ms | 804 KB |
test-05.txt | AC | 22 ms | 704 KB |
test-06.txt | AC | 22 ms | 800 KB |
test-07.txt | AC | 21 ms | 792 KB |
test-08.txt | AC | 22 ms | 704 KB |
test-09.txt | AC | 22 ms | 708 KB |
test-10.txt | AC | 21 ms | 788 KB |
test-11.txt | AC | 22 ms | 704 KB |
test-12.txt | AC | 20 ms | 716 KB |
test-13.txt | AC | 22 ms | 800 KB |
test-14.txt | AC | 21 ms | 796 KB |
test-15.txt | AC | 20 ms | 800 KB |
test-16.txt | AC | 20 ms | 788 KB |
test-17.txt | AC | 22 ms | 696 KB |
test-18.txt | AC | 20 ms | 704 KB |
test-19.txt | AC | 22 ms | 796 KB |
test-20.txt | AC | 22 ms | 796 KB |
test-21.txt | AC | 22 ms | 800 KB |
test-22.txt | AC | 22 ms | 800 KB |
test-23.txt | AC | 22 ms | 796 KB |
test-24.txt | AC | 22 ms | 800 KB |
test-25.txt | AC | 22 ms | 708 KB |
test-26.txt | AC | 22 ms | 796 KB |
test-27.txt | AC | 22 ms | 712 KB |
test-28.txt | AC | 21 ms | 796 KB |
test-29.txt | AC | 22 ms | 800 KB |
test-30.txt | AC | 22 ms | 800 KB |