제출 #396758

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
396758		priority_queue	슈퍼트리 잇기 (IOI20_supertrees)	C++14	40 / 100	305 ms	22412 KiB

supertrees

#include <bits/stdc++.h>

using namespace std;

#define forint(i, N) for (int i = 0; i < (N); i++)

using namespace std;


void build(std::vector<std::vector<int> > b);

int construct(vector<std::vector<int> > p) {

    int N = p.size();

    vector< vector<int> > b(N, vector<int>(N, 0));

    vector<int> visited(N, -1);

    forint(i, N) {
        if (visited[i] < 0) { // create new. All connected to i also not visited
            //visited[i] = i;
            vector<int> path2;
            vector<int> path3;

            forint (j, N) {
                if (j == i) {
                    if (p[i][i]!=1) {
                        return 0;
                    }
                    continue;
                }
                if (p[i][j] == 1) {
                    b[i][j] = 1;
                    b[j][i] = 1;
                    visited[j] = i;
                    continue;
                }

                if (p[i][j] == 2) {
                    if (!path3.empty()) {
                        return 0;
                    }
                    path2.push_back(j);
                    visited[j] = i;
                    continue;
                }

                if (p[i][j] == 3) {
                    if (!path2.empty()) {
                        return 0;
                    }
                    path3.push_back(j);
                    visited[j] = i;
                    continue;
                }
            }

            if (!path2.empty()) {
                if (path2.size() < 2) {
                    return 0;
                }
                b[i][path2[0]] = 1;
                b[path2[0]][i] = 1;
                forint(j, path2.size()-1) {
                    b[path2[j]][path2[j+1]] = 1;
                    b[path2[j+1]][path2[j]] = 1;
                }

                b[i][path2[path2.size()-1]] = 1;
                b[path2[path2.size()-1]][i] = 1;

            }

            if (!path3.empty()) {
                if (path3.size() < 3) {
                    return 0;
                }

                b[i][path3[1]] = 1;
                b[path3[1]][i] = 1;
                for(int j = 1; j < path3.size()-1; j++) {
                    b[path3[j]][path3[j+1]] = 1;
                    b[path3[j+1]][path3[j]] = 1;
                }

                b[i][path3[path3.size()-1]] = 1;
                b[path3[path3.size()-1]][i] = 1;

                b[i][path3[0]] = 1;
                b[path3[0]][i] = 1;

                b[path3[0]][path3[1]] = 1;
                b[path3[1]][path3[0]] = 1;
            }
        }
        else { // check if it is OK
            forint (j, N) {
                if (j != i && j != visited[i]) {
                    if (p[i][j] == p[visited[i]][j] && p[i][j] == p[visited[i]][i]) {
                        continue;
                    }
                    if (p[i][j] == p[visited[i]][j] * p[visited[i]][i]) {
                        continue;
                    }
                    //cout << i << " ---- " << j << endl;
                    return 0;
                }
            }
        }
    }

    build(b);

    return 1;

}

컴파일 시 표준 에러 (stderr) 메시지

supertrees.cpp: In function 'int construct(std::vector<std::vector<int> >)':
supertrees.cpp:5:40: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    5 | #define forint(i, N) for (int i = 0; i < (N); i++)
      |                                        ^
supertrees.cpp:65:17: note: in expansion of macro 'forint'
   65 |                 forint(j, path2.size()-1) {
      |                 ^~~~~~
supertrees.cpp:82:34: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   82 |                 for(int j = 1; j < path3.size()-1; j++) {
      |                                ~~^~~~~~~~~~~~~~~~

• Subtask 1: 11 / 11
• Subtask 2: 10 / 10
• Subtask 3: 19 / 19
• Subtask 4: 0 / 35
• Subtask 5: 0 / 21
• Subtask 6: 0 / 4