# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
678653 | qwerasdfzxcl | Land of the Rainbow Gold (APIO17_rainbow) | C++17 | 3066 ms | 318272 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;
typedef long long ll;
int dx[4] = {-1, 0, 1, 0}, dy[4] = {0, 1, 0, -1};
int dx8[9] = {-1, -1, -1, 0, 1, 1, 1, 0, -1}, dy8[9] = {-1, 0, 1, 1, 1, 0, -1, -1, -1};
set<pair<int, int>> st;
void init(int R, int C, int sr, int sc, int M, char *S) {
st.emplace(sr, sc);
for (int i=0;i<M;i++){
int k;
if (S[i]=='N') k = 0;
if (S[i]=='E') k = 1;
if (S[i]=='S') k = 2;
if (S[i]=='W') k = 3;
sr += dx[k], sc += dy[k];
st.emplace(sr, sc);
}
}
bool valid(int x, int y, int ar, int ac, int br, int bc){
if (st.find(make_pair(x, y))!=st.end()) return 0;
return ar <= x && x <= br && ac <= y && y <= bc;
}
void add_edge(int x1, int y1, int x2, int y2, set<pair<int, int>> &V, map<pair<int, int>, vector<pair<int, int>>> &E, int ar, int ac, int br, int bc){
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... |