Submission #2739968


Source Code Expand

#include <stdio.h>

int main() {
  int N;
  scanf("%d", &N);
  char* str = new char[N + 1];
  scanf("%s", str);

  int min = N;
  int tmpE = 0, tmpW = 0;
  for(int i=0;i<N;i++) {
    tmpE = 0;
    tmpW = 0;
    for(int t=0;t<i;t++) {
      if(str[t] == 'W') {
        tmpE++;
      }
    }
    for(int t=i+1;t<N;t++) {
      if(str[t] == 'E') {
        tmpW++;
      }
    }
    if(min > tmpE + tmpW) {
      min = tmpE + tmpW;
    }
  }

  printf("%d\n", min);

  return 0;
}

Submission Info

Submission Time
Task C - Attention
User KlKlKl
Language C++14 (GCC 5.4.1)
Score 0
Code Size 509 Byte
Status TLE
Exec Time 2103 ms
Memory 512 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:5:18: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &N);
                  ^
./Main.cpp:7:19: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%s", str);
                   ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 300
Status
AC × 3
AC × 7
TLE × 19
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 256 KB
sample_02.txt AC 1 ms 256 KB
sample_03.txt AC 1 ms 256 KB
subtask_1_01.txt TLE 2103 ms 512 KB
subtask_1_02.txt AC 1742 ms 256 KB
subtask_1_03.txt TLE 2103 ms 384 KB
subtask_1_04.txt TLE 2103 ms 384 KB
subtask_1_05.txt TLE 2103 ms 384 KB
subtask_1_06.txt TLE 2103 ms 512 KB
subtask_1_07.txt TLE 2103 ms 512 KB
subtask_1_08.txt TLE 2103 ms 512 KB
subtask_1_09.txt TLE 2103 ms 384 KB
subtask_1_10.txt TLE 2103 ms 512 KB
subtask_1_11.txt TLE 2103 ms 512 KB
subtask_1_12.txt TLE 2103 ms 512 KB
subtask_1_13.txt TLE 2103 ms 512 KB
subtask_1_14.txt TLE 2103 ms 512 KB
subtask_1_15.txt TLE 2103 ms 512 KB
subtask_1_16.txt TLE 2103 ms 512 KB
subtask_1_17.txt TLE 2103 ms 512 KB
subtask_1_18.txt TLE 2103 ms 512 KB
subtask_1_19.txt TLE 2103 ms 512 KB
subtask_1_20.txt TLE 2103 ms 512 KB