oj.uz

답안 #707298

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
707298 2023-03-08T18:08:38 Z Nhoksocqt1 열대 식물원 (Tropical Garden) (IOI11_garden) C++17
69 / 100
 5000 ms 61844 KB 
#include<bits/stdc++.h>
#include "garden.h"
#include "gardenlib.h"
using namespace std;

#define inf 0x3f3f3f3f
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#define sz(x) int((x).size())
#define fi first
#define se second
typedef long long ll;
typedef pair<int, int> ii;

template<class X, class Y>
	inline bool maximize(X &x, const Y &y) {return (x < y ? x = y, 1 : 0);}
template<class X, class Y>
	inline bool minimize(X &x, const Y &y) {return (x > y ? x = y, 1 : 0);}

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int Random(int l, int r) {
    return uniform_int_distribution<int>(l, r)(rng);
}

const int MAXN = 150005;
const int MAXM = 300005;

struct Edge {
    int u, v;
} edge[MAXN];

struct Query {
    int K, pos;
} qr[2005];

vector<ii> adj[MAXN];
vector<int> adjp[MAXM], comp[MAXM], B[MAXM];
ii a[MAXM], b[MAXM], itOf[MAXM];
int h[MAXM], timeIn[MAXM], timeOut[MAXM], result[2005];
int firstToLoop[MAXM], firstInLoop[MAXM], loopOf[MAXM], posInComp[MAXM];
int deg[MAXM], pa[MAXM], idc[MAXM], idn[MAXN], numNode, numEdge, numQuery, lastNode;
bool dx[MAXM], ok[MAXM];

inline int getLeftNode(int id) {
    return (id >= numEdge) ? edge[id - numEdge].v : edge[id].u;
}

int timeIn0;
void preDfs(int u, int p) {
    timeIn[u] = ++timeIn0;
    if(ok[u])
        B[h[u]].push_back(timeIn[u]);

    for (int it = 0; it < int(adjp[u].size()); ++it) {
        int v(adjp[u][it]);
        if(v != p) {
            h[v] = 1 + h[u];
            preDfs(v, u);
        }
    }

    timeOut[u] = timeIn0;
}

void count_routes(int _N, int _M, int _P, int _R[][2], int _Q, int _G[]) {
    numNode = _N, numEdge = _M, lastNode = _P, numQuery = _Q;
    for (int i = 0; i < _M; ++i) {
        int u(_R[i][0]), v(_R[i][1]);
        edge[i] = {u, v};
        adj[u].push_back({v, i});
        adj[v].push_back({u, i});
    }

    for (int u = 0; u < numNode; ++u) {
        int id0 = adj[u][0].se;
        int id1 = (adj[u].size() > 1 ? adj[u][1].se : 1e9+7);
        bool type0 = (u == edge[adj[u][0].se].v);
        bool type1 = (adj[u].size() > 1 && (u == edge[adj[u][1].se].v));

        for (int it = 0; it < int(adj[u].size()); ++it) {
            int v(adj[u][it].fi), id(adj[u][it].se);
            bool type = !(u == edge[id].v);
            if(it == 0) {
                idn[u] = id + !type * numEdge;
                ok[idn[u]] = 1;
            }

            pa[id + type * numEdge] = (id != id0 || id1 >= 1e9+7) ? id0 + type0 * numEdge : id1 + type1 * numEdge;
            ++deg[pa[id + type * numEdge]];
        }
    }

    int numComp(0);
    for (int id = 0; id < 2 * numEdge; ++id) {
        if(deg[id] || dx[id])
            continue;

        vector<int> tmpn;
        int tmp(id);
        while(!dx[tmp]) {
            dx[tmp] = 1;
            tmpn.push_back(tmp);
            tmp = pa[tmp];
        }

        int szn(tmpn.size());
        for (int it = 0; it <= szn; ++it) {
            if(it == szn || tmpn[it] == tmp) {
                if(it < szn) {
                    for (int jt = it; jt < szn; ++jt) {
                        posInComp[tmpn[jt]] = jt - it;
                        comp[numComp].push_back(tmpn[jt]);
                        firstInLoop[tmpn[jt]] = tmpn[jt];
                        loopOf[tmpn[jt]] = szn - it;
                        firstToLoop[tmpn[jt]] = 0;
                        idc[tmpn[jt]] = numComp;
                    }

                    ++numComp;
                }

                if(it > 0) {
                    adjp[tmp].push_back(tmpn[it - 1]);
                    for (int jt = 0; jt < it; ++jt) {
                        posInComp[tmpn[jt]] = jt;
                        comp[numComp].push_back(tmpn[jt]);
                        firstToLoop[tmpn[jt]] = it - jt + firstToLoop[tmp];
                        firstInLoop[tmpn[jt]] = firstInLoop[tmp];
                        idc[tmpn[jt]] = numComp;
                        if(jt + 1 < it)
                            adjp[tmpn[jt + 1]].push_back(tmpn[jt]);
                    }

                    ++numComp;
                }

                break;
            }
        }
    }

    for (int id = 0; id < 2 * numEdge; ++id) {
        if(!deg[id] || dx[id])
            continue;

        int tmp(id);
        while(!dx[tmp]) {
            dx[tmp] = 1;
            posInComp[tmp] = comp[numComp].size();
            comp[numComp].push_back(tmp);
            idc[tmp] = numComp;
            firstToLoop[tmp] = 0;
            firstInLoop[tmp] = tmp;
            tmp = pa[tmp];
        }

        int szn(comp[numComp].size());
        for (int it = 0; it < szn; ++it)
            loopOf[comp[numComp][it]] = szn;

        ++numComp;
    }

    for (int id = 0; id < 2 * numEdge; ++id) {
        if(!timeIn[id])
            preDfs(id, -1);

        a[id] = {timeIn[id], id};
        b[id] = {timeOut[id], id};
    }

    for (int t = 0; t < numQuery; ++t)
        qr[t] = {_G[t], t};

    sort(qr, qr + numQuery, [](const Query &a, const Query &b) {
        return a.K < b.K;
    });

    sort(a, a + 2 * numEdge);
    sort(b, b + 2 * numEdge);

    for (int itn = 0; itn < 2 * numEdge; ++itn) {
        int id(a[itn].se);
        if(adjp[id].size() == 0 || getLeftNode(id) != lastNode)
            continue;

        for (int t = 0; t < numQuery; ++t) {
            int K(qr[t].K), pos(qr[t].pos);
            if(h[id] + K > 2 * numEdge || B[h[id] + K].empty())
                break;

            h[id] += K;
            int szB(B[h[id]].size());
            while(itOf[h[id]].fi < szB && B[h[id]][itOf[h[id]].fi] <= timeOut[id])
                ++itOf[h[id]].fi;

            result[pos] += itOf[h[id]].fi;
            h[id] -= K;
        }
    }

    for (int itn = 0; itn < 2 * numEdge; ++itn) {
        int id(b[itn].se);
        if(adjp[id].size() == 0 || getLeftNode(id) != lastNode)
            continue;

        for (int t = 0; t < numQuery; ++t) {
            int K(qr[t].K), pos(qr[t].pos);
            if(h[id] + K > 2 * numEdge || B[h[id] + K].empty())
                break;

            h[id] += K;
            int szB(B[h[id]].size());
            while(itOf[h[id]].se < szB && B[h[id]][itOf[h[id]].se] < timeIn[id])
                ++itOf[h[id]].se;

            result[pos] -= itOf[h[id]].se;
            h[id] -= K;
        }
    }

    for (int t = 0; t < numQuery; ++t) {
        int K(qr[t].K), pos(qr[t].pos);
        for (int u = 0; u < numNode; ++u) {
            if(firstToLoop[idn[u]] >= K)
                continue;

            int id(firstInLoop[idn[u]]), posn = (posInComp[id] + K - firstToLoop[idn[u]]) % loopOf[id];
            result[pos] += (getLeftNode(comp[idc[id]][posn]) == lastNode);
        }
    }

    for (int t = 0; t < numQuery; ++t) {
        //cout << result[t] << '\n';
        answer(result[t]);
    }
}

Compilation message

garden.cpp:8: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
    8 | #pragma GCC optimization ("O3")
      | 
garden.cpp:9: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
    9 | #pragma GCC optimization ("unroll-loops")
      | 
garden.cpp: In function 'void count_routes(int, int, int, int (*)[2], int, int*)':
garden.cpp:82:17: warning: unused variable 'v' [-Wunused-variable]
   82 |             int v(adj[u][it].fi), id(adj[u][it].se);
      |                 ^

Subtask #1
49.0 / 49.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 25300 KB Output is correct
2 Correct 13 ms 25268 KB Output is correct
3 Correct 13 ms 25292 KB Output is correct
4 Correct 13 ms 25096 KB Output is correct
5 Correct 13 ms 25172 KB Output is correct
6 Correct 15 ms 25684 KB Output is correct
7 Correct 17 ms 25116 KB Output is correct
8 Correct 14 ms 25328 KB Output is correct
9 Correct 19 ms 26708 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 25300 KB Output is correct
2 Correct 13 ms 25268 KB Output is correct
3 Correct 13 ms 25292 KB Output is correct
4 Correct 13 ms 25096 KB Output is correct
5 Correct 13 ms 25172 KB Output is correct
6 Correct 15 ms 25684 KB Output is correct
7 Correct 17 ms 25116 KB Output is correct
8 Correct 14 ms 25328 KB Output is correct
9 Correct 19 ms 26708 KB Output is correct
10 Correct 13 ms 25072 KB Output is correct
11 Correct 29 ms 29780 KB Output is correct
12 Correct 78 ms 36924 KB Output is correct
13 Correct 48 ms 39744 KB Output is correct
14 Correct 301 ms 58752 KB Output is correct
15 Correct 342 ms 59828 KB Output is correct
16 Correct 264 ms 55856 KB Output is correct
17 Correct 221 ms 55200 KB Output is correct
18 Correct 91 ms 37580 KB Output is correct
19 Correct 284 ms 58436 KB Output is correct
20 Correct 331 ms 59936 KB Output is correct
21 Correct 291 ms 56528 KB Output is correct
22 Correct 258 ms 55208 KB Output is correct
23 Correct 277 ms 59896 KB Output is correct

Subtask #3
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 25300 KB Output is correct
2 Correct 13 ms 25268 KB Output is correct
3 Correct 13 ms 25292 KB Output is correct
4 Correct 13 ms 25096 KB Output is correct
5 Correct 13 ms 25172 KB Output is correct
6 Correct 15 ms 25684 KB Output is correct
7 Correct 17 ms 25116 KB Output is correct
8 Correct 14 ms 25328 KB Output is correct
9 Correct 19 ms 26708 KB Output is correct
10 Correct 13 ms 25072 KB Output is correct
11 Correct 29 ms 29780 KB Output is correct
12 Correct 78 ms 36924 KB Output is correct
13 Correct 48 ms 39744 KB Output is correct
14 Correct 301 ms 58752 KB Output is correct
15 Correct 342 ms 59828 KB Output is correct
16 Correct 264 ms 55856 KB Output is correct
17 Correct 221 ms 55200 KB Output is correct
18 Correct 91 ms 37580 KB Output is correct
19 Correct 284 ms 58436 KB Output is correct
20 Correct 331 ms 59936 KB Output is correct
21 Correct 291 ms 56528 KB Output is correct
22 Correct 258 ms 55208 KB Output is correct
23 Correct 277 ms 59896 KB Output is correct
24 Correct 15 ms 25136 KB Output is correct
25 Correct 342 ms 30120 KB Output is correct
26 Correct 550 ms 37544 KB Output is correct
27 Correct 1157 ms 40848 KB Output is correct
28 Correct 2619 ms 60416 KB Output is correct
29 Correct 2779 ms 61784 KB Output is correct
30 Correct 1622 ms 57404 KB Output is correct
31 Correct 2025 ms 56796 KB Output is correct
32 Correct 652 ms 38256 KB Output is correct
33 Correct 2743 ms 60408 KB Output is correct
34 Correct 2658 ms 61620 KB Output is correct
35 Correct 1920 ms 58488 KB Output is correct
36 Correct 2188 ms 56860 KB Output is correct
37 Correct 2575 ms 61844 KB Output is correct
38 Execution timed out 5021 ms 52256 KB Time limit exceeded
39 Halted 0 ms 0 KB -