提出 #577671

---

ソースコード 拡げる

#include<vector>
#include<iostream>
#include<map>
#include<algorithm>
#include<set>
#include<queue>
#include<cassert>
#include<cstring>
#include<cstdio>
#include<cstdlib>

using namespace std;
#define REP(i, n) for(int i=0;i<(int)n;i++)
#define REPS(i, n) for(int i=1;i<=(int)n;i++)
#define RREP(i, n) for(int i=n-1;i>=0;i--)
#define RREPS(i, n) for(int i=n;i>0;i--)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
#define pb push_back
#define eb emplace_back
#define mp make_pair

typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pii;

const int INF = 1<<29;	
int T, n, m;

template<class T>
ostream &operator<<(ostream &os, const vector<T> &v){
	os << "[";
	REP(i, v.size()){
		if(i) os << ",";
		os << v[i];
	}
	return os << "]";
}

int main(){
	while(cin >> n){
		vector<pii> v;
		REP(i, n){
			char c;
			int l;
			cin >> c >> l;
			v.eb(l, c == 'n');
		}
		int ans = 0;
		while(!v.empty()){
			int i = min_element(ALL(v)) - v.begin();
			int t = v[i].second;
			v.erase(v.begin() + i);
			if(t == 1) continue;
			ans ++;
			for(int j=i-1;j>=0;j--){
				if(v[j].second == 1) break;
				v.erase(v.begin() + j);
				i --;
			}
			for(int j=i;j<v.size();){
				if(v[j].second == 1) break;
				v.erase(v.begin() + j);
			}
		}
		cout << ans << endl;
	}
	return 0;	
}

提出情報

ジャッジ結果