Submission #33559

---

Source Code Expand

#include <iostream>
#include <sstream>
#include <string>
#include <vector>
#include <deque>
#include <queue>
#include <set>
#include <map>
#include <algorithm>
#include <functional>
#include <utility>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <cstdio>
using namespace std;
#define REP(i,n) for((i)=0;(i)<(int)(n);(i)++)

typedef long long ll;
#define INF (1<<29)

int main(){
	string s[30], t;
	int n, l, i, j, m, ret;
	cin >> n >> l;
	getline(cin,t);
	REP(i,l+1)getline(cin,s[i]);
	REP(i,s[l].length())if(s[l][i]=='o')m=i/2;
	ret=m;
	for(i=l-1;i>=0;i--){
		if(m!=0&&s[i][m*2-1]=='-')m--;
		else if(m!=n-1&&s[i][m*2+1]=='-')m++;
	}
	cout << m+1 << endl;
	return 0;
}

Submission Info

Judge Result