# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
373966 | FEDIKUS | Game (eJOI20_game) | C++17 | 1 ms | 364 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 mp make_pair
#define pb push_back
#define xx first
#define yy second
using namespace std;
typedef pair<int,int> pii;
set<pair<pii,pii> > nesto;
bool bio[21][21];
int n,m;
int vel;
inline pair<pii,pii> srt(pii a,pii b){
return mp(min(a,b),max(a,b));
}
inline bool moze(int x,int y){
if(x<0 || x>=n || y<0 || y>=m) return false;
return true;
}
void dfs(int y,int x){
if(bio[y][x]) return;
bio[y][x]=true;
vel++;
//cout<<x<<" "<<y<<" "<<vel<<"\n";
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |