oj.uz

답안 #1113836

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1113836 2024-11-17T14:44:25 Z MateiKing80 Inside information (BOI21_servers) C++14
100 / 100
 363 ms 35812 KB 
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>

using namespace std;

#define pii pair<int, int>
#define fr first
#define sc second
#define all(x) (x).begin(), (x).end()

const int N = 120000;
int n, q;

int aib[2 * N + 5];
vector<int> descos;
inline int lsb(int x)
{
    return x & -x;
}
void update(int pos, int val)
{
    while(pos < n + q)
        aib[pos] += val,
        descos.push_back(pos),
        pos += lsb(pos);
}
int query(int pos)
{
    int ans = 0;
    while(pos)
        ans += aib[pos],
        pos -= lsb(pos);
    return ans;
}
void sterge()
{
    for(auto i : descos)
        aib[i] = 0;
    descos.clear();
}

struct Query
{
    char type;
    int to, time;
};

vector<Query> qry[N + 5];
vector<pii> vec[N + 5];
int ans[2 * N + 5], sz[N + 5], muchtopapa[N + 5];
int crdcr[N + 5], papa[N + 5], papasubc[N + 5];
bool viz[N + 5], amdat[N + 5];

void dfssz(int nod, int papa)
{
    sz[nod] = 1;
    for(auto [i, j] : vec[nod])
        if(!viz[i] && i != papa)
            dfssz(i, nod), sz[nod] += sz[i];
}

int dfsCentroid(int nod, int szinit)
{
    for(auto [i, j] : vec[nod])
        if(!viz[i] && sz[i] < sz[nod] && 2 * sz[i] >= szinit)
            return dfsCentroid(i, szinit);
    return nod;
}

void dfs(int nod, vector<int> &x)
{
    x.push_back(nod);
    amdat[nod] = true;
    for(auto [i, j] : vec[nod])
    {
        if(viz[i] || i == papa[nod])
            continue;
        papa[i] = nod;
        papasubc[i] = papasubc[nod];
        muchtopapa[i] = j;
        crdcr[i] = 0;
        if(j < muchtopapa[nod] && (crdcr[nod] & 1))
            crdcr[i] ++;
        if(j > muchtopapa[nod] && (crdcr[nod] & 2))
            crdcr[i] += 2;
        dfs(i, x);
    }
}

void doCentroid(int nod)
{
    dfssz(nod, 0);
    int centr = dfsCentroid(nod, sz[nod]);
    vector<pair<int, vector<int>>> subarb;
    for(auto [i, j] : vec[centr])
    {
        if(viz[i])
            continue;
        subarb.push_back({i, {}});
        papa[i] = centr;
        papasubc[i] = i;
        muchtopapa[i] = j;
        crdcr[i] = 3;
        dfs(i, subarb.back().sc);
    }
    muchtopapa[centr] = 0;
    sort(all(subarb), [&](pair<int, vector<int>> a, pair<int, vector<int>> b)
    {
        return muchtopapa[a.fr] > muchtopapa[b.fr];
    });
    amdat[centr] = true;
    crdcr[centr] = 3;
    update(1, 1);
    for(auto [i, v] : subarb)
    {
        for(auto j : v)
            for(auto k : qry[j])
            {
                if(k.type == 'c')
                {
                    if(muchtopapa[papasubc[j]] <= k.time && (crdcr[j] & 1))
                        ans[k.time] += query(k.time);
                }
                else
                {
                    if(k.to != centr && amdat[k.to] && muchtopapa[papasubc[k.to]] > muchtopapa[papasubc[j]] &&
                            muchtopapa[k.to] <= k.time && (crdcr[k.to] & 2) && (crdcr[j] & 1))
                        ans[k.time] = -1;
                    else if(k.to == centr && (crdcr[j] & 1) && muchtopapa[papasubc[j]] <= k.time)
                        ans[k.time] = -1;
                }
            }
        for(auto j : v)
            if(crdcr[j] & 2)
                update(muchtopapa[j], 1);
    }
    update(1, -1);
    for(auto i : qry[centr])
    {
        if(i.type == 'c')
            ans[i.time] += query(i.time);
        else
        {
            if(amdat[i.to] && (crdcr[i.to] & 2) && muchtopapa[i.to] <= i.time)
                ans[i.time] = -1;
        }
    }
    sterge();
    amdat[centr] = false;
    for(auto i : subarb)
        for(auto j : i.sc)
            amdat[j] = false;
    viz[centr] = true;
    for(auto [i, j] : vec[centr])
        if(!viz[i])
            doCentroid(i);
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    cin >> n >> q;
    for(int i = 1; i < n + q; i ++)
    {
        char t;
        cin >> t;
        if(t == 'S')
        {
            int u, v;
            cin >> u >> v;
            vec[u].push_back({v, i});
            vec[v].push_back({u, i});
            ans[i] = -3;
        }
        if(t == 'Q')
        {
            int u, v;
            cin >> u >> v;
            qry[v].push_back({'q', u, i});
            ans[i] = -2;
        }
        if(t == 'C')
        {
            int u;
            cin >> u;
            qry[u].push_back({'c', 0, i});
        }
    }
    doCentroid(1);
    for(int i = 1; i < n + q; i ++)
    {
        if(ans[i] == -1)
            cout << "yes\n";
        else if(ans[i] == -2)
            cout << "no\n";
        else if(ans[i] >= 0)
            cout << ans[i] + 1 << '\n';
    }
}

Compilation message

servers.cpp: In function 'void dfssz(int, int)':
servers.cpp:57:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   57 |     for(auto [i, j] : vec[nod])
      |              ^
servers.cpp: In function 'int dfsCentroid(int, int)':
servers.cpp:64:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   64 |     for(auto [i, j] : vec[nod])
      |              ^
servers.cpp: In function 'void dfs(int, std::vector<int>&)':
servers.cpp:74:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   74 |     for(auto [i, j] : vec[nod])
      |              ^
servers.cpp: In function 'void doCentroid(int)':
servers.cpp:95:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   95 |     for(auto [i, j] : vec[centr])
      |              ^
servers.cpp:114:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
  114 |     for(auto [i, v] : subarb)
      |              ^
servers.cpp:154:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
  154 |     for(auto [i, j] : vec[centr])
      |              ^

Subtask #1
2.5 / 2.5

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 12536 KB Output is correct
2 Correct 27 ms 12880 KB Output is correct
3 Correct 24 ms 12624 KB Output is correct
4 Correct 30 ms 12980 KB Output is correct
5 Correct 28 ms 12624 KB Output is correct
6 Correct 26 ms 13004 KB Output is correct

Subtask #2
2.5 / 2.5

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 12536 KB Output is correct
2 Correct 27 ms 12880 KB Output is correct
3 Correct 24 ms 12624 KB Output is correct
4 Correct 30 ms 12980 KB Output is correct
5 Correct 28 ms 12624 KB Output is correct
6 Correct 26 ms 13004 KB Output is correct
7 Correct 20 ms 12112 KB Output is correct
8 Correct 33 ms 12848 KB Output is correct
9 Correct 27 ms 12576 KB Output is correct
10 Correct 38 ms 12880 KB Output is correct
11 Correct 36 ms 12580 KB Output is correct
12 Correct 29 ms 12376 KB Output is correct

Subtask #3
2.5 / 2.5

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 12368 KB Output is correct
2 Correct 199 ms 35812 KB Output is correct
3 Correct 180 ms 33724 KB Output is correct

Subtask #4
2.5 / 2.5

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 12368 KB Output is correct
2 Correct 199 ms 35812 KB Output is correct
3 Correct 180 ms 33724 KB Output is correct
4 Correct 19 ms 12112 KB Output is correct
5 Correct 203 ms 35644 KB Output is correct
6 Correct 159 ms 34620 KB Output is correct
7 Correct 142 ms 34676 KB Output is correct

Subtask #5
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 12456 KB Output is correct
2 Correct 271 ms 22676 KB Output is correct
3 Correct 257 ms 22680 KB Output is correct
4 Correct 178 ms 28008 KB Output is correct

Subtask #6
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 12456 KB Output is correct
2 Correct 271 ms 22676 KB Output is correct
3 Correct 257 ms 22680 KB Output is correct
4 Correct 178 ms 28008 KB Output is correct
5 Correct 30 ms 12112 KB Output is correct
6 Correct 283 ms 22584 KB Output is correct
7 Correct 183 ms 24936 KB Output is correct
8 Correct 253 ms 22580 KB Output is correct
9 Correct 254 ms 22864 KB Output is correct

Subtask #7
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 20 ms 12368 KB Output is correct
2 Correct 176 ms 21200 KB Output is correct
3 Correct 222 ms 19284 KB Output is correct

Subtask #8
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 20 ms 12368 KB Output is correct
2 Correct 176 ms 21200 KB Output is correct
3 Correct 222 ms 19284 KB Output is correct
4 Correct 19 ms 12132 KB Output is correct
5 Correct 188 ms 21220 KB Output is correct
6 Correct 205 ms 19052 KB Output is correct

Subtask #9
12.5 / 12.5

# 결과 실행 시간 메모리 Grader output
1 Correct 21 ms 12368 KB Output is correct
2 Correct 246 ms 22556 KB Output is correct
3 Correct 233 ms 22684 KB Output is correct
4 Correct 179 ms 28004 KB Output is correct
5 Correct 19 ms 12368 KB Output is correct
6 Correct 155 ms 21092 KB Output is correct
7 Correct 189 ms 19016 KB Output is correct
8 Correct 195 ms 19332 KB Output is correct
9 Correct 212 ms 19660 KB Output is correct
10 Correct 227 ms 22728 KB Output is correct
11 Correct 219 ms 21944 KB Output is correct

Subtask #10
12.5 / 12.5

# 결과 실행 시간 메모리 Grader output
1 Correct 21 ms 12368 KB Output is correct
2 Correct 246 ms 22556 KB Output is correct
3 Correct 233 ms 22684 KB Output is correct
4 Correct 179 ms 28004 KB Output is correct
5 Correct 19 ms 12368 KB Output is correct
6 Correct 155 ms 21092 KB Output is correct
7 Correct 189 ms 19016 KB Output is correct
8 Correct 195 ms 19332 KB Output is correct
9 Correct 212 ms 19660 KB Output is correct
10 Correct 227 ms 22728 KB Output is correct
11 Correct 219 ms 21944 KB Output is correct
12 Correct 17 ms 12112 KB Output is correct
13 Correct 245 ms 22620 KB Output is correct
14 Correct 177 ms 24940 KB Output is correct
15 Correct 231 ms 22708 KB Output is correct
16 Correct 257 ms 22896 KB Output is correct
17 Correct 19 ms 12112 KB Output is correct
18 Correct 178 ms 21220 KB Output is correct
19 Correct 193 ms 19052 KB Output is correct
20 Correct 203 ms 19300 KB Output is correct
21 Correct 246 ms 19876 KB Output is correct
22 Correct 243 ms 22676 KB Output is correct
23 Correct 363 ms 22412 KB Output is correct
24 Correct 317 ms 23708 KB Output is correct

Subtask #11
17.5 / 17.5

# 결과 실행 시간 메모리 Grader output
1 Correct 20 ms 12368 KB Output is correct
2 Correct 34 ms 12804 KB Output is correct
3 Correct 27 ms 12624 KB Output is correct
4 Correct 34 ms 12880 KB Output is correct
5 Correct 33 ms 12616 KB Output is correct
6 Correct 28 ms 13004 KB Output is correct
7 Correct 19 ms 12368 KB Output is correct
8 Correct 225 ms 35772 KB Output is correct
9 Correct 223 ms 33720 KB Output is correct
10 Correct 19 ms 12368 KB Output is correct
11 Correct 283 ms 22676 KB Output is correct
12 Correct 317 ms 22680 KB Output is correct
13 Correct 170 ms 28008 KB Output is correct
14 Correct 18 ms 12528 KB Output is correct
15 Correct 179 ms 21160 KB Output is correct
16 Correct 217 ms 19012 KB Output is correct
17 Correct 201 ms 19372 KB Output is correct
18 Correct 219 ms 19536 KB Output is correct
19 Correct 233 ms 22720 KB Output is correct
20 Correct 268 ms 21884 KB Output is correct
21 Correct 200 ms 29872 KB Output is correct
22 Correct 214 ms 29392 KB Output is correct
23 Correct 196 ms 19424 KB Output is correct
24 Correct 211 ms 19544 KB Output is correct
25 Correct 237 ms 32184 KB Output is correct
26 Correct 182 ms 18364 KB Output is correct
27 Correct 164 ms 18436 KB Output is correct

Subtask #12
17.5 / 17.5

# 결과 실행 시간 메모리 Grader output
1 Correct 20 ms 12368 KB Output is correct
2 Correct 34 ms 12804 KB Output is correct
3 Correct 27 ms 12624 KB Output is correct
4 Correct 34 ms 12880 KB Output is correct
5 Correct 33 ms 12616 KB Output is correct
6 Correct 28 ms 13004 KB Output is correct
7 Correct 19 ms 12368 KB Output is correct
8 Correct 225 ms 35772 KB Output is correct
9 Correct 223 ms 33720 KB Output is correct
10 Correct 19 ms 12368 KB Output is correct
11 Correct 283 ms 22676 KB Output is correct
12 Correct 317 ms 22680 KB Output is correct
13 Correct 170 ms 28008 KB Output is correct
14 Correct 18 ms 12528 KB Output is correct
15 Correct 179 ms 21160 KB Output is correct
16 Correct 217 ms 19012 KB Output is correct
17 Correct 201 ms 19372 KB Output is correct
18 Correct 219 ms 19536 KB Output is correct
19 Correct 233 ms 22720 KB Output is correct
20 Correct 268 ms 21884 KB Output is correct
21 Correct 200 ms 29872 KB Output is correct
22 Correct 214 ms 29392 KB Output is correct
23 Correct 196 ms 19424 KB Output is correct
24 Correct 211 ms 19544 KB Output is correct
25 Correct 237 ms 32184 KB Output is correct
26 Correct 182 ms 18364 KB Output is correct
27 Correct 164 ms 18436 KB Output is correct
28 Correct 18 ms 12124 KB Output is correct
29 Correct 33 ms 12872 KB Output is correct
30 Correct 25 ms 12624 KB Output is correct
31 Correct 38 ms 12872 KB Output is correct
32 Correct 34 ms 12624 KB Output is correct
33 Correct 27 ms 12356 KB Output is correct
34 Correct 26 ms 12140 KB Output is correct
35 Correct 177 ms 33592 KB Output is correct
36 Correct 135 ms 32748 KB Output is correct
37 Correct 145 ms 34840 KB Output is correct
38 Correct 20 ms 12112 KB Output is correct
39 Correct 288 ms 22736 KB Output is correct
40 Correct 263 ms 24984 KB Output is correct
41 Correct 274 ms 22576 KB Output is correct
42 Correct 281 ms 22776 KB Output is correct
43 Correct 20 ms 12112 KB Output is correct
44 Correct 187 ms 21220 KB Output is correct
45 Correct 246 ms 19056 KB Output is correct
46 Correct 228 ms 19348 KB Output is correct
47 Correct 236 ms 19900 KB Output is correct
48 Correct 221 ms 22676 KB Output is correct
49 Correct 305 ms 22412 KB Output is correct
50 Correct 304 ms 23800 KB Output is correct
51 Correct 163 ms 31260 KB Output is correct
52 Correct 159 ms 34732 KB Output is correct
53 Correct 149 ms 34680 KB Output is correct
54 Correct 146 ms 34792 KB Output is correct
55 Correct 155 ms 28816 KB Output is correct
56 Correct 191 ms 19244 KB Output is correct
57 Correct 260 ms 31304 KB Output is correct
58 Correct 248 ms 18644 KB Output is correct
59 Correct 191 ms 18552 KB Output is correct