# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
138452 | baluteshih | Mecho (IOI09_mecho) | C++14 | 279 ms | 7160 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 pb push_back
#define jizz ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define ET cout << "\n"
#define F first
#define S second
#define MP make_pair
#define ALL(v) v.begin(),v.end()
#define MEM memset(i,j,sizeof i)
#define DB(a,s,e) {for(int i=s;i<e;++i) cout << a[i] << " ";ET;}
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
const int INF=1e9;
int dx[4]={0,0,1,-1},dy[4]={1,-1,0,0},n,s;
string mp[805];
int ti[805][805],vis[805][805];
queue<pii> q;
pii st;
bool check(int x,int y)
{
return !(x<0||y<0||x>=n||y>=n||vis[x][y]||mp[x][y]=='T');
}
bool check2(int x,int y)
{
return !(x<0||y<0||x>=n||y>=n||vis[x][y]!=INF||mp[x][y]=='T');
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |