oj.uz

답안 #343415

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
343415 2021-01-03T22:42:43 Z ijxjdjd Min-max tree (BOI18_minmaxtree) C++14
0 / 100
 964 ms 262148 KB 
#include <bits/stdc++.h>

#define FR(i, N) for (int i = 0; i < int(N); i++)
using namespace std;

using pi = pair<int, int>;

const int MAXN = (int)(7e4) + 5;
vector<int> adj[MAXN];
int par[MAXN];
set<int> minc[MAXN];
set<int> maxc[MAXN];
int ans[MAXN];
vector<int> color[MAXN];
vector<int> to[MAXN];
bool visited[MAXN];
int deg[MAXN];
unordered_map<int, int> condense;
int rev[MAXN];
pi merge(pi x, pi y) {
    if (minc[x.first].size() < minc[y.first].size()) {
        swap(x.first, y.first);
    }
    if (maxc[x.second].size() < minc[y.second].size()) {
        swap(x.second, y.second);
    }
    for (int i : minc[y.first]) {
        if (minc[x.first].count(i)) {
            minc[x.first].erase(i);
        }
        else {
            minc[x.first].insert(i);
        }
    }
    for (int i : maxc[y.second]) {
        if (maxc[x.second].count(i)) {
            maxc[x.second].erase(i);
        }
        else {
            maxc[x.second].insert(i);
        }
    }
//    maxc[y.second].clear();
//    minc[y.first].clear();
    return x;
}
pi root(int n, int p) {
    pi cur = {n, n};
    par[n] = p;
    for (int e : adj[n]) {
        if (e != p) {
            cur = merge(cur, root(e, n));
        }
    }
    if (minc[cur.first].size() > 0) {
        int z = *(minc[cur.first].rbegin());
        if (!condense.count(z)) {
            rev[condense.size()] = z;
            condense[z] = condense.size();
        }
        color[condense[z]].push_back(n);
        to[n].push_back(condense[z]);
    }
    if (maxc[cur.second].size() > 0) {
        int z = *(maxc[cur.second].begin());
        if (!condense.count(z)) {
            rev[condense.size()] = z;
            condense[z] = condense.size();
        }
        color[condense[z]].push_back(n);
        to[n].push_back(condense[z]);
    }
    return cur;
}
int main()
{
    int N;
    cin >> N;
    FR(i, N-1) {
        int a, b;
        cin >> a >> b;
        a--; b--;
        adj[a].push_back(b);
        adj[b].push_back(a);
        ans[i] = -1;
    }
    int K;
    cin >> K;
    FR(i, K) {
        char c;
        int x, y, z;
        cin >> c;
        cin >> x >> y >> z;
        x--, y--;
        if (x != y) {
            if (c == 'm') {
                minc[x].insert(z);
                minc[y].insert(z);
            }
            else {
                maxc[x].insert(z);
                maxc[y].insert(z);
            }
        }
    }
    root(0, 0);
    queue<int> deq;
    unordered_set<int> unvis;
    for (int i = 0; i < condense.size(); i++) {
        deg[i] = color[i].size();
        if (deg[i] == 1) {
            deq.push(i);
        }
        else {
            unvis.insert(i);
        }
    }
    while (unvis.size() > 0) {
        int j = *unvis.begin();
        unvis.erase(j);
        while (deq.size() > 0) {
            int next = deq.front(); deq.pop();
            for (int j : color[next]) {
                if (!visited[j]) {
                    visited[j] = true;
                    ans[j] = rev[next];
                    for (int e : to[j]) {
                        deg[e]--;
                        if (deg[e] == 1) {
                            deq.push(e);
                        }
                    }
                    break;
                }
            }
        }
    }
    for (int i = 1; i < N; i++) {
        if (ans[i] == -1) {
            if (to[i].size() > 0) {
                ans[i] = rev[to[i][0]];
            }
            else {
                ans[i] = 1;
            }
        }
        cout << par[i]+1 << " " << i+1 << " " << ans[i] << '\n';
    }
    return 0;
}

Compilation message

minmaxtree.cpp: In function 'int main()':
minmaxtree.cpp:109:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::unordered_map<int, int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  109 |     for (int i = 0; i < condense.size(); i++) {
      |                     ~~^~~~~~~~~~~~~~~~~

Subtask #1
0 / 7.0

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

Subtask #2
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 440 ms 58724 KB Output is correct
2 Correct 359 ms 37776 KB Output is correct
3 Runtime error 964 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)
4 Halted 0 ms 0 KB -

Subtask #3
0 / 29.0

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

Subtask #4
0 / 42.0

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