Submission #4020169


Source Code Expand

#include<bits/stdc++.h>
#include<ext/pb_ds/tree_policy.hpp>
#include<ext/pb_ds/assoc_container.hpp>
#define BEGIN ios_base::sync_with_stdio(0);cin.tie(0)
#define END return EXIT_SUCCESS
#define FOR(I,A,B) for((I)=(A);(I)<(B);(I)++)
#define REP(I,N) FOR(I,0,N)
#define ALL(C) (C).begin(),(C).end()
#define INPUT(P) std::cin>>(P)
#define INPUT2(P1,P2) std::cin>>(P1)>>(P2)
#define INPUT3(P1,P2,P3) std::cin>>(P1)>>(P2)>>(P3)
#define INPUTS(I,N,V) REP(I,N) std::cin>>V[I]
#define OUTPUT(P) std::cout<<P<<std::endl
#define OUTPUT2(P1,P2) std::cout<<P1<<" "<<P2<<std::endl
#define OUTPUT3(P1,P2,P3) std::cout<<P1<<" "<<P2<<" "<<P3<<std::endl
#define OUTPUTS(I,N,V) REP(I,N) std::cout<<V[i]<<std::endl
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
typedef long long ll;
typedef unsigned int ui;
typedef unsigned long long ull;
using namespace std;
using namespace __gnu_pbds;
int i,j,k;
int N;
string S;
int cumsum_west[300000];
int cumsum_east[300000];
int east_sum;
int west_sum;
int answer=INT_MAX;
inline void solve(){
  INPUT2(N,S);
  REP(i,N){
    if(S[i]=='E')east_sum++;
    if(S[N-i-1]=='W')west_sum++;
    cumsum_east[i]=east_sum;
    cumsum_west[N-i-1]=west_sum;
  }
  REP(i,N){
    answer=min(answer,cumsum_west[0]-cumsum_west[i]+cumsum_east[N-1]-cumsum_east[i]);
  }
  OUTPUT(answer);
}

int main(int argc,char**argv){
  BEGIN;
  solve();
  END;
}

Submission Info

Submission Time
Task C - Attention
User hryshtk
Language C++14 (GCC 5.4.1)
Score 300
Code Size 1484 Byte
Status AC
Exec Time 7 ms
Memory 2964 KB

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 256 KB
sample_02.txt AC 1 ms 256 KB
sample_03.txt AC 1 ms 256 KB
subtask_1_01.txt AC 6 ms 2708 KB
subtask_1_02.txt AC 2 ms 768 KB
subtask_1_03.txt AC 3 ms 2068 KB
subtask_1_04.txt AC 3 ms 2000 KB
subtask_1_05.txt AC 2 ms 1232 KB
subtask_1_06.txt AC 4 ms 2964 KB
subtask_1_07.txt AC 4 ms 2964 KB
subtask_1_08.txt AC 4 ms 2836 KB
subtask_1_09.txt AC 4 ms 2324 KB
subtask_1_10.txt AC 7 ms 2964 KB
subtask_1_11.txt AC 7 ms 2964 KB
subtask_1_12.txt AC 7 ms 2964 KB
subtask_1_13.txt AC 4 ms 2964 KB
subtask_1_14.txt AC 4 ms 2964 KB
subtask_1_15.txt AC 4 ms 2964 KB
subtask_1_16.txt AC 4 ms 2964 KB
subtask_1_17.txt AC 4 ms 2964 KB
subtask_1_18.txt AC 4 ms 2964 KB
subtask_1_19.txt AC 4 ms 2964 KB
subtask_1_20.txt AC 4 ms 2964 KB