# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1089978 | alexander707070 | Land of the Rainbow Gold (APIO17_rainbow) | C++14 | 3053 ms | 258132 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>
#include "rainbow.h"
#define MAXN 300007
using namespace std;
int n,m,sx,sy,a,b,c,d,x,y,comps;
string w;
map< pair<int,int> , int > mp;
void init(int R, int C, int sr, int sc, int M, char *S) {
n=R; m=C;
sx=sr; sy=sc;
for(int i=0;i<M;i++){
w.push_back(S[i]);
}
}
bool in(int x,int y){
return x>=a and x<=c and y>=b and y<=d;
}
void check(int x,int y){
if(in(x-1,y) and mp[{x-1,y}]==0)mp[{x-1,y}]=1;
if(in(x+1,y) and mp[{x+1,y}]==0)mp[{x+1,y}]=1;
if(in(x,y-1) and mp[{x,y-1}]==0)mp[{x,y-1}]=1;
if(in(x,y+1) and mp[{x,y+1}]==0)mp[{x,y+1}]=1;
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... |