Submission #3770373
Source Code Expand
#include <cstdio> #include <algorithm> using namespace std; #define REP(i, n) for(int i = 0; i < (int)(n); ++i) char buf[300000+10]; int es[300000+10]; int main(void) { int n; scanf("%d", &n); scanf("%s", buf); REP(i, n) { es[i+1] = es[i] + (buf[i] == 'E'); } int res = 10000000; REP(i, n) { int cur = (i - es[i]) + (es[n] - es[i+1]); res = min(cur, res); } printf("%d\n", res); return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Attention |
User | ush |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 456 Byte |
Status | AC |
Exec Time | 2 ms |
Memory | 1664 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:13:18: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d", &n); ^ ./Main.cpp:14:19: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%s", buf); ^
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 300 / 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 | 1 ms | 128 KB |
sample_02.txt | AC | 1 ms | 128 KB |
sample_03.txt | AC | 1 ms | 128 KB |
subtask_1_01.txt | AC | 2 ms | 1408 KB |
subtask_1_02.txt | AC | 1 ms | 384 KB |
subtask_1_03.txt | AC | 2 ms | 1152 KB |
subtask_1_04.txt | AC | 2 ms | 1152 KB |
subtask_1_05.txt | AC | 1 ms | 640 KB |
subtask_1_06.txt | AC | 2 ms | 1664 KB |
subtask_1_07.txt | AC | 2 ms | 1664 KB |
subtask_1_08.txt | AC | 2 ms | 1536 KB |
subtask_1_09.txt | AC | 2 ms | 1280 KB |
subtask_1_10.txt | AC | 2 ms | 1664 KB |
subtask_1_11.txt | AC | 2 ms | 1664 KB |
subtask_1_12.txt | AC | 2 ms | 1664 KB |
subtask_1_13.txt | AC | 2 ms | 1664 KB |
subtask_1_14.txt | AC | 2 ms | 1664 KB |
subtask_1_15.txt | AC | 2 ms | 1664 KB |
subtask_1_16.txt | AC | 2 ms | 1664 KB |
subtask_1_17.txt | AC | 2 ms | 1664 KB |
subtask_1_18.txt | AC | 2 ms | 1664 KB |
subtask_1_19.txt | AC | 2 ms | 1664 KB |
subtask_1_20.txt | AC | 2 ms | 1664 KB |