# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
262938 | evpipis | Land of the Rainbow Gold (APIO17_rainbow) | C++11 | 3077 ms | 32996 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;
#include "rainbow.h"
#define fi first
#define se second
#define mp make_pair
#define pb push_back
typedef pair<int, int> ii;
const int len = 2e5+5;
int n, m, min_r = len, max_r = 0, min_c = len, max_c = 0;
struct bit{
vector<int> vec[len];
int row, col;
bit(int x = 0, int y = 0){
row = x;
col = y;
}
void init(){
for (int i = row; i >= 1; i--){
sort(vec[i].begin(), vec[i].end());
vec[i].erase(unique(vec[i].begin(), vec[i].end()), vec[i].end());
for (int j = i+(i&(-i)); j <= row; j += i&(-i))
for (auto &c: vec[i]) vec[j].pb(c);
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... |