oj.uz

답안 #226936

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
226936 2020-04-25T17:53:32 Z qkxwsm Traffickers (RMI18_traffickers) C++14
5 / 100
 1688 ms 60384 KB 
#include <bits/stdc++.h>

using namespace std;

template<class T, class U>
void ckmin(T &a, U b)
{
    if (a > b) a = b;
}

template<class T, class U>
void ckmax(T &a, U b)
{
    if (a < b) a = b;
}

#define MP make_pair
#define PB push_back
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define SZ(x) ((int) (x).size())
#define ALL(x) (x).begin(), (x).end()
#define FOR(i, a, b) for (auto i = (a); i < (b); i++)
#define FORD(i, a, b) for (auto i = (a) - 1; i >= (b); i--)

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<pii> vpi;
typedef vector<pll> vpl;

const int MAXN = 30013;

int N, K, Q, T;
vi edge[MAXN];
int fen[23][23][MAXN], parent[MAXN];
int stor[23][23][MAXN];
vi ord;
int st[MAXN], depth[MAXN], st1[MAXN], ft1[MAXN];
int table[20][2 * MAXN];

int comb(int u, int v)
{
    return (depth[u] > depth[v] ? v : u);
}
int query(int l, int r)
{
    int sz = 31 - __builtin_clz(r - l + 1);
    return comb(table[sz][l], table[sz][r - (1 << sz) + 1]);
}
void dfs(int u, int p)
{
    ord.PB(u);
    st[u] = SZ(ord) - 1;
    st1[u] = T;
    ft1[u] = T;
    T++;
    for (int v : edge[u])
    {
        if (v == p) continue;
        parent[v] = u;
        depth[v] = depth[u] + 1;
        dfs(v, u);
        ord.PB(u);
        ft1[u] = ft1[v];
    }
}
int lca(int u, int v)
{
    u = st[u], v = st[v];
    if (u > v) swap(u, v);
    return query(u, v);
}
void update(int f, int g, int idx, int v)
{
    for (int e = idx + 1; e <= N; e += e & (-e))
    {
        fen[f][g][e] += v;
    }
}
int query(int f, int g, int idx)
{
    int res = 0;
    for (int e = idx + 1; e; e -= e & (-e))
    {
        res += fen[f][g][e];
    }
    return res;
}
void work(int u, int v, int f)
{
    int w = lca(u, v);
    vi path, path1;
    int x = u;
    while(x != w)
    {
        path.PB(x);
        x = parent[x];
    }
    x = v;
    while(x != w)
    {
        path1.PB(x);
        x = parent[x];
    }
    reverse(ALL(path1));
    path.PB(w);
    path.insert(path.end(), ALL(path1));
    //we have the path from u to v
    int m = SZ(path);
    FOR(i, 0, SZ(path))
    {
        int w = path[i];
        update(m, i, st1[w], f);
        update(m, i, ft1[w] + 1, -f);
        stor[m][i][w]++;
    }
    return;
}
ll cntmod(ll x, int a, int b)
{
    if (x < a) return 0;
    //how many numbers in 0...x are a modulo b?
    x -= a;
    return (x / b) + 1;
}

int32_t main()
{
    cout << fixed << setprecision(12);
    cerr << fixed << setprecision(4);
    ios_base::sync_with_stdio(false); cin.tie(0);
    cin >> N;
    FOR(i, 0, N - 1)
    {
        int u, v;
        cin >> u >> v; u--; v--;
        edge[u].PB(v);
        edge[v].PB(u);
    }
    dfs(0, N);
    FOR(i, 0, SZ(ord))
    {
    	table[0][i] = ord[i];
    }
    FOR(i, 1, 20)
    {
    	FOR(j, 0, SZ(ord) - (1 << i) + 1)
    	{
    		table[i][j] = comb(table[i - 1][j], table[i - 1][j + (1 << (i - 1))]);
    	}
    }
    cin >> K;
    FOR(i, 0, K)
    {
        int u, v;
        cin >> u >> v; u--; v--;
        work(u, v, 1);
    }
    cin >> Q;
    while(Q--)
    {
        int qid, u, v;
        cin >> qid >> u >> v; u--; v--;
        if (qid == 1)
        {
            work(u, v, 1);
        }
        if (qid == 2)
        {
            work(u, v, -1);
        }
        if (qid == 3)
        {
            ll l, r;
            cin >> l >> r;
            ll ans = 0;
            int w = lca(u, v);
            FOR(i, 1, 22)
            {
                // cerr << "i = " << i << endl;
                FOR(j, 0, i)
                {
                    // cerr << "j = " << j << endl;
                    //j mod i
                    //how many numbers in [l...r] are j mod i?
                    ll cur = 0, co = cntmod(r, j, i) - cntmod(l - 1, j, i);
                    cur += query(i, j, st1[u]);
                    cur += query(i, j, st1[v]);
                    cur -= 2 * query(i, j, st1[w]);
                    cur += stor[i][j][w];
                    ans += cur * co;
                    // cerr << "co = " << co << endl;
                    // cerr << j << ' ' << i << ' ' << co << endl;
                }
            }
            cout << ans << '\n';
        }
    }
}

Subtask #1
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 6 ms 2944 KB Output isn't correct
2 Incorrect 9 ms 4736 KB Output isn't correct
3 Incorrect 10 ms 4480 KB Output isn't correct

Subtask #2
0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 114 ms 20088 KB Output isn't correct
2 Incorrect 112 ms 17144 KB Output isn't correct
3 Incorrect 116 ms 20728 KB Output isn't correct
4 Incorrect 119 ms 19656 KB Output isn't correct
5 Incorrect 110 ms 18808 KB Output isn't correct
6 Incorrect 120 ms 19192 KB Output isn't correct
7 Incorrect 113 ms 19320 KB Output isn't correct
8 Incorrect 125 ms 21496 KB Output isn't correct
9 Incorrect 90 ms 22008 KB Output isn't correct

Subtask #3
5.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1333 ms 54780 KB Output isn't correct
2 Incorrect 1359 ms 58152 KB Output isn't correct
3 Incorrect 1263 ms 59128 KB Output isn't correct
4 Incorrect 1260 ms 47632 KB Output isn't correct
5 Incorrect 1688 ms 45288 KB Output isn't correct
6 Incorrect 1339 ms 59480 KB Output isn't correct
7 Incorrect 1064 ms 60384 KB Output isn't correct
8 Correct 1198 ms 60152 KB Output is correct