# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
223467 | maomao90 | Checker (COCI19_checker) | C++14 | 3093 ms | 31608 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 <cstdio>
#include <algorithm>
#include <utility>
#include <map>
#include <tuple>
#include <cmath>
using namespace std;
typedef pair <int, int> ii;
typedef pair <ii, int> iii;
int tc;
int N;
int colours[200005];
iii diagonals[200005];
map <ii, int> dColours;
bool isInvalid[200005];
bool comp(iii right, iii left)
{
int rx, ry, lx, ly;
tie(rx, ry) = right.first; tie(lx, ly) = left.first;
if (abs(rx - ry) < abs(lx - ly)) return true;
else if (abs(rx - ry) == abs(lx - ly))
{
if (rx < ry) return true;
}
return false;
}
int main()
{
scanf("%d%d", &tc, &N);
for (int i = 1; i <= N; i++)
{
char temp; scanf(" %c", &temp);
colours[i] = temp - '0';
}
for (int i = 0; i < N - 3; i++)
{
int X, Y, C; scanf("%d%d%d", &X, &Y, &C);
if (X > Y) swap(X, Y);
diagonals[i] = iii(ii(X, Y), C);
dColours[ii(X, Y)] = C;
dColours[ii(Y, X)] = C;
}
sort(diagonals, diagonals + N - 3, comp);
for (int i = 0; i < N - 3; i++)
{
int x, y, c;
tie(x, y) = diagonals[i].first; c = diagonals[i].second;
if (isInvalid[x] || isInvalid[y])
{
printf("neispravna triangulacija\n");
return 0;
}
for (int j = x + 1; j < y; j++) isInvalid[j] = true;
}
printf("tocno\n");
return 0;
}
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... |