oj.uz

답안 #223494

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
223494 2020-04-15T10:13:48 Z maomao90 Checker (COCI19_checker) C++14
29 / 110
 3000 ms 4660 KB 
#include <cstdio>
#include <algorithm>
#include <utility>
#include <unordered_map>
#include <tuple>
#include <cmath>

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;
iii diagonals[300005];
unordered_map <ii, int, pair_hash> colours;
bool isInvalid[300005];
int impt1[300005], impt2[300005];

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[ii(i, (i + 1 > N ? 1 : i + 1))] = temp - '0';
        colours[ii((i + 1 > N ? 1 : i + 1), i)] = temp - '0';
        impt1[i] = i == N ? 1 : i + 1;
        impt2[i] = i == 1 ? N : i - 1;
    }
    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);
        colours[ii(X, Y)] = C;
        colours[ii(Y, X)] = C;
    }
    sort(diagonals, diagonals + N - 3, comp);
    for (int i = 0; i < N - 3; i++)
    {
        int x, y, c;
        x = diagonals[i].first.first; y = diagonals[i].first.second; c = diagonals[i].second;
        if (isInvalid[x] || isInvalid[y])
        {
            printf("neispravna triangulacija\n");
            return 0;
        }
        int impt;
        if (impt1[x] == impt1[y] || impt1[x] == impt2[y]) impt = impt1[x];
        else impt = impt2[x];
        isInvalid[impt] = true;
        if (impt1[x] == impt) impt1[x] = y;
        else impt2[x] = y;
        if (impt1[y] == impt) impt1[y] = x;
        else impt2[y] = x;
    }
    for (int i = 1; i <= N; i++)
    {
        impt1[i] = i == N ? 1 : i + 1;
        impt2[i] = i == 1 ? N : i - 1;
    }
    for (int i = 0; i < N - 3; i++)
    {
        int x, y, c;
        x = diagonals[i].first.first; y = diagonals[i].first.second; c = diagonals[i].second;
        int impt;
        if (impt1[x] == impt1[y] || impt1[x] == impt2[y]) impt = impt1[x];
        else impt = impt2[x];

        if (colours[ii(x, y)] == colours[ii(x, impt)] ||
            colours[ii(x, y)] == colours[ii(y, impt)] ||
            colours[ii(x, impt)] == colours[ii(y, impt)])
        {
            printf("neispravno bojenje\n");
            return 0;
        }
        if (impt1[x] == impt) impt1[x] = y;
        else impt2[x] = y;
        if (impt1[y] == impt) impt1[y] = x;
        else impt2[y] = x;
    }
    printf("tocno\n");
    return 0;
}

Compilation message

checker.cpp: In function 'int main()':
checker.cpp:63:19: warning: variable 'c' set but not used [-Wunused-but-set-variable]
         int x, y, c;
                   ^
checker.cpp:86:19: warning: variable 'c' set but not used [-Wunused-but-set-variable]
         int x, y, c;
                   ^
checker.cpp:43: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:46:25: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         char temp; scanf(" %c", &temp);
                    ~~~~~^~~~~~~~~~~~~~
checker.cpp:54: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 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 6 ms 384 KB Output is correct
7 Correct 4 ms 384 KB Output is correct

Subtask #2
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 6 ms 384 KB Output is correct
7 Correct 4 ms 384 KB Output is correct
8 Correct 45 ms 896 KB Output is correct
9 Correct 44 ms 896 KB Output is correct
10 Correct 27 ms 896 KB Output is correct
11 Correct 25 ms 888 KB Output is correct
12 Correct 26 ms 888 KB Output is correct
13 Correct 35 ms 896 KB Output is correct
14 Correct 27 ms 896 KB Output is correct

Subtask #3
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 3080 ms 4660 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 3079 ms 4464 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 6 ms 384 KB Output is correct
7 Correct 4 ms 384 KB Output is correct
8 Correct 45 ms 896 KB Output is correct
9 Correct 44 ms 896 KB Output is correct
10 Correct 27 ms 896 KB Output is correct
11 Correct 25 ms 888 KB Output is correct
12 Correct 26 ms 888 KB Output is correct
13 Correct 35 ms 896 KB Output is correct
14 Correct 27 ms 896 KB Output is correct
15 Execution timed out 3080 ms 4660 KB Time limit exceeded
16 Halted 0 ms 0 KB -