# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
258105 | mohammad | Land of the Rainbow Gold (APIO17_rainbow) | C++14 | 3111 ms | 452868 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 "rainbow.h"
#include<bits/stdc++.h>
using namespace std;
#define endl "\n"
#define OR |
typedef long long ll ;
const ll ooo = 1e14 ;
const ll oo = 2e9 ;
const double PI = acos(-1) ;
const ll M = 1e9 + 7 ;
const int N = 10000010 ;
int r[4] = {1 , -1 , 0 , 0} ,
c[4] = {0 , 0 , 1 , -1} ;
map<char,int> mp;
map<int,bool> vis[200010];
int ln , lm , rn , rm;
string g[200010];
set<pair<int,int>> s;
void init(int R, int C, int sr, int sc, int M, char *S) {
mp['N'] = 1;
mp['S'] = 0;
mp['E'] = 2;
mp['W'] = 3;
for(int i = 1 ; i <= R ; ++i)
for(int j = 0 ; j <= C ; ++j) g[i] += '.';
g[sr][sc] = '#';
for(int i = 0 ; i < M ; ++i){
# | 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... |