oj.uz

답안 #552552

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
552552 2022-04-23T09:44:51 Z Killer2501 Amusement Park (JOI17_amusement_park) C++14
90 / 100
 83 ms 48544 KB 
#include "Joi.h"
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define ull unsigned long long
#define pb push_back
#define pll pair<int, pii>
#define pii pair<int, int>
#define fi first
#define se second
using namespace std;
const int N = 2e5+2;
const int M = 60;
const int mod = 1e9+7;
const ll base = 1e6;
const ll inf = 1e9;
int n, m, b[N], a[N], k, d[N], cnt, par[N], f[N];
ll ans;
vector<int> adj[N];
bool vis[N], ok;
set<pii> leaf;
set<int> st[N], cur, res;
void dfs(int u, int p = -1)
{
    pii change;
    set<int> stchange;
    vis[u] = true;
    if(cnt < M)d[u] = cnt++;
    else
    {
        auto it = leaf.begin();
        if(d[par[u]] == (*it).se)++it;
        int v = (*it).se;
        cur.erase(b[v]);
        change.fi = v;
        change.se = b[v];
        d[u] = v;
        leaf.erase(it);
        stchange = st[v];
        for(int x: st[v])
        {
            leaf.erase({(int)st[x].size(), x});
            st[x].erase(v);
            leaf.insert({(int)st[x].size(), x});
        }
        st[v].clear();
    }
    if(u != 0)leaf.insert({1, d[u]});
    else leaf.insert({0, d[u]});
    b[d[u]] = u;
    cur.insert(u);
    if(p == u)ok = true;
    if(ok && cnt == M)
    {
        res = cur;
        ok = false;
    }
    if(u != 0)
    {
        int v = d[par[u]];
        leaf.erase({(int)st[v].size(), v});
        st[v].insert(d[u]);
        st[d[u]].insert(v);
        leaf.insert({(int)st[v].size(), v});
    }
    //cout << u <<" "<<d[u]<<'\n';
    for(int v: adj[u])
    {
        if(vis[v])continue;
        par[v] = u;
        dfs(v, p);
    }
    if(!stchange.empty())
    {
        cur.erase(u);
        cur.insert(change.se);
        leaf.erase({1, d[u]});
        leaf.insert({1, change.fi});
        b[change.fi] = change.se;
        for(int x: stchange)
        {
            leaf.erase({(int)st[x].size(), x});
            st[x].insert(change.fi);
            leaf.insert({(int)st[x].size(), x});
        }
        st[change.fi] = stchange;
        int v = d[par[u]];
        leaf.erase({(int)st[v].size(), v});
        st[v].erase(d[u]);
        st[d[u]].erase(v);
        leaf.insert({(int)st[v].size(), v});
    }
}
void Joi(int n, int m, int A[], int B[], ll x, int T)
{
    for(int i = 0; i < n; i ++)
    {
        st[i].clear();
        adj[i].clear();
    }
    leaf.clear();
    res.clear();
    cur.clear();
    cnt = 0;
    for(int i = 0; i < m; i ++)
    {
        adj[A[i]].pb(B[i]);
        adj[B[i]].pb(A[i]);
    }
    fill_n(d, n, -1);
    fill_n(par, n, -1);
    fill_n(vis, n, 0);
    dfs(0);
    for(int i = 0; i < n; i ++)
    {
        MessageBoard(i, (x>>d[i]&1));
    }

}


#include "Ioi.h"
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define ull unsigned long long
#define pb push_back
#define pll pair<int, pii>
#define pii pair<int, int>
#define fi first
#define se second
using namespace std;
const int N = 2e5+2;
const int M = 60;
const int mod = 1e9+7;
const ll base = 1e6;
const ll inf = 1e9;
int n, m, b[N], a[N], k, d[N], cnt, par[N], f[N];
ll ans;
vector<int> adj[N];
bool vis[N], ok;
set<pii> leaf;
set<int> st[N], cur, res;
void dfs(int u, int p = -1)
{
    pii change;
    set<int> stchange;
    vis[u] = true;
    if(cnt < M)d[u] = cnt++;
    else
    {
        auto it = leaf.begin();
        if(d[par[u]] == (*it).se)++it;
        int v = (*it).se;
        cur.erase(b[v]);
        change.fi = v;
        change.se = b[v];
        d[u] = v;
        leaf.erase(it);
        stchange = st[v];
        for(int x: st[v])
        {
            leaf.erase({(int)st[x].size(), x});
            st[x].erase(v);
            leaf.insert({(int)st[x].size(), x});
        }
        st[v].clear();
    }
    if(u != 0)leaf.insert({1, d[u]});
    else leaf.insert({0, d[u]});
    b[d[u]] = u;
    cur.insert(u);
    if(p == u)ok = true;
    if(ok && cnt == M)
    {
        res = cur;
        ok = false;
    }
    if(u != 0)
    {
        int v = d[par[u]];
        leaf.erase({(int)st[v].size(), v});
        st[v].insert(d[u]);
        st[d[u]].insert(v);
        leaf.insert({(int)st[v].size(), v});
    }
    //cout << u <<" "<<d[u]<<'\n';
    for(int v: adj[u])
    {
        if(vis[v])continue;
        par[v] = u;
        dfs(v, p);
    }
    if(!stchange.empty())
    {
        cur.erase(u);
        cur.insert(change.se);
        leaf.erase({1, d[u]});
        leaf.insert({1, change.fi});
        b[change.fi] = change.se;
        for(int x: stchange)
        {
            leaf.erase({(int)st[x].size(), x});
            st[x].insert(change.fi);
            leaf.insert({(int)st[x].size(), x});
        }
        st[change.fi] = stchange;
        int v = d[par[u]];
        leaf.erase({(int)st[v].size(), v});
        st[v].erase(d[u]);
        st[d[u]].erase(v);
        leaf.insert({(int)st[v].size(), v});
    }
}
void cal(int u)
{
    //cout << u <<" "<<d[u]<<" "<<a[d[u]]<<'\n';
    for(int v: adj[u])
    {
        if(res.find(v) == res.end())continue;
        if(a[d[v]] == -1)
        {
            a[d[v]] = Move(v);
            res.erase(v);
            cal(v);
            Move(u);
        }
    }
}
ll Ioi(int n, int m, int A[], int B[], int P, int V, int T)
{
    for(int i = 0; i < n; i ++)
    {
        st[i].clear();
        adj[i].clear();
    }
    res.clear();
    cur.clear();
    leaf.clear();
    cnt = 0;
    ok = false;
    for(int i = 0; i < m; i ++)
    {
        adj[A[i]].pb(B[i]);
        adj[B[i]].pb(A[i]);
    }
    fill_n(d, n, -1);
    fill_n(par, n, -1);
    fill_n(vis, n, 0);
    dfs(0, P);

    fill_n(a, M, -1);
    a[d[P]] = V;
    cal(P);
    ll res = 0;
    for(int i = 0; i < M; i ++)
    {
        //cout << a[i] <<" "<<i<<'\n';
        assert(a[i] != -1);
        if(a[i])
            res |= (1ll<<i);
    }
    return res;
}

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 28948 KB Output is correct
2 Correct 19 ms 28884 KB Output is correct
3 Correct 20 ms 28856 KB Output is correct
4 Correct 18 ms 28880 KB Output is correct
5 Correct 16 ms 28972 KB Output is correct
6 Correct 19 ms 28888 KB Output is correct
7 Correct 19 ms 28944 KB Output is correct
8 Correct 20 ms 28976 KB Output is correct
9 Correct 18 ms 28832 KB Output is correct
10 Correct 20 ms 28924 KB Output is correct
11 Correct 22 ms 29228 KB Output is correct
12 Correct 16 ms 28980 KB Output is correct
13 Correct 18 ms 28956 KB Output is correct
14 Correct 18 ms 28860 KB Output is correct
15 Correct 17 ms 28968 KB Output is correct
16 Correct 19 ms 28940 KB Output is correct
17 Correct 19 ms 28888 KB Output is correct
18 Correct 17 ms 28888 KB Output is correct

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 73 ms 34220 KB Output is correct
2 Correct 75 ms 34384 KB Output is correct
3 Correct 83 ms 34324 KB Output is correct
4 Correct 64 ms 30540 KB Output is correct
5 Correct 57 ms 32736 KB Output is correct
6 Correct 55 ms 32096 KB Output is correct
7 Correct 53 ms 32184 KB Output is correct
8 Correct 60 ms 32404 KB Output is correct
9 Correct 67 ms 32568 KB Output is correct
10 Correct 41 ms 30828 KB Output is correct
11 Correct 49 ms 30664 KB Output is correct
12 Correct 56 ms 30508 KB Output is correct
13 Correct 46 ms 30444 KB Output is correct
14 Correct 49 ms 30568 KB Output is correct
15 Correct 49 ms 30644 KB Output is correct
16 Correct 52 ms 30496 KB Output is correct
17 Correct 52 ms 30596 KB Output is correct
18 Correct 54 ms 30628 KB Output is correct
19 Correct 49 ms 30748 KB Output is correct
20 Correct 47 ms 33108 KB Output is correct
21 Correct 46 ms 32984 KB Output is correct
22 Correct 55 ms 31876 KB Output is correct
23 Runtime error 60 ms 48544 KB Execution killed with signal 6
24 Halted 0 ms 0 KB -

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 28880 KB Output is correct
2 Correct 17 ms 28920 KB Output is correct
3 Correct 16 ms 28980 KB Output is correct
4 Correct 20 ms 30012 KB Output is correct
5 Correct 22 ms 30036 KB Output is correct
6 Correct 20 ms 29904 KB Output is correct
7 Correct 20 ms 30036 KB Output is correct
8 Correct 20 ms 30024 KB Output is correct
9 Correct 49 ms 35544 KB Output is correct
10 Correct 49 ms 35436 KB Output is correct
11 Correct 46 ms 35640 KB Output is correct
12 Correct 16 ms 29012 KB Output is correct
13 Correct 16 ms 28960 KB Output is correct
14 Correct 17 ms 29004 KB Output is correct
15 Correct 15 ms 28972 KB Output is correct

Subtask #4
55.0 / 55.0

# 결과 실행 시간 메모리 Grader output
1 Correct 65 ms 34316 KB Output is correct
2 Correct 63 ms 34308 KB Output is correct
3 Correct 59 ms 34524 KB Output is correct
4 Correct 49 ms 30628 KB Output is correct
5 Correct 52 ms 34088 KB Output is correct
6 Correct 53 ms 32484 KB Output is correct
7 Correct 51 ms 32464 KB Output is correct
8 Correct 52 ms 31696 KB Output is correct
9 Correct 53 ms 31960 KB Output is correct
10 Correct 40 ms 30772 KB Output is correct
11 Correct 40 ms 30828 KB Output is correct
12 Correct 43 ms 30432 KB Output is correct
13 Correct 45 ms 30476 KB Output is correct
14 Correct 51 ms 30472 KB Output is correct
15 Correct 47 ms 30700 KB Output is correct
16 Correct 48 ms 30640 KB Output is correct
17 Correct 47 ms 30576 KB Output is correct
18 Correct 48 ms 30596 KB Output is correct
19 Correct 48 ms 30512 KB Output is correct
20 Correct 45 ms 33072 KB Output is correct
21 Correct 45 ms 32980 KB Output is correct
22 Correct 53 ms 32492 KB Output is correct
23 Correct 51 ms 32316 KB Output is correct
24 Correct 51 ms 32112 KB Output is correct
25 Correct 53 ms 32592 KB Output is correct
26 Correct 52 ms 32484 KB Output is correct
27 Correct 52 ms 32852 KB Output is correct
28 Correct 53 ms 32044 KB Output is correct
29 Correct 48 ms 32132 KB Output is correct
30 Correct 53 ms 32204 KB Output is correct

Subtask #5
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 68 ms 34312 KB Output is correct
2 Correct 67 ms 34396 KB Output is correct
3 Correct 62 ms 34448 KB Output is correct
4 Correct 50 ms 30536 KB Output is correct
5 Correct 53 ms 34660 KB Output is correct
6 Correct 51 ms 31976 KB Output is correct
7 Correct 51 ms 31904 KB Output is correct
8 Correct 52 ms 32552 KB Output is correct
9 Correct 53 ms 32220 KB Output is correct
10 Correct 39 ms 30784 KB Output is correct
11 Correct 37 ms 30716 KB Output is correct
12 Correct 41 ms 30548 KB Output is correct
13 Correct 43 ms 30424 KB Output is correct
14 Correct 46 ms 30508 KB Output is correct
15 Correct 48 ms 30584 KB Output is correct
16 Correct 52 ms 30696 KB Output is correct
17 Correct 47 ms 30648 KB Output is correct
18 Correct 50 ms 30632 KB Output is correct
19 Correct 47 ms 30624 KB Output is correct
20 Correct 45 ms 33240 KB Output is correct
21 Correct 46 ms 32992 KB Output is correct
22 Correct 54 ms 32312 KB Output is correct
23 Correct 60 ms 32176 KB Output is correct
24 Correct 62 ms 32148 KB Output is correct
25 Correct 56 ms 32216 KB Output is correct
26 Correct 55 ms 32004 KB Output is correct
27 Correct 51 ms 32828 KB Output is correct
28 Correct 52 ms 32836 KB Output is correct
29 Correct 51 ms 32832 KB Output is correct
30 Correct 53 ms 32452 KB Output is correct
31 Correct 19 ms 28944 KB Output is correct
32 Correct 18 ms 28936 KB Output is correct
33 Correct 16 ms 28980 KB Output is correct
34 Correct 16 ms 28968 KB Output is correct
35 Correct 15 ms 28944 KB Output is correct
36 Correct 17 ms 28964 KB Output is correct
37 Correct 19 ms 28964 KB Output is correct
38 Correct 16 ms 28968 KB Output is correct
39 Correct 16 ms 28928 KB Output is correct
40 Correct 17 ms 28952 KB Output is correct
41 Correct 15 ms 28964 KB Output is correct
42 Correct 17 ms 28956 KB Output is correct