oj.uz

Submission #1113834

# Submission time Handle Problem Language Result Execution time Memory
1113834 2024-11-17T14:37:13 Z MateiKing80 Inside information (BOI21_servers) C++14
100 / 100
 403 ms 38484 KB 
#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;

struct AIB
{
    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();
    }
} ds;

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);
    }
}

//crdcr[nod] & 1 => crescator de la nod in sus
//crdcr[nod] & 2 => descrescator de la nod in sus

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;
    ds.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] += ds.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)
                ds.update(muchtopapa[j], 1);
    }
    ds.update(1, -1);
    for(auto i : qry[centr])
    {
        if(i.type == 'c')
            ans[i.time] += ds.query(i.time);
        else
        {
            if(amdat[i.to] && (crdcr[i.to] & 2) && muchtopapa[i.to] <= i.time)
                ans[i.time] = -1;
        }
    }
    ds.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()
{
    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] = -69;
        }
        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';
    }
}
/*
6 9
S 1 2
S 1 3
S 3 4
Q 5 1
S 4 5
S 1 6
Q 5 1
Q 1 5
C 1
C 2
C 3
C 4
C 5
C 6
*/

Compilation message

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

Subtask #1
2.5 / 2.5

# Verdict Execution time Memory Grader output
1 Correct 36 ms 12360 KB Output is correct
2 Correct 55 ms 12872 KB Output is correct
3 Correct 52 ms 12616 KB Output is correct
4 Correct 55 ms 12876 KB Output is correct
5 Correct 57 ms 12728 KB Output is correct
6 Correct 53 ms 12616 KB Output is correct

Subtask #2
2.5 / 2.5

# Verdict Execution time Memory Grader output
1 Correct 36 ms 12360 KB Output is correct
2 Correct 55 ms 12872 KB Output is correct
3 Correct 52 ms 12616 KB Output is correct
4 Correct 55 ms 12876 KB Output is correct
5 Correct 57 ms 12728 KB Output is correct
6 Correct 53 ms 12616 KB Output is correct
7 Correct 35 ms 12112 KB Output is correct
8 Correct 66 ms 13908 KB Output is correct
9 Correct 49 ms 13640 KB Output is correct
10 Correct 56 ms 13976 KB Output is correct
11 Correct 55 ms 13640 KB Output is correct
12 Correct 46 ms 13468 KB Output is correct

Subtask #3
2.5 / 2.5

# Verdict Execution time Memory Grader output
1 Correct 34 ms 12456 KB Output is correct
2 Correct 245 ms 35896 KB Output is correct
3 Correct 264 ms 35712 KB Output is correct

Subtask #4
2.5 / 2.5

# Verdict Execution time Memory Grader output
1 Correct 34 ms 12456 KB Output is correct
2 Correct 245 ms 35896 KB Output is correct
3 Correct 264 ms 35712 KB Output is correct
4 Correct 37 ms 12084 KB Output is correct
5 Correct 256 ms 38484 KB Output is correct
6 Correct 169 ms 36212 KB Output is correct
7 Correct 198 ms 36776 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 12360 KB Output is correct
2 Correct 346 ms 27364 KB Output is correct
3 Correct 321 ms 27288 KB Output is correct
4 Correct 249 ms 32612 KB Output is correct

Subtask #6
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 12360 KB Output is correct
2 Correct 346 ms 27364 KB Output is correct
3 Correct 321 ms 27288 KB Output is correct
4 Correct 249 ms 32612 KB Output is correct
5 Correct 36 ms 12104 KB Output is correct
6 Correct 321 ms 30316 KB Output is correct
7 Correct 268 ms 32616 KB Output is correct
8 Correct 318 ms 29956 KB Output is correct
9 Correct 321 ms 30064 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 41 ms 12316 KB Output is correct
2 Correct 229 ms 21220 KB Output is correct
3 Correct 254 ms 18924 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 41 ms 12316 KB Output is correct
2 Correct 229 ms 21220 KB Output is correct
3 Correct 254 ms 18924 KB Output is correct
4 Correct 35 ms 12104 KB Output is correct
5 Correct 246 ms 24036 KB Output is correct
6 Correct 266 ms 22036 KB Output is correct

Subtask #9
12.5 / 12.5

# Verdict Execution time Memory Grader output
1 Correct 36 ms 12360 KB Output is correct
2 Correct 313 ms 27328 KB Output is correct
3 Correct 326 ms 27288 KB Output is correct
4 Correct 247 ms 32616 KB Output is correct
5 Correct 43 ms 12360 KB Output is correct
6 Correct 220 ms 21096 KB Output is correct
7 Correct 278 ms 18924 KB Output is correct
8 Correct 267 ms 19244 KB Output is correct
9 Correct 272 ms 19660 KB Output is correct
10 Correct 328 ms 23856 KB Output is correct
11 Correct 279 ms 22436 KB Output is correct

Subtask #10
12.5 / 12.5

# Verdict Execution time Memory Grader output
1 Correct 36 ms 12360 KB Output is correct
2 Correct 313 ms 27328 KB Output is correct
3 Correct 326 ms 27288 KB Output is correct
4 Correct 247 ms 32616 KB Output is correct
5 Correct 43 ms 12360 KB Output is correct
6 Correct 220 ms 21096 KB Output is correct
7 Correct 278 ms 18924 KB Output is correct
8 Correct 267 ms 19244 KB Output is correct
9 Correct 272 ms 19660 KB Output is correct
10 Correct 328 ms 23856 KB Output is correct
11 Correct 279 ms 22436 KB Output is correct
12 Correct 35 ms 12112 KB Output is correct
13 Correct 326 ms 30564 KB Output is correct
14 Correct 249 ms 32624 KB Output is correct
15 Correct 317 ms 29888 KB Output is correct
16 Correct 321 ms 30056 KB Output is correct
17 Correct 38 ms 13128 KB Output is correct
18 Correct 239 ms 24036 KB Output is correct
19 Correct 258 ms 21928 KB Output is correct
20 Correct 243 ms 22368 KB Output is correct
21 Correct 278 ms 22720 KB Output is correct
22 Correct 245 ms 25748 KB Output is correct
23 Correct 357 ms 26764 KB Output is correct
24 Correct 393 ms 28472 KB Output is correct

Subtask #11
17.5 / 17.5

# Verdict Execution time Memory Grader output
1 Correct 36 ms 12360 KB Output is correct
2 Correct 54 ms 12692 KB Output is correct
3 Correct 52 ms 12616 KB Output is correct
4 Correct 69 ms 12872 KB Output is correct
5 Correct 70 ms 12616 KB Output is correct
6 Correct 66 ms 12844 KB Output is correct
7 Correct 36 ms 12392 KB Output is correct
8 Correct 244 ms 35896 KB Output is correct
9 Correct 244 ms 35896 KB Output is correct
10 Correct 35 ms 12360 KB Output is correct
11 Correct 283 ms 27304 KB Output is correct
12 Correct 307 ms 27348 KB Output is correct
13 Correct 238 ms 32696 KB Output is correct
14 Correct 43 ms 12360 KB Output is correct
15 Correct 237 ms 21220 KB Output is correct
16 Correct 247 ms 18924 KB Output is correct
17 Correct 275 ms 19328 KB Output is correct
18 Correct 298 ms 19416 KB Output is correct
19 Correct 308 ms 23752 KB Output is correct
20 Correct 310 ms 22312 KB Output is correct
21 Correct 239 ms 29872 KB Output is correct
22 Correct 285 ms 29468 KB Output is correct
23 Correct 244 ms 19520 KB Output is correct
24 Correct 254 ms 19628 KB Output is correct
25 Correct 332 ms 32160 KB Output is correct
26 Correct 246 ms 18228 KB Output is correct
27 Correct 260 ms 18440 KB Output is correct

Subtask #12
17.5 / 17.5

# Verdict Execution time Memory Grader output
1 Correct 36 ms 12360 KB Output is correct
2 Correct 54 ms 12692 KB Output is correct
3 Correct 52 ms 12616 KB Output is correct
4 Correct 69 ms 12872 KB Output is correct
5 Correct 70 ms 12616 KB Output is correct
6 Correct 66 ms 12844 KB Output is correct
7 Correct 36 ms 12392 KB Output is correct
8 Correct 244 ms 35896 KB Output is correct
9 Correct 244 ms 35896 KB Output is correct
10 Correct 35 ms 12360 KB Output is correct
11 Correct 283 ms 27304 KB Output is correct
12 Correct 307 ms 27348 KB Output is correct
13 Correct 238 ms 32696 KB Output is correct
14 Correct 43 ms 12360 KB Output is correct
15 Correct 237 ms 21220 KB Output is correct
16 Correct 247 ms 18924 KB Output is correct
17 Correct 275 ms 19328 KB Output is correct
18 Correct 298 ms 19416 KB Output is correct
19 Correct 308 ms 23752 KB Output is correct
20 Correct 310 ms 22312 KB Output is correct
21 Correct 239 ms 29872 KB Output is correct
22 Correct 285 ms 29468 KB Output is correct
23 Correct 244 ms 19520 KB Output is correct
24 Correct 254 ms 19628 KB Output is correct
25 Correct 332 ms 32160 KB Output is correct
26 Correct 246 ms 18228 KB Output is correct
27 Correct 260 ms 18440 KB Output is correct
28 Correct 40 ms 12100 KB Output is correct
29 Correct 64 ms 13924 KB Output is correct
30 Correct 51 ms 13640 KB Output is correct
31 Correct 61 ms 13896 KB Output is correct
32 Correct 60 ms 13640 KB Output is correct
33 Correct 50 ms 13636 KB Output is correct
34 Correct 36 ms 13024 KB Output is correct
35 Correct 241 ms 38448 KB Output is correct
36 Correct 179 ms 36332 KB Output is correct
37 Correct 183 ms 36780 KB Output is correct
38 Correct 36 ms 13128 KB Output is correct
39 Correct 333 ms 30316 KB Output is correct
40 Correct 240 ms 32456 KB Output is correct
41 Correct 293 ms 30056 KB Output is correct
42 Correct 321 ms 30060 KB Output is correct
43 Correct 38 ms 13136 KB Output is correct
44 Correct 252 ms 24000 KB Output is correct
45 Correct 255 ms 22068 KB Output is correct
46 Correct 278 ms 22368 KB Output is correct
47 Correct 304 ms 22728 KB Output is correct
48 Correct 297 ms 25752 KB Output is correct
49 Correct 403 ms 26764 KB Output is correct
50 Correct 365 ms 28408 KB Output is correct
51 Correct 234 ms 34100 KB Output is correct
52 Correct 210 ms 37480 KB Output is correct
53 Correct 234 ms 37204 KB Output is correct
54 Correct 245 ms 37496 KB Output is correct
55 Correct 188 ms 31360 KB Output is correct
56 Correct 262 ms 22060 KB Output is correct
57 Correct 290 ms 33976 KB Output is correct
58 Correct 299 ms 21340 KB Output is correct
59 Correct 244 ms 21876 KB Output is correct