Submission #494225

---

Source Code Expand

#include <bits/stdc++.h>

#define FOR(i,a,b) for( int i = (a); i < (int)(b); i++ )
#define REP(i,n) FOR(i,0,n)
#define ALL(x) (x).begin(),(x).end()
#define pb push_back

using namespace std;

typedef long long int ll;

const int INF = 1e9;
const ll INFLL = 1e18;
const double EPS = 1e-7;

template<class T> T &chmin( T &a , const T &b ){ return a = min(a,b); }
template<class T> T &chmax( T &a , const T &b ){ return a = max(a,b); }

int in(){ int a; cin >> a; return a; }

#define fi first
#define se second

typedef pair<int,int> P;
typedef vector<ll> vec;

const int MAX_N = 100010;

string s[MAX_N];

int a[MAX_N];
int b[MAX_N];

int main(){

  int n, m;
  cin >> n >> m;

  REP( i , m )
    cin >> s[i];

  REP( i , n ){
    a[i+1] = a[i];
    REP( j , m )
      a[i+1] += s[j][i] == 'W';
    b[i+1] = (i+1)*m - a[i+1];
  }

  int anserr = INF;
  int ans = 0;

  REP( i , n+1 ){
    int err = b[i] + (a[n]-a[i]);
    if( anserr > err ){
      anserr = err;
      ans = i;
    }
  }

  cout << ans << " " << ans+1 << endl;
  
  return 0;
}

Submission Info

Judge Result