# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
881789 | Hakiers | Team Contest (JOI22_team) | C++17 | 2091 ms | 3420 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;
constexpr int BASE = 1<<18;
struct cord{
int x, y, z;
};
cord INPUT[BASE];
int n;
int check(int i, int j, int k){
int ilei = 0;
int ilej = 0;
int ilek = 0;
int x = max({INPUT[i].x, INPUT[j].x, INPUT[k].x});
int y = max({INPUT[i].y, INPUT[j].y, INPUT[k].y});
int z = max({INPUT[i].z, INPUT[j].z, INPUT[k].z});
if(INPUT[i].x == x) ilei++;
if(INPUT[i].y == y) ilei++;
if(INPUT[i].z == z) ilei++;
if(INPUT[j].x == x) ilej++;
if(INPUT[j].y == y) ilej++;
if(INPUT[j].z == z) ilej++;
if(INPUT[k].x == x) ilek++;
if(INPUT[k].y == y) ilek++;
if(INPUT[k].z == z) ilek++;
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |