Submission #33307


Source Code Expand

Copy
#include <iostream>
#include <sstream>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cctype>
#include <cmath>
#include <cassert>
using namespace std;

#define all(c) (c).begin(), (c).end()
#define iter(c) __typeof((c).begin())
#define cpresent(c, e) (find(all(c), (e)) != (c).end())
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define tr(c, i) for (iter(c) i = (c).begin(); i != (c).end(); ++i)
#define pb(e) push_back(e)
#define mp(a, b) make_pair(a, b)


int main() {
  int N, L;
  while (cin >> N >> L) {
    string line;
    getline(cin, line);

    vector<string> A(L);
    rep (i, L) getline(cin, A[i]);

    getline(cin, line);
    int p = (strchr(line.c_str(), 'o') - line.c_str()) / 2;

    for (int i = L - 1; i >= 0; --i) {
      string a = A[i];
           if (p - 1 >= 0 && a[p * 2 - 1] == '-') --p;
      else if (p + 1  < N && a[p * 2 + 1] == '-') ++p;

      // printf(" %d\n", p);
    }

    printf("%d\n", p + 1);
  }

  return 0;
}

Submission Info

Submission Time
Task B - あみだくじ
User iwiwi
Language C++ (G++ 4.6.4)
Score 100
Code Size 1152 Byte
Status AC
Exec Time 34 ms
Memory 820 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 22 ms 784 KB
00_sample_01.txt AC 20 ms 808 KB
00_sample_02.txt AC 25 ms 792 KB
00_sample_03.txt AC 22 ms 788 KB
00_sample_04.txt AC 21 ms 780 KB
00_sample_05.txt AC 34 ms 796 KB
01_rnd_00.txt AC 21 ms 784 KB
01_rnd_01.txt AC 22 ms 784 KB
01_rnd_02.txt AC 21 ms 808 KB
01_rnd_03.txt AC 22 ms 732 KB
01_rnd_04.txt AC 22 ms 788 KB
01_rnd_05.txt AC 21 ms 788 KB
01_rnd_06.txt AC 22 ms 792 KB
01_rnd_07.txt AC 21 ms 736 KB
01_rnd_08.txt AC 21 ms 792 KB
01_rnd_09.txt AC 21 ms 796 KB
01_rnd_10.txt AC 21 ms 788 KB
01_rnd_11.txt AC 21 ms 820 KB
01_rnd_12.txt AC 21 ms 788 KB
01_rnd_13.txt AC 22 ms 780 KB
01_rnd_14.txt AC 22 ms 784 KB
01_rnd_15.txt AC 20 ms 784 KB
01_rnd_16.txt AC 20 ms 808 KB
01_rnd_17.txt AC 20 ms 784 KB
01_rnd_18.txt AC 21 ms 792 KB
01_rnd_19.txt AC 22 ms 760 KB
02_maxrnd_00.txt AC 21 ms 820 KB
02_maxrnd_01.txt AC 21 ms 788 KB
02_maxrnd_02.txt AC 22 ms 788 KB
02_maxrnd_03.txt AC 22 ms 788 KB
02_maxrnd_04.txt AC 21 ms 788 KB
03_empty_00.txt AC 21 ms 732 KB
03_empty_01.txt AC 21 ms 768 KB
03_empty_02.txt AC 21 ms 792 KB