oj.uz

답안 #93344

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
93344 2019-01-07T16:19:33 Z Alexa2001 Amusement Park (JOI17_amusement_park) C++17
73 / 100
 31 ms 5756 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(it && t[it] == i) good.push_back(it);

     //   sort(good.begin(), good.end());
       // good.erase(unique(good.begin(), good.end()), good.end());
        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]);


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


  //  return baga(node);

    if(node == P) return baga(P);
    assert(sbrb != -1);

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

    if(w[sbrb] <= 60 && w[sbrb] + T >= 60) return baga(sbrb);

    assert(T == 0);

    for(i=S.size()-1; i>=0; --i)
        if(S[i] + w[sbrb] >= 60) return 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

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 2164 KB Output is correct
2 Correct 5 ms 2168 KB Output is correct
3 Correct 5 ms 2292 KB Output is correct
4 Correct 4 ms 2168 KB Output is correct
5 Correct 4 ms 2160 KB Output is correct
6 Correct 4 ms 2160 KB Output is correct
7 Correct 4 ms 2300 KB Output is correct
8 Correct 4 ms 2300 KB Output is correct
9 Correct 4 ms 2164 KB Output is correct
10 Correct 4 ms 2168 KB Output is correct
11 Correct 7 ms 2612 KB Output is correct
12 Correct 4 ms 2160 KB Output is correct
13 Correct 4 ms 2164 KB Output is correct
14 Correct 4 ms 2300 KB Output is correct
15 Correct 4 ms 2300 KB Output is correct
16 Correct 5 ms 2424 KB Output is correct
17 Correct 6 ms 2292 KB Output is correct
18 Correct 4 ms 2300 KB Output is correct

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 31 ms 5612 KB Output is correct
2 Correct 30 ms 5620 KB Output is correct
3 Correct 30 ms 5620 KB Output is correct
4 Correct 19 ms 4104 KB Output is correct
5 Correct 20 ms 4616 KB Output is correct
6 Correct 19 ms 4480 KB Output is correct
7 Correct 19 ms 4388 KB Output is correct
8 Correct 19 ms 4616 KB Output is correct
9 Correct 19 ms 4480 KB Output is correct
10 Correct 17 ms 4400 KB Output is correct
11 Correct 17 ms 4364 KB Output is correct
12 Correct 17 ms 4180 KB Output is correct
13 Correct 18 ms 3952 KB Output is correct
14 Correct 17 ms 4044 KB Output is correct
15 Correct 19 ms 4104 KB Output is correct
16 Correct 26 ms 4096 KB Output is correct
17 Correct 18 ms 4224 KB Output is correct
18 Correct 17 ms 4096 KB Output is correct
19 Correct 17 ms 4096 KB Output is correct
20 Correct 15 ms 4480 KB Output is correct
21 Correct 15 ms 4668 KB Output is correct
22 Correct 19 ms 4360 KB Output is correct
23 Correct 17 ms 4616 KB Output is correct
24 Correct 18 ms 4404 KB Output is correct
25 Correct 18 ms 4408 KB Output is correct
26 Correct 19 ms 4352 KB Output is correct
27 Correct 18 ms 4488 KB Output is correct
28 Correct 18 ms 4500 KB Output is correct
29 Correct 19 ms 4200 KB Output is correct
30 Correct 17 ms 4408 KB Output is correct
31 Correct 4 ms 2168 KB Output is correct
32 Correct 4 ms 2200 KB Output is correct
33 Correct 4 ms 2420 KB Output is correct
34 Correct 4 ms 2168 KB Output is correct
35 Correct 5 ms 2168 KB Output is correct
36 Correct 4 ms 2172 KB Output is correct
37 Correct 4 ms 2168 KB Output is correct
38 Correct 4 ms 2160 KB Output is correct
39 Runtime error 6 ms 3056 KB Execution killed with signal 11 (could be triggered by violating memory limits)
40 Halted 0 ms 0 KB -

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 2160 KB Output is correct
2 Correct 5 ms 2204 KB Output is correct
3 Correct 5 ms 2296 KB Output is correct
4 Correct 6 ms 2700 KB Output is correct
5 Correct 6 ms 2656 KB Output is correct
6 Correct 6 ms 2580 KB Output is correct
7 Correct 6 ms 2784 KB Output is correct
8 Correct 6 ms 2712 KB Output is correct
9 Correct 15 ms 5128 KB Output is correct
10 Correct 15 ms 5000 KB Output is correct
11 Correct 15 ms 5000 KB Output is correct
12 Correct 4 ms 2160 KB Output is correct
13 Correct 4 ms 2160 KB Output is correct
14 Correct 4 ms 2168 KB Output is correct
15 Correct 4 ms 2160 KB Output is correct

Subtask #4
55.0 / 55.0

# 결과 실행 시간 메모리 Grader output
1 Correct 27 ms 5612 KB Output is correct
2 Correct 30 ms 5568 KB Output is correct
3 Correct 28 ms 5636 KB Output is correct
4 Correct 17 ms 4100 KB Output is correct
5 Correct 19 ms 4744 KB Output is correct
6 Correct 18 ms 4624 KB Output is correct
7 Correct 19 ms 4596 KB Output is correct
8 Correct 18 ms 4224 KB Output is correct
9 Correct 18 ms 4360 KB Output is correct
10 Correct 18 ms 4392 KB Output is correct
11 Correct 17 ms 4516 KB Output is correct
12 Correct 17 ms 3876 KB Output is correct
13 Correct 17 ms 4196 KB Output is correct
14 Correct 17 ms 4172 KB Output is correct
15 Correct 19 ms 4392 KB Output is correct
16 Correct 19 ms 4388 KB Output is correct
17 Correct 19 ms 4136 KB Output is correct
18 Correct 18 ms 4136 KB Output is correct
19 Correct 19 ms 4128 KB Output is correct
20 Correct 15 ms 4652 KB Output is correct
21 Correct 15 ms 4668 KB Output is correct
22 Correct 19 ms 4520 KB Output is correct
23 Correct 19 ms 4416 KB Output is correct
24 Correct 19 ms 4384 KB Output is correct
25 Correct 18 ms 4764 KB Output is correct
26 Correct 19 ms 4388 KB Output is correct
27 Correct 19 ms 4732 KB Output is correct
28 Correct 19 ms 4444 KB Output is correct
29 Correct 17 ms 4604 KB Output is correct
30 Correct 19 ms 4372 KB Output is correct

Subtask #5
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 31 ms 5612 KB Output is correct
2 Correct 30 ms 5756 KB Output is correct
3 Correct 30 ms 5632 KB Output is correct
4 Correct 19 ms 4128 KB Output is correct
5 Correct 20 ms 4872 KB Output is correct
6 Correct 19 ms 4488 KB Output is correct
7 Correct 19 ms 4464 KB Output is correct
8 Correct 19 ms 4460 KB Output is correct
9 Correct 19 ms 4404 KB Output is correct
10 Correct 18 ms 4424 KB Output is correct
11 Correct 18 ms 4364 KB Output is correct
12 Correct 17 ms 3952 KB Output is correct
13 Correct 17 ms 4088 KB Output is correct
14 Correct 17 ms 4152 KB Output is correct
15 Correct 19 ms 4176 KB Output is correct
16 Correct 17 ms 4108 KB Output is correct
17 Correct 18 ms 4128 KB Output is correct
18 Correct 20 ms 4136 KB Output is correct
19 Correct 20 ms 4264 KB Output is correct
20 Correct 15 ms 4512 KB Output is correct
21 Correct 15 ms 4568 KB Output is correct
22 Correct 19 ms 4648 KB Output is correct
23 Correct 19 ms 4392 KB Output is correct
24 Correct 19 ms 4644 KB Output is correct
25 Correct 19 ms 4512 KB Output is correct
26 Correct 19 ms 4384 KB Output is correct
27 Correct 19 ms 4788 KB Output is correct
28 Correct 19 ms 4520 KB Output is correct
29 Correct 17 ms 4380 KB Output is correct
30 Correct 17 ms 4632 KB Output is correct
31 Correct 5 ms 2172 KB Output is correct
32 Correct 5 ms 2172 KB Output is correct
33 Correct 5 ms 2296 KB Output is correct
34 Incorrect 4 ms 2176 KB Output isn't correct
35 Halted 0 ms 0 KB -