Submission #1688572


Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define REP(i, s, n) for (int i = s; i < n; ++i)
#define rep(i, n) REP(i, 0, n)
#define SORT(c) sort((c).begin(), (c).end())
#define IINF INT_MAX
#define LLINF LLONG_MAX
#define DEBUG true
// sort(a.begin(), a.end(), std::greater<int>());

/*
std::vector<std::string> split(const std::string &input, char delimiter)
{
    std::istringstream stream(input);

    std::string field;
    std::vector<std::string> result;
    while (std::getline(stream, field, delimiter))
    {
        result.push_back(field);
    }
    return result;
}
*/

int main()
{
    string a, b, c;
    cin >> a >> b >> c;
    int ac, bc, cc;
    ac = 0;
    bc = 0;
    cc = 0;
    char man = a[0];
    while (true)
    {
        if (ac == a.length()+1)
        {
            cout << "A" << endl;
            break;
        }
        if (bc == b.length()+1)
        {
            cout << "B" << endl;
            break;
        }
        if (cc == c.length()+1)
        {
            cout << "C" << endl;
            break;
        }
        switch (man)
        {
        case 'a':
            man = a[ac++];
            break;
        case 'b':
            man = b[bc++];
            break;
        case 'c':
            man = c[cc++];
            break;
        }
    }
    return 0;
}

Submission Info

Submission Time
Task B - Card Game for Three (ABC Edit)
User ToM_ynu
Language C++14 (GCC 5.4.1)
Score 200
Code Size 1374 Byte
Status AC
Exec Time 1 ms
Memory 256 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 200 / 200
Status AC
AC × 12
Set Name Test Cases
Sample
All 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, sample_01.txt, sample_02.txt
Case Name Status Exec Time Memory
01.txt AC 1 ms 256 KB
02.txt AC 1 ms 256 KB
03.txt AC 1 ms 256 KB
04.txt AC 1 ms 256 KB
05.txt AC 1 ms 256 KB
06.txt AC 1 ms 256 KB
07.txt AC 1 ms 256 KB
08.txt AC 1 ms 256 KB
09.txt AC 1 ms 256 KB
10.txt AC 1 ms 256 KB
sample_01.txt AC 1 ms 256 KB
sample_02.txt AC 1 ms 256 KB