oj.uz

답안 #126051

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
126051 2019-07-06T21:05:37 Z wasyl Ball Machine (BOI13_ballmachine) C++11
100 / 100
 219 ms 29816 KB 
#include <bits/stdc++.h>
#ifndef DBG
#define dbg(...)
#else
#define dbg(...) {cerr << "\033[1;96m"; __VA_ARGS__; cerr << "\033[0m";} 
#endif
#define bgn(...) begin(__VA_ARGS__)
#define rsz(...) resize(__VA_ARGS__)
#define emp(...) emplace_back(__VA_ARGS__)
#define psh(...) push_back(__VA_ARGS__)
#define ddmp(...) dbg(dmp(__VA_ARGS__))
#define prt(...) print(cout, __VA_ARGS__)
#define dprt(...) dbg(print(cerr, __VA_ARGS__))
#define dmp(...) print(cerr, #__VA_ARGS__, '=', __VA_ARGS__)
#define all(...) bgn(__VA_ARGS__), end(__VA_ARGS__)
#define siz(...) static_cast< int >((__VA_ARGS__).size())
using namespace std; using ll = long long;
template< typename... t > using V = vector< t... >;
template< typename... t > using outit = ostream_iterator< t... >;
template< typename t > void print(ostream& os, const t& a)
{os << a <<  '\n';} template< typename t, typename... v >
void print(ostream& os, const t& a, v&&... b){os << a << ' '; print(os, b...);}

constexpr int maxn = 1e5, logg = 20;

int n, q, t;
bool occ[maxn + 1];
int mi[maxn + 1];
int cnt[maxn + 1];
int sk[maxn + 1][logg];
int tb[maxn + 1], bt[maxn + 1];
set< pair< int, int > > S;
V< int > gr[maxn + 1];

void dfs1(int v, int oj)
{
    ddmp(v, oj);
    mi[v] = v;
    for (int s : gr[v])
        if (s != oj)
            dfs1(s, v), mi[v] = min(mi[v], mi[s]);
}

void dfs2(int v, int oj)
{
    dprt("dfs2");
    ddmp(v, oj);
    sk[v][0] = oj;
    tb[v] = ++t;
    bt[t] = v;

    V< pair< int, int > > ilo;
    for (int s : gr[v])
        if (s != oj)
            ilo.psh({mi[s], s});

    sort(all(ilo));

    for (auto& p : ilo)
        dfs2(p.second, v);
}

inline int zrzuc()
{
    dprt("zrzuc");
    assert(not S.empty());
    int v = (*S.begin()).second;
    S.erase(S.begin());
    occ[v] = true;
    ++cnt[sk[v][0]];
    if (sk[v][0] != 0 and cnt[sk[v][0]] == gr[sk[v][0]].size())
        S.insert({tb[sk[v][0]], sk[v][0]});

    return v;
}

inline int usun(int v)
{
    dprt("usun");
    dprt(v);
    int sum = 0;
    for (int i = logg - 1; i >= 0; --i)
        if (occ[sk[v][i]])
        {
            sum += (1 << i);
            v = sk[v][i];
        }
    ddmp(v);

    occ[v] = false;
    
    if (sk[v][0] != 0 and cnt[sk[v][0]] == gr[sk[v][0]].size())
    {
        assert(occ[sk[v][0]] == false);
        assert(S.find({tb[sk[v][0]], sk[v][0]}) != S.end());
        S.erase(S.find({tb[sk[v][0]], sk[v][0]}));
    }

    --cnt[sk[v][0]];

    S.insert({tb[v], v});

    return sum;
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    cin >> n >> q;

    for (int i = 1; i <= n; ++i)
    {
        int v; cin >> v;
        gr[v].psh(i);
    }

    dfs1(0, 0);
    dfs2(0, 0);
    
    for (int i = 1; i < logg; ++i)
        for (int k = 1; k <= n; ++k)
            sk[k][i] = sk[sk[k][i - 1]][i - 1];

    for (int i = 1; i <= n; ++i)
        if (gr[i].size() == cnt[i])
            S.insert({tb[i], i});

    for (int i = 0; i < q; ++i)
    {
        int t, v; cin >> t >> v;
        if (t == 1)
            while (v--)
            {
                if (v == 0)
                    prt(zrzuc());
                else
                    zrzuc();
            }
        if (t == 2)
            prt(usun(v));
    }
}

Compilation message

ballmachine.cpp: In function 'int zrzuc()':
ballmachine.cpp:71:41: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     if (sk[v][0] != 0 and cnt[sk[v][0]] == gr[sk[v][0]].size())
                           ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
ballmachine.cpp: In function 'int usun(int)':
ballmachine.cpp:92:41: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     if (sk[v][0] != 0 and cnt[sk[v][0]] == gr[sk[v][0]].size())
                           ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
ballmachine.cpp: In function 'int main()':
ballmachine.cpp:127:26: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         if (gr[i].size() == cnt[i])
             ~~~~~~~~~~~~~^~~~~~~~~

Subtask #1
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 2808 KB Output is correct
2 Correct 149 ms 12792 KB Output is correct
3 Correct 81 ms 12536 KB Output is correct
4 Correct 5 ms 2680 KB Output is correct
5 Correct 4 ms 2808 KB Output is correct
6 Correct 5 ms 2808 KB Output is correct
7 Correct 5 ms 2808 KB Output is correct
8 Correct 5 ms 2808 KB Output is correct
9 Correct 12 ms 3324 KB Output is correct
10 Correct 31 ms 5244 KB Output is correct
11 Correct 151 ms 12792 KB Output is correct
12 Correct 80 ms 12536 KB Output is correct
13 Correct 129 ms 12920 KB Output is correct

Subtask #2
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 43 ms 8056 KB Output is correct
2 Correct 192 ms 22292 KB Output is correct
3 Correct 112 ms 17100 KB Output is correct
4 Correct 80 ms 8996 KB Output is correct
5 Correct 80 ms 9080 KB Output is correct
6 Correct 78 ms 8988 KB Output is correct
7 Correct 78 ms 7928 KB Output is correct
8 Correct 43 ms 8056 KB Output is correct
9 Correct 163 ms 21892 KB Output is correct
10 Correct 185 ms 22264 KB Output is correct
11 Correct 169 ms 22264 KB Output is correct
12 Correct 191 ms 19500 KB Output is correct
13 Correct 118 ms 25900 KB Output is correct
14 Correct 113 ms 17260 KB Output is correct

Subtask #3
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 85 ms 12468 KB Output is correct
2 Correct 203 ms 20088 KB Output is correct
3 Correct 136 ms 24028 KB Output is correct
4 Correct 142 ms 18028 KB Output is correct
5 Correct 142 ms 18252 KB Output is correct
6 Correct 148 ms 18296 KB Output is correct
7 Correct 140 ms 16332 KB Output is correct
8 Correct 137 ms 24056 KB Output is correct
9 Correct 217 ms 22520 KB Output is correct
10 Correct 210 ms 22652 KB Output is correct
11 Correct 204 ms 22648 KB Output is correct
12 Correct 212 ms 20044 KB Output is correct
13 Correct 197 ms 29816 KB Output is correct
14 Correct 190 ms 17992 KB Output is correct

Subtask #4
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 197 ms 22256 KB Output is correct
2 Correct 216 ms 20060 KB Output is correct
3 Correct 141 ms 28948 KB Output is correct
4 Correct 217 ms 22252 KB Output is correct
5 Correct 219 ms 22524 KB Output is correct
6 Correct 180 ms 22400 KB Output is correct
7 Correct 212 ms 19960 KB Output is correct
8 Correct 139 ms 28920 KB Output is correct
9 Correct 113 ms 17124 KB Output is correct