oj.uz

답안 #223543

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
223543 2020-04-15T11:08:17 Z maomao90 Checker (COCI19_checker) C++14
110 / 110
 124 ms 19696 KB 
#include <cstdio>
#include <algorithm>
#include <utility>
#include <unordered_map>
#include <tuple>
#include <cmath>
#include <cassert>
#include <vector>

using namespace std;

typedef pair <int, int> ii;
typedef pair <ii, int> iii;

struct pair_hash
{
	template <class T1, class T2>
	std::size_t operator() (const std::pair<T1, T2> &pair) const
	{
		return std::hash<T1>()(pair.first) ^ std::hash<T2>()(pair.second);
	}
};

int tc;
int N;
char temps[200005];
iii diagonals[200005];
vector <iii> countSort[200005];
//unordered_map <ii, int, pair_hash> colours;
bool isInvalid[200005];
ii impt1[200005], impt2[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);
    scanf(" %s", temps);
    for (int i = 1; i <= N; i++)
    {
        char temp = temps[i - 1];
        /*
        if (i == N)
        {
            colours[ii(i, 1)] = (int) temp - '0';
            colours[ii(1, i)] = (int) temp - '0';
        }
        else
        {
            colours[ii(i, i + 1)] = (int) temp - '0';
            colours[ii(i + 1, i)] = (int) temp - '0';
        }
        */
        if (i == N)
        {
            impt1[i] = ii(1, temp - '0');
            impt2[1] = ii(i, temp - '0');
        }
        else
        {
            impt1[i] = ii(i + 1, temp - '0');
            impt2[i + 1] = ii(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);
        countSort[abs(X - Y)].push_back(iii(ii(X, Y), C));
        /*
        colours[ii(X, Y)] = C;
        colours[ii(Y, X)] = C;
        */
    }

    int pointer = 0;
    for (int i = 0; i < N + 5; i++)
    {
        for (iii xyc : countSort[i]) diagonals[pointer++] = xyc;
    }

    //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;
        }
        int impt;
        if (impt1[x].first == impt1[y].first || impt1[x].first == impt2[y].first) impt = impt1[x].first;
        else impt = impt2[x].first;
        isInvalid[impt] = true;
        if (impt1[x].first == impt) impt1[x] = ii(y, c);
        else impt2[x] = ii(y, c);
        if (impt1[y].first == impt) impt1[y] = ii(x, c);
        else impt2[y] = ii(x, c);
    }
    for (int i = 1; i <= N; i++)
    {
        char temp = temps[i - 1];
        /*
        if (i == N)
        {
            colours[ii(i, 1)] = (int) temp - '0';
            colours[ii(1, i)] = (int) temp - '0';
        }
        else
        {
            colours[ii(i, i + 1)] = (int) temp - '0';
            colours[ii(i + 1, i)] = (int) temp - '0';
        }
        */
        if (i == N)
        {
            impt1[i] = ii(1, temp - '0');
            impt2[1] = ii(i, temp - '0');
        }
        else
        {
            impt1[i] = ii(i + 1, temp - '0');
            impt2[i + 1] = ii(i, temp - '0');
        }
    }
    for (int i = 0; i < N - 3; i++)
    {
        int x, y, c;
        tie(x, y) = diagonals[i].first; c = diagonals[i].second;
        int impt, c1, c2;
        if (impt1[x].first == impt1[y].first || impt1[x].first == impt2[y].first)
        {
            impt = impt1[x].first;
            c1 = impt1[x].second;
            c2 = impt1[y].first == impt ? impt1[y].second : impt2[y].second;
        }
        else
        {
            impt = impt2[x].first;
            c1 = impt2[x].second;
            c2 = impt1[y].first == impt ? impt1[y].second : impt2[y].second;
        }

        if (c == c1 || c == c2 || c1 == c2)
        {
            printf("neispravno bojenje\n");
            return 0;
        }

        if (impt1[x].first == impt) impt1[x] = ii(y, c);
        else impt2[x] = ii(y, c);
        if (impt1[y].first == impt) impt1[y] = ii(x, c);
        else impt2[y] = ii(x, c);
    }
    printf("tocno\n");
    return 0;
}

Compilation message

checker.cpp: In function 'int main()':
checker.cpp:47:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d", &tc, &N);
     ~~~~~^~~~~~~~~~~~~~~~~
checker.cpp:48:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf(" %s", temps);
     ~~~~~^~~~~~~~~~~~~~
checker.cpp:77:27: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         int X, Y, C; scanf("%d%d%d", &X, &Y, &C);
                      ~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 5120 KB Output is correct
2 Correct 8 ms 4992 KB Output is correct
3 Correct 7 ms 4992 KB Output is correct
4 Correct 8 ms 4992 KB Output is correct
5 Correct 7 ms 4992 KB Output is correct
6 Correct 7 ms 4992 KB Output is correct
7 Correct 7 ms 4992 KB Output is correct

Subtask #2
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 5120 KB Output is correct
2 Correct 8 ms 4992 KB Output is correct
3 Correct 7 ms 4992 KB Output is correct
4 Correct 8 ms 4992 KB Output is correct
5 Correct 7 ms 4992 KB Output is correct
6 Correct 7 ms 4992 KB Output is correct
7 Correct 7 ms 4992 KB Output is correct
8 Correct 8 ms 5120 KB Output is correct
9 Correct 8 ms 5120 KB Output is correct
10 Correct 8 ms 5120 KB Output is correct
11 Correct 8 ms 5120 KB Output is correct
12 Correct 9 ms 5120 KB Output is correct
13 Correct 8 ms 5120 KB Output is correct
14 Correct 8 ms 5120 KB Output is correct

Subtask #3
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 95 ms 13744 KB Output is correct
2 Correct 97 ms 16876 KB Output is correct
3 Correct 96 ms 16816 KB Output is correct
4 Correct 103 ms 16940 KB Output is correct
5 Correct 89 ms 16940 KB Output is correct
6 Correct 110 ms 17144 KB Output is correct
7 Correct 115 ms 17784 KB Output is correct
8 Correct 116 ms 19696 KB Output is correct
9 Correct 122 ms 18656 KB Output is correct

Subtask #4
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 96 ms 13676 KB Output is correct
2 Correct 99 ms 16944 KB Output is correct
3 Correct 96 ms 16944 KB Output is correct
4 Correct 107 ms 17068 KB Output is correct
5 Correct 95 ms 16944 KB Output is correct
6 Correct 120 ms 19448 KB Output is correct
7 Correct 116 ms 18936 KB Output is correct
8 Correct 116 ms 17656 KB Output is correct
9 Correct 120 ms 17784 KB Output is correct

Subtask #5
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 5120 KB Output is correct
2 Correct 8 ms 4992 KB Output is correct
3 Correct 7 ms 4992 KB Output is correct
4 Correct 8 ms 4992 KB Output is correct
5 Correct 7 ms 4992 KB Output is correct
6 Correct 7 ms 4992 KB Output is correct
7 Correct 7 ms 4992 KB Output is correct
8 Correct 8 ms 5120 KB Output is correct
9 Correct 8 ms 5120 KB Output is correct
10 Correct 8 ms 5120 KB Output is correct
11 Correct 8 ms 5120 KB Output is correct
12 Correct 9 ms 5120 KB Output is correct
13 Correct 8 ms 5120 KB Output is correct
14 Correct 8 ms 5120 KB Output is correct
15 Correct 95 ms 13744 KB Output is correct
16 Correct 97 ms 16876 KB Output is correct
17 Correct 96 ms 16816 KB Output is correct
18 Correct 103 ms 16940 KB Output is correct
19 Correct 89 ms 16940 KB Output is correct
20 Correct 110 ms 17144 KB Output is correct
21 Correct 115 ms 17784 KB Output is correct
22 Correct 116 ms 19696 KB Output is correct
23 Correct 122 ms 18656 KB Output is correct
24 Correct 96 ms 13676 KB Output is correct
25 Correct 99 ms 16944 KB Output is correct
26 Correct 96 ms 16944 KB Output is correct
27 Correct 107 ms 17068 KB Output is correct
28 Correct 95 ms 16944 KB Output is correct
29 Correct 120 ms 19448 KB Output is correct
30 Correct 116 ms 18936 KB Output is correct
31 Correct 116 ms 17656 KB Output is correct
32 Correct 120 ms 17784 KB Output is correct
33 Correct 96 ms 16748 KB Output is correct
34 Correct 96 ms 16816 KB Output is correct
35 Correct 96 ms 16816 KB Output is correct
36 Correct 93 ms 17068 KB Output is correct
37 Correct 100 ms 16944 KB Output is correct
38 Correct 94 ms 16872 KB Output is correct
39 Correct 101 ms 16872 KB Output is correct
40 Correct 113 ms 17400 KB Output is correct
41 Correct 124 ms 19448 KB Output is correct
42 Correct 117 ms 19192 KB Output is correct
43 Correct 118 ms 17784 KB Output is correct