Submission #1530513

---

Source Code Expand

#include <iostream>
#include <vector>
#include <queue>
#include <sstream>
#include <algorithm>
#include <bitset>
#include <limits>
#include <map>
#include <set>
#include <iomanip>
#include <cmath>

using namespace std;

typedef long long int ll;
typedef std::numeric_limits<double> dbl;
const long long int LL_INF=1LL<<60;

vector<string> split(const string& input, char delimiter)
{
    stringstream stream(input);
    
    string field;
    vector<string> result;
    while (getline(stream, field, delimiter)) {
        result.push_back(field);
    }
    return result;
}

//#define DEBUG

ll A, B, M, N, D, K, Q, W, H, T, X, Y;

int main()
{
    string sA, sB, sC;
    cin >> sA >> sB >> sC;
    int turn = 0;
    int ia = 0, ib = 0, ic = 0;
    while (true) {
        char next;
        switch (turn) {
            case 0:
                next = sA[ia]; ia++;
            break;
            case 1:
                next = sB[ib]; ib++;
            break;
            case 2:
                next = sC[ic]; ic++;
        }
        switch (next) {
            case 'a': turn = 0; break;
            case 'b': turn = 1; break;
            case 'c': turn = 2; break;
        }
        
        if (ia == sA.size() && turn == 0) {
            cout << "A" << endl; return 0;
        }
        if (ib == sB.size() && turn == 1) {
            cout << "B" << endl; return 0;
        }
        if (ic == sC.size() && turn == 2) {
            cout << "C" << endl; return 0;
        }
    }

    return 0;
}

Submission Info

Judge Result