# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1171816 | xnqs | Dango Maker (JOI18_dango_maker) | C++20 | 694 ms | 327680 KiB |
#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#include <utility>
#include <algorithm>
#include <unordered_map>
#include <functional>
int gs_left, gs_right;
int x, y;
char arr[3005][3005];
std::vector<bool> real_node;
std::vector<char> color;
std::vector<std::vector<int>> adj_list;
std::unordered_map<int,std::vector<int>> adj_list_init;
int Not(int node) {
return ((node < x*y) ? node+x*y : node-x*y);
}
inline bool ok_line(int i, int j) {
return arr[i][j] == 'R' && arr[i][j+1] == 'G' && arr[i][j+2] == 'W';
}
inline bool ok_column(int i, int j) {
return arr[i][j] == 'R' && arr[i+1][j] == 'G' && arr[i+2][j] == 'W';
}
void dfs(int k, int c) {
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |