oj.uz

Submission #926779

# Submission time Handle Problem Language Result Execution time Memory
926779 2024-02-13T17:33:01 Z Tuanlinh123 Amusement Park (JOI17_amusement_park) C++17
28 / 100
 39 ms 5464 KB 
#include "Joi.h"
#include<bits/stdc++.h>
#define ll long long
#define pll pair<ll, ll>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define ld long double
using namespace std;

void Joi(int n, int m, int u[], int v[], ll x, int t) 
{
    vector <vector <ll>> A(n);
    for (ll i=0; i<m; i++)
        A[u[i]].pb(v[i]), A[v[i]].pb(u[i]);
    vector <ll> tin(n, -1); ll Time=0;
    function <void(ll)> dfs=[&](ll u)
    {
        tin[u]=Time, Time=(Time+1)%60;
        MessageBoard(u, (x>>tin[u])&1);
        for (ll v:A[u])
            if (tin[v]==-1)
                dfs(v);
    }; dfs(0);
}

#include "Ioi.h"
#include<bits/stdc++.h>
#define ll long long
#define pll pair<ll, ll>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define ld long double
using namespace std;

ll Ioi(int n, int m, int u[], int v[], int p, int cr, int t) 
{
    vector <vector <ll>> A(n);
    for (ll i=0; i<m; i++)
        A[u[i]].pb(v[i]), A[v[i]].pb(u[i]);
    ll Time=0, pos=0;
    vector <pll> realedge;
    vector <ll> order, tin(n, -1); 
    function <void(ll)> dfs=[&](ll u)
    {
        if (u==p) pos=order.size(); order.pb(u);
        tin[u]=Time, Time=(Time+1)%60;
        for (ll v:A[u])
            if (tin[v]==-1)
                realedge.pb({v, u}), dfs(v);
    }; dfs(0);
    for (ll i=0; i<n; i++) A[i].clear();
    for (auto [u, v]:realedge) A[u].pb(v), A[v].pb(u);
    pll best={1e9, 0};
    for (ll i=pos; i>=0 && i>pos-60; i--)
    {
        if (i+60>n) continue;
        vector <ll> mark(n, 0), dis(n, 0);
        for (ll j=i; j<i+60; j++)
            mark[order[j]]=1;
        function <void(ll, ll)> dfs1=[&](ll u, ll pa)
        {
            for (ll v:A[u]) if (v!=pa)
            {
                dfs1(v, u), mark[u]|=mark[v];
                if (mark[v]) dis[u]=max(dis[u], dis[v]+1);
            }
        }; dfs1(p, -1);
        ll cnt=0, Max=0;
        for (ll j=0; j<n; j++)
            cnt+=mark[j], Max=max(Max, dis[j]);
        best=min(best, {(cnt-1)*2-Max, i});
    }
    // assert(best.fi<=120);
    vector <ll> mark(n, 0), pa(n, -1), ism(n, 0);
    vector <pll> dis(n, {0, -1}); 
    for (ll j=best.se; j<best.se+60; j++)
        mark[order[j]]=1;
    function <void(ll)> dfs1=[&](ll u)
    {
        for (ll v:A[u]) if (v!=pa[u])
        {
            pa[v]=u, dfs1(v), mark[u]|=mark[v];
            if (mark[v]) dis[u]=max(dis[u], {dis[v].fi+1, v});
        }
    }; dfs1(p);
    ll Max=p; ism[Max]=1;
    while (dis[Max].se!=-1)
        Max=dis[Max].se, ism[Max]=1;
    ll cnt=0, bit[60]={}; bit[tin[p]]=cr;
    function <void(ll)> answer=[&](ll u)
    {
        for (ll& v:A[u]) if (ism[v] && v!=pa[u])
            {swap(v, A[u].back()); break;}
        for (ll v:A[u])
            if (mark[v] && v!=pa[u])
                bit[tin[v]]=Move(v), cnt++, answer(v);
        if (!ism[u]) bit[tin[pa[u]]]=Move(pa[u]), cnt++;
    }; answer(p);
    // assert(cnt<=120);
    ll ans=0;
    for (ll i=0; i<60; i++)
        if (bit[i]) ans|=1ll<<i;
    return ans;
}

Compilation message

Ioi.cpp: In lambda function:
Ioi.cpp:22:9: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
   22 |         if (u==p) pos=order.size(); order.pb(u);
      |         ^~
Ioi.cpp:22:37: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
   22 |         if (u==p) pos=order.size(); order.pb(u);
      |                                     ^~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 780 KB Output is correct
2 Correct 0 ms 780 KB Output is correct
3 Correct 1 ms 784 KB Output is correct
4 Correct 0 ms 780 KB Output is correct
5 Correct 0 ms 796 KB Output is correct
6 Correct 0 ms 796 KB Output is correct
7 Correct 2 ms 800 KB Output is correct
8 Correct 1 ms 784 KB Output is correct
9 Correct 1 ms 792 KB Output is correct
10 Correct 1 ms 792 KB Output is correct
11 Correct 3 ms 1348 KB Output is correct
12 Correct 0 ms 1292 KB Output is correct
13 Correct 1 ms 800 KB Output is correct
14 Correct 1 ms 800 KB Output is correct
15 Correct 0 ms 792 KB Output is correct
16 Correct 0 ms 792 KB Output is correct
17 Correct 2 ms 800 KB Output is correct
18 Correct 1 ms 792 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 5244 KB Output is correct
2 Correct 37 ms 5404 KB Output is correct
3 Correct 38 ms 5360 KB Output is correct
4 Correct 24 ms 3260 KB Output is correct
5 Correct 29 ms 4416 KB Output is correct
6 Correct 27 ms 4036 KB Output is correct
7 Correct 31 ms 4056 KB Output is correct
8 Correct 30 ms 3912 KB Output is correct
9 Correct 27 ms 4040 KB Output is correct
10 Correct 10 ms 3688 KB Output is correct
11 Correct 17 ms 3816 KB Output is correct
12 Correct 20 ms 3564 KB Output is correct
13 Correct 22 ms 3816 KB Output is correct
14 Correct 21 ms 3576 KB Output is correct
15 Correct 27 ms 3592 KB Output is correct
16 Correct 26 ms 3516 KB Output is correct
17 Correct 27 ms 3596 KB Output is correct
18 Correct 26 ms 3596 KB Output is correct
19 Correct 27 ms 3632 KB Output is correct
20 Correct 9 ms 4536 KB Output is correct
21 Correct 14 ms 4280 KB Output is correct
22 Correct 13 ms 4144 KB Output is correct
23 Correct 27 ms 4420 KB Output is correct
24 Correct 27 ms 4220 KB Output is correct
25 Correct 27 ms 4396 KB Output is correct
26 Correct 27 ms 4412 KB Output is correct
27 Correct 27 ms 4536 KB Output is correct
28 Correct 26 ms 4424 KB Output is correct
29 Correct 23 ms 4068 KB Output is correct
30 Correct 24 ms 4152 KB Output is correct
31 Correct 0 ms 788 KB Output is correct
32 Correct 1 ms 788 KB Output is correct
33 Correct 1 ms 804 KB Output is correct
34 Correct 0 ms 800 KB Output is correct
35 Correct 0 ms 800 KB Output is correct
36 Correct 1 ms 796 KB Output is correct
37 Correct 0 ms 796 KB Output is correct
38 Correct 1 ms 800 KB Output is correct
39 Correct 0 ms 784 KB Output is correct
40 Correct 0 ms 796 KB Output is correct
41 Correct 0 ms 784 KB Output is correct
42 Correct 1 ms 788 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 780 KB Output is correct
2 Correct 1 ms 776 KB Output is correct
3 Correct 0 ms 788 KB Output is correct
4 Correct 2 ms 1592 KB Output is correct
5 Correct 3 ms 1592 KB Output is correct
6 Correct 2 ms 2072 KB Output is correct
7 Correct 3 ms 1584 KB Output is correct
8 Correct 2 ms 1580 KB Output is correct
9 Correct 17 ms 4584 KB Output is correct
10 Correct 19 ms 4768 KB Output is correct
11 Correct 11 ms 4932 KB Output is correct
12 Correct 0 ms 796 KB Output is correct
13 Correct 0 ms 784 KB Output is correct
14 Correct 0 ms 780 KB Output is correct
15 Correct 0 ms 784 KB Output is correct

Subtask #4
0.0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 5388 KB Output is correct
2 Correct 39 ms 5464 KB Output is correct
3 Partially correct 38 ms 5384 KB Partially correct
4 Correct 27 ms 3500 KB Output is correct
5 Correct 34 ms 5120 KB Output is correct
6 Correct 27 ms 4672 KB Output is correct
7 Correct 27 ms 4168 KB Output is correct
8 Correct 27 ms 4024 KB Output is correct
9 Correct 27 ms 3828 KB Output is correct
10 Correct 12 ms 3968 KB Output is correct
11 Correct 17 ms 3684 KB Output is correct
12 Correct 20 ms 3652 KB Output is correct
13 Correct 20 ms 3560 KB Output is correct
14 Correct 24 ms 3624 KB Output is correct
15 Correct 32 ms 3508 KB Output is correct
16 Correct 29 ms 3516 KB Output is correct
17 Correct 27 ms 3912 KB Output is correct
18 Correct 26 ms 3644 KB Output is correct
19 Correct 26 ms 3928 KB Output is correct
20 Incorrect 9 ms 4548 KB Output isn't correct
21 Halted 0 ms 0 KB -

Subtask #5
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 5440 KB Output is correct
2 Correct 38 ms 5364 KB Output is correct
3 Incorrect 38 ms 5380 KB Output isn't correct
4 Halted 0 ms 0 KB -