oj.uz

답안 #331771

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
331771 2020-11-30T03:05:11 Z thecodingwizard Izlet (COI19_izlet) C++11
18 / 100
 697 ms 61416 KB 
#include <bits/stdc++.h>

using namespace std;

using ll = long long;
#define ii pair<int, int>
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define all(x) x.begin(), x.end()
#define F0R(i, n) for (int i = 0; i < n; i++)
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define inf 1000000010

#define maxn 3000
int n; 
int input[maxn][maxn];

vector<int> nodes; // stores nodes remaining after 1's are compressed
map<int, vector<int>> nodesInOneComponent;
void compressOnes() {
    vector<bool> done(n, 0);
    F0R(i, n) {
        if (done[i]) continue;
        nodes.pb(i);
        done[i] = true;
        F0R(j, n) {
            if (input[i][j] == 1 && j != i) {
                nodesInOneComponent[i].pb(j);
                done[j] = true;
            }
        }
    }
}

vector<vector<int>> twoComponents;
bool inSameComponent[maxn][maxn];
vector<int> components[maxn];
void findTwos() {
    for (int n1 : nodes) {
        for (int n2 : nodes) {
            if (inSameComponent[n1][n2]) continue;
            if (input[n1][n2] != 2) continue;

            twoComponents.pb(vector<int>());
            twoComponents.back().pb(n1);
            twoComponents.back().pb(n2);
            for (int n3 : nodes) {
                if (input[n1][n3] == 2 && input[n2][n3] == 2) {
                    twoComponents.back().pb(n3);
                }
            }

            for (int x : twoComponents.back()) {
                for (int y : twoComponents.back()) {
                    inSameComponent[x][y] = 1;
                }
                components[x].pb(twoComponents.size()-1);
            }
        }
    }

    /*
    for (auto x : twoComponents) {
        for (auto y : x) {
            cout << y << " ";
        }
        cout << endl;
    }
    cout << "---" << endl;
    */
}

int assignedColor[maxn];
vector<ii> outputEdges;
vector<int> adj[maxn];
bool inQueue[maxn];
bool visited[maxn];

void buildTree() {
    int colors = 2;
    assignedColor[nodes[0]] = 1;
    queue<int> q;
    for (int c : components[nodes[0]]) {
        q.push(c);
        inQueue[c] = true;
    }

    while (!q.empty()) {
        int c = q.front(); q.pop();
        int rootNode = -1;
        int childNode = -1;
        for (int x : twoComponents[c]) {
            if (assignedColor[x] > 0) {
                assert(rootNode == -1);
                rootNode = x;
            } else {
                childNode = x;
            }
        }

        adj[childNode].pb(rootNode);
        adj[rootNode].pb(childNode);
        outputEdges.pb(mp(childNode, rootNode));

        fill(visited, visited+n, 0);
        queue<ii> q2;
        q2.push(mp(childNode, 1));
        visited[childNode] = true;
        while (!q2.empty()) {
            ii x = q2.front(); q2.pop();
            if (input[childNode][x.f] != x.s) {
                assert(input[childNode][x.f] = x.s-1);
                assignedColor[childNode] = assignedColor[x.f];
                break;
            }
            for (int y : adj[x.f]) {
                if (!visited[y]) {
                    visited[y] = true;
                    q2.push(mp(y, x.s+1));
                }
            }
        }

        if (assignedColor[childNode] == 0) {
            assignedColor[childNode] = colors++;
        }

        for (int x : twoComponents[c]) {
            if (x != rootNode && x != childNode) {
                assignedColor[x] = assignedColor[childNode];
                adj[x].pb(rootNode);
                adj[rootNode].pb(x);
                outputEdges.pb(mp(x, rootNode));
            }
            for (int c : components[x]) {
                if (!inQueue[c]) {
                    q.push(c);
                    inQueue[c] = true;
                }
            }
        }
    }
}

void decompressOnes() {
    for (int x : nodes) {
        for (int y : nodesInOneComponent[x]) {
            outputEdges.pb(mp(x, y));
            assignedColor[y] = assignedColor[x];
        }
    }
}

int main() {
    cin.tie(0)->sync_with_stdio(0);

    int subtask; cin >> subtask;
    cin >> n;
    F0R(i, n) {
        F0R(j, n) {
            cin >> input[i][j];
        }
    }

    compressOnes();

    findTwos();

    buildTree();

    decompressOnes();

    F0R(i, n) cout << assignedColor[i] << " ";
    cout << endl;
    for (auto x : outputEdges) cout << x.f+1 << " " << x.s+1 << endl;

    return 0;
}

Subtask #1
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 620 KB Output is correct
2 Correct 638 ms 45164 KB Output is correct
3 Correct 697 ms 45164 KB Output is correct
4 Correct 576 ms 41708 KB Output is correct
5 Correct 604 ms 44232 KB Output is correct

Subtask #2
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 620 ms 61416 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 57.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 620 KB Output is correct
2 Correct 638 ms 45164 KB Output is correct
3 Correct 697 ms 45164 KB Output is correct
4 Correct 576 ms 41708 KB Output is correct
5 Correct 604 ms 44232 KB Output is correct
6 Incorrect 620 ms 61416 KB Output isn't correct
7 Halted 0 ms 0 KB -