Submission #4021771


Source Code Expand

#include <stdio.h>
#include <string.h>
#include <stdlib.h>
//#include <math.h>
#include <algorithm>
#include <vector>
#pragma warning(disable:4996)

typedef long long ll;
#define MIN(a, b) ((a)>(b)? (b): (a))
#define MAX(a, b) ((a)<(b)? (b): (a))
#define MOD 1000000007
using namespace std;

char str[300005];
long s[300005];

int main(int argc, char* argv[])
{
    long n;
    scanf("%ld", &n);
    scanf("%s", str);

    s[0]=0;
    long i;
    for(i=0; i<n; i++) {
        if(str[i]=='E') {
            s[i+1]=s[i]+1;
        }
        else {
            s[i+1]=s[i];
        }
    }

    long min=n;
    for(i=0; i<n; i++) {
        long tmp = (i-s[i])+(s[n]-s[i+1]);
        min = MIN(min,tmp);
    }
    
    printf("%ld\n", min);
    return 0;
}

Submission Info

Submission Time
Task C - Attention
User tarattata
Language C++14 (GCC 5.4.1)
Score 300
Code Size 796 Byte
Status AC
Exec Time 4 ms
Memory 2816 KB

Compile Error

./Main.cpp: In function ‘int main(int, char**)’:
./Main.cpp:21:21: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%ld", &n);
                     ^
./Main.cpp:22:21: 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 300 / 300
Status
AC × 3
AC × 26
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 4 ms 2432 KB
subtask_1_02.txt AC 1 ms 640 KB
subtask_1_03.txt AC 2 ms 1920 KB
subtask_1_04.txt AC 2 ms 1792 KB
subtask_1_05.txt AC 1 ms 1024 KB
subtask_1_06.txt AC 3 ms 2816 KB
subtask_1_07.txt AC 3 ms 2816 KB
subtask_1_08.txt AC 3 ms 2688 KB
subtask_1_09.txt AC 3 ms 2048 KB
subtask_1_10.txt AC 4 ms 2816 KB
subtask_1_11.txt AC 4 ms 2816 KB
subtask_1_12.txt AC 4 ms 2816 KB
subtask_1_13.txt AC 3 ms 2816 KB
subtask_1_14.txt AC 3 ms 2816 KB
subtask_1_15.txt AC 3 ms 2816 KB
subtask_1_16.txt AC 3 ms 2816 KB
subtask_1_17.txt AC 3 ms 2816 KB
subtask_1_18.txt AC 3 ms 2816 KB
subtask_1_19.txt AC 3 ms 2816 KB
subtask_1_20.txt AC 3 ms 2816 KB