oj.uz

Submission #93285

# Submission time Handle Problem Language Result Execution time Memory
93285 2019-01-07T12:09:05 Z Alexa2001 Amusement Park (JOI17_amusement_park) C++17
28 / 100
 30 ms 5804 KB 
#include "Joi.h"
#include <bits/stdc++.h>

typedef long long ll;
const int Nmax = 30005;
using namespace std;

static bool used[Nmax];
static vector<int> v[Nmax];
static int bit, w[Nmax], t[Nmax];
static ll TO;

static void dfs_sel_edges(int node)
{
    used[node] = 1;
    w[node] = 1;

    for(auto it : v[node])
        if(!used[it])
        {
            t[it] = node;
            dfs_sel_edges(it);
            w[node] += w[it];
        }
}

static void dfs(int node)
{
    MessageBoard(node, (TO >> bit) & 1);
    for(auto it : v[node])
        {
            bit = (bit+1) % 60;
            dfs(it);
        }
}

static bool cmp(int a, int b)
{
    return w[a] < w[b];
}

void Joi(int N, int M, int A[], int B[], ll X, int _T)
{
    int i; TO = X;
    for(i=0; i<M; ++i)
    {
        v[A[i]].push_back(B[i]);
        v[B[i]].push_back(A[i]);
    }

    t[0] = -1;
    dfs_sel_edges(0);

    vector<int> good;
    for(i=0; i<N; ++i)
    {
        good.clear();
        for(auto it : v[i])
            if(t[it] == i) good.push_back(it);
        v[i] = good;
    }

    for(i=0; i<N; ++i)
        sort(v[i].begin(), v[i].end(), cmp);

    bit = 0;
    dfs(0);
}

#include "Ioi.h"
#include <bits/stdc++.h>

typedef long long ll;
const int Nmax = 30005;
const ll AllBits = (1LL << 60) - 1;
using namespace std;

static bool used[Nmax], to_visit[Nmax];
static vector<int> v[Nmax];
static int bit, w[Nmax], t[Nmax], In[Nmax], ord[Nmax], tip[Nmax], tmp, Special;

ll Act, Mask;

static void dfs_sel_edges(int node)
{
    used[node] = 1;
    w[node] = 1;

    for(auto it : v[node])
        if(!used[it])
        {
            t[it] = node;
            dfs_sel_edges(it);
            w[node] += w[it];
        }
}

static void dfs(int node)
{
    tip[node] = bit;
    In[node] = ++tmp;
    ord[tmp] = node;

    for(auto it : v[node])
        {
            bit = (bit+1) % 60;
            dfs(it);
            ord[++tmp] = node;
        }
}

bool cmp(int a, int b)
{
    return w[a] < w[b];
}

static void go(int node)
{
    to_visit[node] = 0;
    for(auto it : v[node])
        if(to_visit[it])
        {
            Act |= (1LL<<tip[it]) * Move(it);
            go(it);
            Move(node);
        }

    if(node != 0 && to_visit[t[node]])
    {
        Act |= (1LL<<tip[t[node]]) * Move(t[node]);
        go(t[node]);
    }
}

static ll baga(int node)
{
    int i;
    for(i=In[node]; (!to_visit[Special] || Mask != AllBits) && i <= tmp; ++i)
        to_visit[ord[i]] = 1, Mask |= (1LL << tip[ord[i]]);

    assert(to_visit[Special] && Mask == AllBits);

    go(Special);
    return Act;
}

ll Ioi(int N, int M, int A[], int B[], int P, int V, int _T)
{
    Special = P;

    int i;
    for(i=0; i<M; ++i)
    {
        v[A[i]].push_back(B[i]);
        v[B[i]].push_back(A[i]);
    }

    dfs_sel_edges(0);

    vector<int> good;
    for(i=0; i<N; ++i)
    {
        good.clear();
        for(auto it : v[i])
            if(t[it] == i) good.push_back(it);
        v[i] = good;
    }

    for(i=0; i<N; ++i)
        sort(v[i].begin(), v[i].end(), cmp);

    bit = 0;
    dfs(0);

    Mask = (1LL << tip[P]);
    Act = V * (1LL << tip[P]);

 //   return baga(0);

    int node = P, sbrb;
    while(w[node] < 60) sbrb = node, node = t[node];


  //  if(node == P)
   //     return baga(P);

    return baga(node);


    vector<int> S;
    bool ok = 0; int T = 0;

    for(i=0; i<v[node].size(); ++i)
        if(v[node][i] == sbrb) ok = 1;
            else if(!ok) S.push_back(w[v[node][i]]);
                else T += w[v[node][i]];

    for(i=(int)S.size()-2; i>=0; --i) S[i] += S[i+1];

    for(i=0; i<S.size(); ++i)
        if(S[i] + w[sbrb] <= 60 && S[i] + w[sbrb] + T >= 60)
            return baga(v[node][i]);

    assert(T == 0);

    for(i=S.size()-1; i>=0; --i)
        if(S[i] + w[sbrb] >= 60) baga(v[node][i]);

    return baga(node);
}

Compilation message

Ioi.cpp: In function 'll Ioi(int, int, int*, int*, int, int, int)':
Ioi.cpp:124:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(i=0; i<v[node].size(); ++i)
              ~^~~~~~~~~~~~~~~
Ioi.cpp:131:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(i=0; i<S.size(); ++i)
              ~^~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2164 KB Output is correct
2 Correct 4 ms 2164 KB Output is correct
3 Correct 5 ms 2320 KB Output is correct
4 Correct 5 ms 2204 KB Output is correct
5 Correct 4 ms 2160 KB Output is correct
6 Correct 4 ms 2160 KB Output is correct
7 Correct 5 ms 2292 KB Output is correct
8 Correct 4 ms 2420 KB Output is correct
9 Correct 4 ms 2192 KB Output is correct
10 Correct 5 ms 2196 KB Output is correct
11 Correct 8 ms 2620 KB Output is correct
12 Correct 4 ms 2172 KB Output is correct
13 Correct 5 ms 2420 KB Output is correct
14 Correct 4 ms 2324 KB Output is correct
15 Correct 5 ms 2304 KB Output is correct
16 Correct 5 ms 2432 KB Output is correct
17 Correct 5 ms 2164 KB Output is correct
18 Correct 4 ms 2164 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 5748 KB Output is correct
2 Correct 28 ms 5628 KB Output is correct
3 Correct 30 ms 5628 KB Output is correct
4 Correct 19 ms 4104 KB Output is correct
5 Correct 19 ms 4616 KB Output is correct
6 Correct 19 ms 4488 KB Output is correct
7 Correct 19 ms 4416 KB Output is correct
8 Correct 19 ms 4496 KB Output is correct
9 Correct 18 ms 4500 KB Output is correct
10 Correct 18 ms 4548 KB Output is correct
11 Correct 19 ms 4400 KB Output is correct
12 Correct 17 ms 4060 KB Output is correct
13 Correct 17 ms 3952 KB Output is correct
14 Correct 17 ms 4180 KB Output is correct
15 Correct 20 ms 4156 KB Output is correct
16 Correct 19 ms 4144 KB Output is correct
17 Correct 19 ms 4112 KB Output is correct
18 Correct 19 ms 4140 KB Output is correct
19 Correct 19 ms 4104 KB Output is correct
20 Correct 15 ms 4568 KB Output is correct
21 Correct 15 ms 4564 KB Output is correct
22 Correct 19 ms 4232 KB Output is correct
23 Correct 19 ms 4624 KB Output is correct
24 Correct 18 ms 4500 KB Output is correct
25 Correct 19 ms 4504 KB Output is correct
26 Correct 18 ms 4608 KB Output is correct
27 Correct 19 ms 4588 KB Output is correct
28 Correct 19 ms 4496 KB Output is correct
29 Correct 18 ms 4192 KB Output is correct
30 Correct 19 ms 4360 KB Output is correct
31 Correct 4 ms 2296 KB Output is correct
32 Correct 4 ms 2296 KB Output is correct
33 Correct 4 ms 2292 KB Output is correct
34 Correct 4 ms 2160 KB Output is correct
35 Correct 4 ms 2160 KB Output is correct
36 Correct 4 ms 2176 KB Output is correct
37 Correct 4 ms 2180 KB Output is correct
38 Correct 4 ms 2288 KB Output is correct
39 Correct 5 ms 2180 KB Output is correct
40 Correct 4 ms 2160 KB Output is correct
41 Correct 4 ms 2296 KB Output is correct
42 Correct 4 ms 2160 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2160 KB Output is correct
2 Correct 4 ms 2172 KB Output is correct
3 Correct 4 ms 2332 KB Output is correct
4 Correct 6 ms 2700 KB Output is correct
5 Correct 6 ms 2572 KB Output is correct
6 Correct 6 ms 2708 KB Output is correct
7 Correct 6 ms 2580 KB Output is correct
8 Correct 6 ms 2808 KB Output is correct
9 Correct 15 ms 5004 KB Output is correct
10 Correct 15 ms 5408 KB Output is correct
11 Correct 15 ms 5028 KB Output is correct
12 Correct 5 ms 2164 KB Output is correct
13 Correct 4 ms 2164 KB Output is correct
14 Correct 5 ms 2164 KB Output is correct
15 Correct 4 ms 2328 KB Output is correct

Subtask #4
0.0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 5672 KB Output is correct
2 Correct 30 ms 5692 KB Output is correct
3 Correct 30 ms 5804 KB Output is correct
4 Correct 19 ms 4168 KB Output is correct
5 Correct 19 ms 4860 KB Output is correct
6 Correct 19 ms 4608 KB Output is correct
7 Correct 19 ms 4512 KB Output is correct
8 Correct 19 ms 4256 KB Output is correct
9 Correct 19 ms 4384 KB Output is correct
10 Correct 17 ms 4388 KB Output is correct
11 Incorrect 18 ms 4516 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #5
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 5620 KB Output is correct
2 Correct 30 ms 5640 KB Output is correct
3 Correct 30 ms 5644 KB Output is correct
4 Correct 19 ms 4128 KB Output is correct
5 Correct 19 ms 5024 KB Output is correct
6 Correct 19 ms 4432 KB Output is correct
7 Correct 18 ms 4392 KB Output is correct
8 Correct 19 ms 4516 KB Output is correct
9 Correct 19 ms 4512 KB Output is correct
10 Correct 17 ms 4612 KB Output is correct
11 Incorrect 19 ms 4440 KB Output isn't correct
12 Halted 0 ms 0 KB -