# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
625077 | QwertyPi | Land of the Rainbow Gold (APIO17_rainbow) | C++14 | 5 ms | 724 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;
bool a[51][51];
int dx[4] = {0, 0, 1, -1};
int dy[4] = {1, -1, 0, 0};
int dir[256];
void init(int R, int C, int sr, int sc, int M, char *S) {
dir['E'] = 0;
dir['W'] = 1;
dir['S'] = 2;
dir['N'] = 3;
a[sr][sc] = true;
for(int i = 0; i < M; i++){
sr += dx[dir[S[i]]];
sc += dy[dir[S[i]]];
a[sr][sc] = true;
}
}
int colour(int ar, int ac, int br, int bc) {
int x1 = ar, x2 = br, y1 = ac, y2 = bc;
int V = 0, E = 0, SQ = 0;
for(int i = x1; i <= x2; i++){
for(int j = y1; j <= y2; j++){
V += !a[i][j];
}
}
for(int i = x1; i <= x2; i++){
for(int j = y1; j < y2; j++){
E += !a[i][j] && !a[i][j + 1];
}
}
for(int i = x1; i < x2; i++){
for(int j = y1; j <= y2; j++){
E += !a[i + 1][j] && !a[i][j];
}
}
for(int i = x1; i < x2; i++){
for(int j = y1; j < y2; j++){
SQ += !a[i][j] && !a[i + 1][j] && !a[i][j + 1] && !a[i + 1][j + 1];
}
}
return V - E + SQ;
}
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... |