# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
212623 | ereonzis | Chameleon's Love (JOI20_chameleon) | C++17 | 44 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 "chameleon.h"
#include <bits/stdc++.h>
using namespace std;
using LL = long long int;
using uLL = unsigned long long int;
using uint = unsigned int;
using ld = long double;
const int MAXN = 1007;
vector <int> group[MAXN];
vector <int> structure[4];
int ans[MAXN], beloved[MAXN], beloving[MAXN];
vector <vector <int> > indices = {{0, 1}, {0, 2}};
vector <int> not_present = {2, 1};
vector <int> sub_vector(int l, int r, vector <int> &w){
if(l > r){
vector <int> res;
return res;
}
vector <int> res(r-l);
for(int i = l; i < r; i++){
res[i-l] = w[i];
}
return res;
}
# | 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... |