# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1004351 | fuad27 | Trobojnica (COCI19_trobojnica) | C++17 | 901 ms | 46084 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;
vector<array<int,3>> v;
set<array<int,3>> vals;
set<array<int,3>> best;
vector<array<int,3>> res;
map<array<int,2>, int> vls;
set<array<int,3>>::iterator nxt(set<array<int,3>>::iterator xx, set<array<int,3>>& ssss) {
auto x=xx;
x++;
if(x == ssss.end()) {
x=ssss.begin();
return x;
}
return x;
}
set<array<int,3>>::iterator prv(set<array<int,3>>::iterator xx, set<array<int,3>>& ssss) {
auto x=xx;
if(x == ssss.begin())return --ssss.end();
return (--x);
}
void recalc(array<int,3> idx) {
auto it = vals.find(idx);
auto it2 = nxt(it, vals);
auto it3 = nxt(it2, vals);
int val = 3;
if((*it2)[2] != (*it)[2]) {
val--;;
if((1^2^3^(*it2)[2]^(*it)[2]) != (*it3)[2]) {
val--;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |