# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
244283 | JovanK26 | Mecho (IOI09_mecho) | C++14 | 149 ms | 5240 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;
int n,s;
bool is[801][801];
int tim[801][801];
bool vis[801][801];
struct field
{
int x,y;
};
vector<field> hives;
field start;
field home;
bool check(int m)
{
bool visited[801][801];
for(int i=0;i<n;i++)
{
for(int j=0;j<n;j++)
{
visited[i][j]=0;
}
}
if(m>=tim[start.x][start.y])return 0;
queue<pair<field,int> > q;
q.push(make_pair(start,0));
while(!q.empty())
{
auto x=q.front();
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |