# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
562642 | SSRS | Land of the Rainbow Gold (APIO17_rainbow) | C++14 | 3075 ms | 29548 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"
using namespace std;
int xmin, xmax, ymin, ymax;
set<pair<int, int>> vertex, edge_v, edge_h, face;
void init(int R, int C, int sr, int sc, int M, char *S){
sr--;
sc--;
vector<int> x(M + 1), y(M + 1);
x[0] = sr;
y[0] = sc;
for (int i = 0; i < M; i++){
x[i + 1] = x[i];
y[i + 1] = y[i];
if (S[i] == 'N'){
x[i + 1]--;
}
if (S[i] == 'S'){
x[i + 1]++;
}
if (S[i] == 'E'){
y[i + 1]++;
}
if (S[i] == 'W'){
y[i + 1]--;
}
}
xmin = sr;
xmax = sr;
ymin = sc;
# | 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... |