# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
112153 | dolphingarlic | Elder (COCI19_elder) | C++14 | 2 ms | 384 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define FOR(i, x, y) for(int i = x; i < y; i++)
typedef long long ll;
using namespace std;
int n, cnt = 0;
char c;
bool obeyed[26];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> c >> n;
obeyed[c - 'A'] = true;
FOR(i, 0, n) {
char x, y;
cin >> x >> y;
if (y == c) {
obeyed[x - 'A'] = true;
c = x;
}
}
cout << c << '\n';
FOR(i, 0, 26) {
if (obeyed[i]) {
cnt++;
}
}
cout << cnt << '\n';
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |