Submission #1121746
Source Code Expand
#include <stdio.h> #include <algorithm> int N, A, B, d[112]; char s[112][5]; int ans; int main(void) { scanf("%d%d%d", &N, &A, &B); for (int i = 0; i < N; ++i) { scanf("%s%d", s[i], &d[i]); } for (int i = 0; i < N; ++i) { if (s[i][0] == 'E') { if (d[i] < A) { ans += A; } if (A <= d[i] && d[i] <= B) { ans += d[i]; } if (d[i] > B) { ans += B; } } if (s[i][0] == 'W') { if (d[i] < A) { ans -= A; } if (A <= d[i] && d[i] <= B) { ans -= d[i]; } if (d[i] > B) { ans -= B; } } } if (ans < 0) { printf("West %d\n", abs(ans)); } else if (ans > 0) { printf("East %d\n", ans); } else { printf("0\n"); } return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - 双子とスイカ割り |
User | Bwambocos |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 779 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 128 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:10: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:11:58: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] for (int i = 0; i < N; ++i) { scanf("%s%d", s[i], &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 | sample-01.txt, sample-02.txt, sample-03.txt, 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 | 1 ms | 128 KB |
sample-02.txt | AC | 0 ms | 128 KB |
sample-03.txt | AC | 0 ms | 128 KB |
test-01.txt | AC | 1 ms | 128 KB |
test-02.txt | AC | 1 ms | 128 KB |
test-03.txt | AC | 1 ms | 128 KB |
test-04.txt | AC | 0 ms | 128 KB |
test-05.txt | AC | 0 ms | 128 KB |
test-06.txt | AC | 1 ms | 128 KB |
test-07.txt | AC | 1 ms | 128 KB |
test-08.txt | AC | 1 ms | 128 KB |
test-09.txt | AC | 1 ms | 128 KB |
test-10.txt | AC | 1 ms | 128 KB |
test-11.txt | AC | 1 ms | 128 KB |
test-12.txt | AC | 1 ms | 128 KB |
test-13.txt | AC | 1 ms | 128 KB |
test-14.txt | AC | 1 ms | 128 KB |
test-15.txt | AC | 1 ms | 128 KB |
test-16.txt | AC | 1 ms | 128 KB |
test-17.txt | AC | 1 ms | 128 KB |
test-18.txt | AC | 1 ms | 128 KB |
test-19.txt | AC | 1 ms | 128 KB |
test-20.txt | AC | 1 ms | 128 KB |
test-21.txt | AC | 1 ms | 128 KB |
test-22.txt | AC | 1 ms | 128 KB |
test-23.txt | AC | 1 ms | 128 KB |
test-24.txt | AC | 1 ms | 128 KB |
test-25.txt | AC | 1 ms | 128 KB |
test-26.txt | AC | 1 ms | 128 KB |
test-27.txt | AC | 1 ms | 128 KB |
test-28.txt | AC | 1 ms | 128 KB |
test-29.txt | AC | 1 ms | 128 KB |
test-30.txt | AC | 1 ms | 128 KB |