oj.uz

답안 #128119

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
128119 2019-07-10T12:39:13 Z arnold518 Amusement Park (JOI17_amusement_park) C++14
18 / 100
 3000 ms 57448 KB 
#include "Joi.h"
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const int MAXN = 1e4;

static int N, M;
static ll X;

static vector<int> adj[MAXN+10], tree[MAXN+10];
static unordered_set<int> group[MAXN+10];
static int dis[MAXN+10], invdis[MAXN+10], par[MAXN+10], col[MAXN+10];

static int cnt=0;
static void makeTree(int now)
{
    int i, j;
    dis[now]=cnt++;
    invdis[dis[now]]=now;
    if(dis[now]<60)
    {
        group[now].insert(now);
        col[now]=dis[now];
    }

    for(int nxt : adj[now])
    {
        if(dis[nxt]!=-1) continue;
        makeTree(nxt);
        tree[now].push_back(nxt);
        tree[nxt].push_back(now);
        par[nxt]=now;
    }
}

static int leaf;
static void dfs(int now, int bef, int grp)
{
    if(cnt==60) { leaf=now; return; }
    cnt++;
    for(int nxt : tree[now])
    {
        if(cnt==61) return;
        if(nxt==bef) continue;
        if(!group[grp].count(nxt)) continue;
        dfs(nxt, now, grp);
    }
}

static void color()
{
    int i, j;
    unordered_set<int> start;
    for(i=0; i<N; i++) if(dis[i]<60) start.insert(*group[i].begin());
    for(i=0; i<N; i++) if(dis[i]<60) group[i]=start;

    for(i=60; i<N; i++)
    {
        int now=invdis[i];
        cnt=1; leaf=0;
        dfs(par[now], now, par[now]);
        for(int it : group[par[now]]) if(it!=leaf) group[now].insert(it);
        col[now]=col[leaf];
        group[now].insert(now);
    }
}

void Joi(int n, int m, int A[], int B[], ll x, int T)
{
    int i, j;
    N=n; M=m; X=x;

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

    memset(dis, -1, sizeof(dis));
    memset(col, -1, sizeof(col));
    makeTree(1);
    color();

    for(i=0; i<N; i++)
    {
        if(x&(1ll<<col[i])) MessageBoard(i, 1);
        else MessageBoard(i, 0);
    }
}

#include "Ioi.h"
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const int MAXN = 1e4;

static int N, M, P, V;

static vector<int> adj[MAXN+10], tree[MAXN+10];
static unordered_set<int> group[MAXN+10];
static int dis[MAXN+10], invdis[MAXN+10], par[MAXN+10], col[MAXN+10];
static ll ans;

static int cnt=0;
static void makeTree(int now)
{
    int i, j;
    dis[now]=cnt++;
    invdis[dis[now]]=now;
    if(dis[now]<60)
    {
        group[now].insert(now);
        col[now]=dis[now];
    }

    for(int nxt : adj[now])
    {
        if(dis[nxt]!=-1) continue;
        makeTree(nxt);
        tree[now].push_back(nxt);
        tree[nxt].push_back(now);
        par[nxt]=now;
    }
}

static int leaf;
static void dfs(int now, int bef, int grp)
{
    if(cnt==60) { leaf=now; return; }
    cnt++;
    for(int nxt : tree[now])
    {
        if(cnt==61) return;
        if(nxt==bef) continue;
        if(!group[grp].count(nxt)) continue;
        dfs(nxt, now, grp);
    }
}

static void color()
{
    int i, j;
    unordered_set<int> start;
    for(i=0; i<N; i++) if(dis[i]<60) start.insert(*group[i].begin());
    for(i=0; i<N; i++) if(dis[i]<60) group[i]=start;

    for(i=60; i<N; i++)
    {
        int now=invdis[i];
        cnt=1; leaf=0;
        dfs(par[now], now, par[now]);
        for(int it : group[par[now]]) if(it!=leaf) group[now].insert(it);
        col[now]=col[leaf];
        group[now].insert(now);
    }
}

static void tour(int now, int bef)
{
    for(int nxt : tree[now])
    {
        if(nxt==bef) continue;
        if(!group[P].count(nxt)) continue;
        ans|=(ll)Move(nxt)<<col[nxt];
        tour(nxt, now);
        ans|=(ll)Move(now)<<col[now];
    }
}

ll Ioi(int n, int m, int A[], int B[], int p, int v, int T)
{
    int i, j;
    N=n; M=m; P=p; V=v;

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

    memset(dis, -1, sizeof(dis));
    memset(col, -1, sizeof(col));
    makeTree(1);
    color();

    ans|=(ll)V<<col[P];
    tour(P, P);
    return ans;
}

Compilation message

Joi.cpp: In function 'void makeTree(int)':
Joi.cpp:21:9: warning: unused variable 'i' [-Wunused-variable]
     int i, j;
         ^
Joi.cpp:21:12: warning: unused variable 'j' [-Wunused-variable]
     int i, j;
            ^
Joi.cpp: In function 'void color()':
Joi.cpp:56:12: warning: unused variable 'j' [-Wunused-variable]
     int i, j;
            ^
Joi.cpp: In function 'void Joi(int, int, int*, int*, ll, int)':
Joi.cpp:74:12: warning: unused variable 'j' [-Wunused-variable]
     int i, j;
            ^

Ioi.cpp: In function 'void makeTree(int)':
Ioi.cpp:21:9: warning: unused variable 'i' [-Wunused-variable]
     int i, j;
         ^
Ioi.cpp:21:12: warning: unused variable 'j' [-Wunused-variable]
     int i, j;
            ^
Ioi.cpp: In function 'void color()':
Ioi.cpp:56:12: warning: unused variable 'j' [-Wunused-variable]
     int i, j;
            ^
Ioi.cpp: In function 'll Ioi(int, int, int*, int*, int, int, int)':
Ioi.cpp:86:12: warning: unused variable 'j' [-Wunused-variable]
     int i, j;
            ^

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 3312 KB Output is correct
2 Correct 10 ms 3824 KB Output is correct
3 Correct 14 ms 4600 KB Output is correct
4 Correct 8 ms 3440 KB Output is correct
5 Correct 7 ms 3444 KB Output is correct
6 Correct 10 ms 3912 KB Output is correct
7 Correct 14 ms 4472 KB Output is correct
8 Correct 17 ms 4536 KB Output is correct
9 Correct 15 ms 4472 KB Output is correct
10 Correct 11 ms 3832 KB Output is correct
11 Correct 13 ms 4004 KB Output is correct
12 Correct 6 ms 3448 KB Output is correct
13 Correct 13 ms 4472 KB Output is correct
14 Correct 14 ms 4712 KB Output is correct
15 Correct 12 ms 4472 KB Output is correct
16 Correct 13 ms 4740 KB Output is correct
17 Correct 14 ms 4472 KB Output is correct
18 Correct 13 ms 4612 KB Output is correct

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 352 ms 57272 KB Output is correct
2 Correct 330 ms 57348 KB Output is correct
3 Correct 330 ms 57440 KB Output is correct
4 Correct 344 ms 56048 KB Output is correct
5 Correct 316 ms 56744 KB Output is correct
6 Correct 336 ms 56272 KB Output is correct
7 Correct 339 ms 56328 KB Output is correct
8 Correct 338 ms 56560 KB Output is correct
9 Correct 332 ms 56376 KB Output is correct
10 Execution timed out 3101 ms 26660 KB Time limit exceeded
11 Halted 0 ms 0 KB -

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 3440 KB Output is correct
2 Correct 8 ms 3500 KB Output is correct
3 Correct 9 ms 3576 KB Output is correct
4 Correct 49 ms 11672 KB Output is correct
5 Correct 48 ms 11536 KB Output is correct
6 Correct 43 ms 11544 KB Output is correct
7 Correct 44 ms 11664 KB Output is correct
8 Correct 49 ms 11672 KB Output is correct
9 Correct 241 ms 56476 KB Output is correct
10 Correct 242 ms 56536 KB Output is correct
11 Correct 252 ms 56352 KB Output is correct
12 Correct 6 ms 3312 KB Output is correct
13 Correct 7 ms 3448 KB Output is correct
14 Correct 6 ms 3184 KB Output is correct
15 Correct 6 ms 3312 KB Output is correct

Subtask #4
0 / 55.0

# 결과 실행 시간 메모리 Grader output
1 Correct 333 ms 57272 KB Output is correct
2 Correct 332 ms 57148 KB Output is correct
3 Correct 358 ms 57304 KB Output is correct
4 Correct 317 ms 55904 KB Output is correct
5 Correct 327 ms 56580 KB Output is correct
6 Correct 355 ms 56360 KB Output is correct
7 Correct 337 ms 56248 KB Output is correct
8 Correct 341 ms 56528 KB Output is correct
9 Correct 341 ms 56460 KB Output is correct
10 Execution timed out 3091 ms 27776 KB Time limit exceeded
11 Halted 0 ms 0 KB -

Subtask #5
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 355 ms 57448 KB Output is correct
2 Correct 333 ms 57280 KB Output is correct
3 Correct 343 ms 57412 KB Output is correct
4 Correct 318 ms 56096 KB Output is correct
5 Correct 321 ms 57128 KB Output is correct
6 Correct 350 ms 56276 KB Output is correct
7 Correct 338 ms 56512 KB Output is correct
8 Correct 335 ms 56352 KB Output is correct
9 Correct 340 ms 56448 KB Output is correct
10 Execution timed out 3078 ms 28024 KB Time limit exceeded
11 Halted 0 ms 0 KB -