Submission #3439225
Source Code Expand
#include <stdio.h> #include <algorithm> #include <complex> #include<vector> int main() { int n, table[300000][2]{}, sum_east{}, min = 500000; char s[300000]; scanf("%d%s", &n, s); for (int i = 1; i < n; ++i) { bool e = (s[i - 1] == 'E'); table[i][e] = table[i - 1][e] + 1; table[i][!e] = table[i - 1][!e]; if (e) sum_east++; } if (s[n - 1] == 'E') sum_east++; for (int i = 0; i < n; ++i) { int tmp = table[i][0] + (sum_east - table[i][1]); if (s[i] == 'E') tmp++; if (tmp < min) min = tmp; } printf("%d\n", min); return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Attention |
User | TanakaTaroh |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 659 Byte |
Status | WA |
Exec Time | 4 ms |
Memory | 2816 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:11:25: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d%s", &n, s); ^
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 300 | ||||||
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, sample_01.txt, sample_02.txt, sample_03.txt, subtask_1_01.txt, subtask_1_02.txt, subtask_1_03.txt, subtask_1_04.txt, subtask_1_05.txt, subtask_1_06.txt, subtask_1_07.txt, subtask_1_08.txt, subtask_1_09.txt, subtask_1_10.txt, subtask_1_11.txt, subtask_1_12.txt, subtask_1_13.txt, subtask_1_14.txt, subtask_1_15.txt, subtask_1_16.txt, subtask_1_17.txt, subtask_1_18.txt, subtask_1_19.txt, subtask_1_20.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_01.txt | AC | 2 ms | 2560 KB |
sample_02.txt | AC | 1 ms | 2560 KB |
sample_03.txt | AC | 2 ms | 2560 KB |
subtask_1_01.txt | AC | 3 ms | 2816 KB |
subtask_1_02.txt | AC | 2 ms | 2816 KB |
subtask_1_03.txt | WA | 3 ms | 2688 KB |
subtask_1_04.txt | AC | 3 ms | 2688 KB |
subtask_1_05.txt | WA | 2 ms | 2560 KB |
subtask_1_06.txt | AC | 3 ms | 2816 KB |
subtask_1_07.txt | WA | 3 ms | 2816 KB |
subtask_1_08.txt | AC | 3 ms | 2816 KB |
subtask_1_09.txt | WA | 3 ms | 2688 KB |
subtask_1_10.txt | AC | 4 ms | 2816 KB |
subtask_1_11.txt | AC | 3 ms | 2816 KB |
subtask_1_12.txt | AC | 4 ms | 2816 KB |
subtask_1_13.txt | AC | 4 ms | 2816 KB |
subtask_1_14.txt | AC | 4 ms | 2816 KB |
subtask_1_15.txt | AC | 4 ms | 2816 KB |
subtask_1_16.txt | WA | 4 ms | 2816 KB |
subtask_1_17.txt | AC | 4 ms | 2816 KB |
subtask_1_18.txt | AC | 4 ms | 2816 KB |
subtask_1_19.txt | AC | 4 ms | 2816 KB |
subtask_1_20.txt | WA | 4 ms | 2816 KB |