# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
286399 | abyyskit | Mecho (IOI09_mecho) | C++14 | 377 ms | 14836 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 FOR(i, x, y) for(int i = x; i < y; ++i)
#define pb push_back
#define x first
#define y second
int n;
int S;
struct spair{
int x;
int y;
};
bool inside(int a, int b){
if ((a >= 0 && b >= 0) && (a < n && b < n)){
return true;
}
return false;
}
struct node{
char c;
int d = -1;
bool vis = false;
spair sp = {-1, 0};
};
vector<vector<node>> g;
vector<pair<int, int>> D;
void bfs(vector<pair<int, int>> start){
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |