# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
704465 | BrineTw | Dijamant (COCI22_dijamant) | C++14 | 1 ms | 436 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>
using namespace std;
const int dx[] = {1,-1, 0, 0};
const int dy[] = {0, 0, 1,-1};
int main() {
int h, w;
cin >> h >> w;
vector<string> temp(h);
for (auto& s: temp) cin >> s;
vector< vector<int> > graph(h + 2, vector<int>(w + 2, -1));
vector< vector<int> > visited(h + 2, vector<int>(w + 2, 0));
for (int i = 0; i < h; i++) {
for (int j = 0; j < w; j++) {
if (temp[i][j] == '#') {
graph[i + 1][j + 1] = 1;
} else {
graph[i + 1][j + 1] = 0;
}
}
}
set< pair<int, int> > s;
int white = 0, black;
for (int i = 1; i <= 1000; i++) {
s.insert({white, 4 * i});
white += 4 * i;
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |