| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 448025 | bigo | Awesome Arrowland Adventure (eJOI19_adventure) | C++14 | 0 ms | 0 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>
#include <cmath>
using namespace std;
typedef unsigned long long ll
int main() {
int n, m;
cin >> n >> m;
vector<char>vec(m);
for (int i = 0; i < m; i++) {
cin >> vec[i];
}
bool flag = true;
for (int i = 0; i < m - 1; i++) {
if (vec[i] == 'X') {
cout << -1;
flag = false;
}
}
if (flag)
cout << 0;
}