# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
484887 | Olympia | Tracks in the Snow (BOI13_tracks) | C++17 | 1293 ms | 1048580 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 <vector>
#include <iostream>
#include <cassert>
#include <cmath>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <set>
#include <algorithm>
#include <iomanip>
using namespace std;
vector<vector<bool>> hasVisited;
vector<string> grid;
int R = 0;
int B = 0;
int cntr = 0;
void dfs (int x, int y) {
cntr++;
//cout << cntr << endl;
//cout << x << " " << y << endl;
if (hasVisited[x][y]) {
return;
}
hasVisited[x][y] = true;
R += (grid[x][y] == 'R');
B += (grid[x][y] == 'F');
for (int dx = -1; dx <= 1; dx++) {
for (int dy = -1; dy <= 1; dy++) {
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |