oj.uz

답안 #137019

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
137019 2019-07-26T22:39:16 Z osaaateiasavtnl Amusement Park (JOI17_amusement_park) C++14
10 / 100
 34 ms 5568 KB 
#include<bits/stdc++.h>
#include"Joi.h"
using namespace std;
#define color MessageBoard
#define app push_back
const int N = 20001;
vector <int> g[N];
int tin[N], ptr = 0;
bool used[N];
void dfs(int u, long long x) {
    used[u] = 1;
    tin[u] = ptr++;
    int b = tin[u] % 60;
    color(u, (x >> b) & 1);
    for (int v : g[u]) {
        if (!used[v]) {
            dfs(v, x);
        }   
    }   
}   
void Joi(int n, int m, int a[], int b[], long long x, int t) {
    for (int i = 0; i < m; ++i) {
        g[a[i]].app(b[i]);
        g[b[i]].app(a[i]);    
    }   
    dfs(0, x);
}   
#include<bits/stdc++.h>
#include"Ioi.h"
#define move Move
#define app push_back
using namespace std;
const int N = 20001;
vector <int> g[N];
int tin[N], cnt[N], par[N], ptr = 0;
bool used[N];
vector <int> tree[N];
void dfs(int u) {
    used[u] = 1; cnt[u] = 1; tin[u] = ptr++;
    for (int v : g[u]) {
        if (!used[v]) {
            dfs(v);
            par[v] = u; tree[u].app(v); cnt[u] += cnt[v];
        }   
    }   
}   
int vis = 0;
bool want[N], mem[N];
int vert[60];
int ans[N];
void dfs1(int u, int p) {
    if (vis == 60) return;
    ++vis;              
    int b = tin[u] % 60;
    want[u] = vert[b] == -1;
    bool want0 = want[u];
    for (int v : tree[u]) {
        dfs1(v, u);
        want[u] |= want[v];
    }   
    mem[u] = !want0 && want[u];
}   
bool comp(int u, int v) {
    return mem[u] < mem[v];
}   
void dfs2(int u, int p) {
    if (tree[u].empty()) return;
    //sort(tree[u].begin(), tree[u].end(), comp);
    for (int v : tree[u]) {
        if (want[v]) {
            vert[tin[v] % 60] = v;
            ans[v] = move(v);
            dfs2(v, u);
            /*
            if (!mem[u]) {
                move(u);
            }
            */
        }
    }   
}   
long long Ioi(int n, int m, int a[], int b[], int u, int v, int t) {
    for (int i = 0; i < 60; ++i) vert[i] = -1;
    for (int i = 0; i < m; ++i) {
        g[a[i]].app(b[i]);
        g[b[i]].app(a[i]);
    }   
    dfs(0);
    ans[u] = v;
    vert[tin[u] % 60] = u;
    while (cnt[u] < 60) {
        u = par[u];
        ans[u] = move(u);
        vert[tin[u] % 60] = u;
    }   
    dfs1(u, par[u]);
    if (want[u]) dfs2(u, par[u]);
    long long x = 0;
    for (int i = 0; i < 60; ++i) {
        x += (1ll << i) * ans[vert[i]];
    }   
    return x;
}

Subtask #1
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 5 ms 2160 KB Wrong Answer [7]
2 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 33 ms 5520 KB Wrong Answer [7]
2 Halted 0 ms 0 KB -

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 2160 KB Output is correct
2 Correct 5 ms 2424 KB Output is correct
3 Correct 6 ms 2296 KB Output is correct
4 Correct 7 ms 2840 KB Output is correct
5 Correct 7 ms 2688 KB Output is correct
6 Correct 7 ms 2840 KB Output is correct
7 Correct 7 ms 2840 KB Output is correct
8 Correct 7 ms 2716 KB Output is correct
9 Correct 18 ms 5312 KB Output is correct
10 Correct 17 ms 5176 KB Output is correct
11 Correct 18 ms 5128 KB Output is correct
12 Correct 5 ms 2556 KB Output is correct
13 Correct 5 ms 2424 KB Output is correct
14 Correct 5 ms 2208 KB Output is correct
15 Correct 6 ms 2292 KB Output is correct

Subtask #4
0 / 55.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 34 ms 5568 KB Wrong Answer [7]
2 Halted 0 ms 0 KB -

Subtask #5
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 33 ms 5440 KB Wrong Answer [7]
2 Halted 0 ms 0 KB -