Submission #33964


Source Code Expand

Copy
/**
 *
 *  Time-stamp:<2012/07/21 20:55:17>
 **/

#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <queue>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#include <fstream>
 
using namespace std;
 
//conversion
//------------------------------------------
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
 
//typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
 
//container util
//------------------------------------------
#define ALL(a)  (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())
 
//repetition
//------------------------------------------
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)

#define Debug cout << "LINE: " << __LINE__ << endl

#define NUM_N 30
#define NUM_L 22

int n, l;
string line[NUM_L];


int solve() {
  int ans;
  REP(i, n*2+1) {
    if(line[l][i]=='o') {
      ans = i;
    }
  }
//  cout << "ans = " << ans << endl;
  for (int i=l-1; i>=0; i--) {
    REP(j, n*2+1) {
      if(j!=ans) continue;

      if(j>0 && line[i][j-1]=='-') {
        ans-=2;
        break;
      } else if (j<(long)n*2 && line[i][j+1]=='-') {
        ans+=2;
        break;
      }
    }
  }

  return ans/2+1;
}

int main()
{
  cin >> n >> l;
  getline(cin, line[0]);
  REP(i, l+1) {
    getline(cin, line[i]);
  }

  cout << solve() << endl;

  return 0;
}

Submission Info

Submission Time
Task B - あみだくじ
User ytwtnb
Language C++ (G++ 4.6.4)
Score 100
Code Size 2187 Byte
Status AC
Exec Time 29 ms
Memory 856 KB

Judge Result

Set Name All
Score / Max Score 100 / 100
Status
AC × 34
Set Name Test Cases
All 00_min.txt, 00_sample_01.txt, 00_sample_02.txt, 00_sample_03.txt, 00_sample_04.txt, 00_sample_05.txt, 01_rnd_00.txt, 01_rnd_01.txt, 01_rnd_02.txt, 01_rnd_03.txt, 01_rnd_04.txt, 01_rnd_05.txt, 01_rnd_06.txt, 01_rnd_07.txt, 01_rnd_08.txt, 01_rnd_09.txt, 01_rnd_10.txt, 01_rnd_11.txt, 01_rnd_12.txt, 01_rnd_13.txt, 01_rnd_14.txt, 01_rnd_15.txt, 01_rnd_16.txt, 01_rnd_17.txt, 01_rnd_18.txt, 01_rnd_19.txt, 02_maxrnd_00.txt, 02_maxrnd_01.txt, 02_maxrnd_02.txt, 02_maxrnd_03.txt, 02_maxrnd_04.txt, 03_empty_00.txt, 03_empty_01.txt, 03_empty_02.txt
Case Name Status Exec Time Memory
00_min.txt AC 23 ms 780 KB
00_sample_01.txt AC 23 ms 772 KB
00_sample_02.txt AC 21 ms 772 KB
00_sample_03.txt AC 22 ms 780 KB
00_sample_04.txt AC 21 ms 784 KB
00_sample_05.txt AC 20 ms 776 KB
01_rnd_00.txt AC 24 ms 736 KB
01_rnd_01.txt AC 24 ms 856 KB
01_rnd_02.txt AC 24 ms 780 KB
01_rnd_03.txt AC 24 ms 820 KB
01_rnd_04.txt AC 22 ms 784 KB
01_rnd_05.txt AC 25 ms 780 KB
01_rnd_06.txt AC 29 ms 848 KB
01_rnd_07.txt AC 24 ms 784 KB
01_rnd_08.txt AC 25 ms 736 KB
01_rnd_09.txt AC 26 ms 836 KB
01_rnd_10.txt AC 22 ms 776 KB
01_rnd_11.txt AC 21 ms 780 KB
01_rnd_12.txt AC 22 ms 764 KB
01_rnd_13.txt AC 19 ms 780 KB
01_rnd_14.txt AC 22 ms 772 KB
01_rnd_15.txt AC 23 ms 776 KB
01_rnd_16.txt AC 24 ms 784 KB
01_rnd_17.txt AC 22 ms 724 KB
01_rnd_18.txt AC 22 ms 776 KB
01_rnd_19.txt AC 22 ms 784 KB
02_maxrnd_00.txt AC 22 ms 788 KB
02_maxrnd_01.txt AC 22 ms 772 KB
02_maxrnd_02.txt AC 22 ms 768 KB
02_maxrnd_03.txt AC 22 ms 784 KB
02_maxrnd_04.txt AC 23 ms 768 KB
03_empty_00.txt AC 22 ms 780 KB
03_empty_01.txt AC 23 ms 768 KB
03_empty_02.txt AC 24 ms 764 KB