# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
732441 | SanguineChameleon | 무지개나라 (APIO17_rainbow) | C++17 | 3066 ms | 225820 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;
struct BIT {
set<pair<int, int>> S;
vector<map<int, int>> bit;
int R, C;
void init(int _R, int _C) {
R = _R;
C = _C;
bit.resize(R + 1);
}
void add(int x, int y) {
if (x < 1 || x > R || y < 1 || y > C || S.find({x, y}) != S.end()) {
return;
}
S.insert({x, y});
}
void update(int x, int y) {
for (int i = x; i <= R; i += i & (-i)) {
for (int j = y; j <= C; j += j & (-j)) {
bit[i][j]++;
}
}
}
# | 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... |