# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
916359 | codefox | Mecho (IOI09_mecho) | C++14 | 269 ms | 54284 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>
using namespace std;
#define pii pair<int, int>
#define piipi pair<pii, int>
int N = 1e6;
int main()
{
//freopen("input.txt", "r", stdin);
//freopen("output.txt", "w", stdout);
int n, s;
cin >> n >> s;
vector<string> grid(n+2);
string ns = "";
for (int i = 0; i < n+2; i++) ns += "T";
grid[0] = ns;
grid[n+1] = ns;
for (int i = 1; i <= n; i++)
{
cin >> grid[i];
grid[i] = "T" + grid[i] + "T";
}
vector<vector<int>> graph(N);
queue<pii> q;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |