Submission #137033

#	Time	Username	Problem	Language	Result	Execution time	Memory
137033		osaaateiasavtnl	Amusement Park (JOI17_amusement_park)	C++14	Compilation error	0 ms	0 KiB

Joi

#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);
}   

Ioi

#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];
int vert[60];
int ans[N];
int h[N];
void dfs1(int u, int p) {
    if (vis == 60) return;
    ++vis;              
    int b = tin[u] % 60;
    want[u] = vert[b] == -1;
    h[u] = 0;
    for (int v : tree[u]) {
        dfs1(v, u);
        want[u] |= want[v];
        h[u] = max(h[u], h[v] + 1);
    }   
}   
void dfs2(int u, int p, bool r) {
    if (tree[u].empty()) return;
    int mx = -1;
    for (int v : tree[u]) {
        if (want[v]) {
            if (mx == -1 || h[mx] < h[v]) mx = v;
        }
    }   
    if (r && mx != -1) {
        for (int v : tree[u]) {
            if (want[v] && v != mx) {
                vert[tin[v] % 60] = v;
                ans[v] = move(v);
                dfs2(v, u, 0);
                move(u);
            }
        }
        vert[tin[mx] % 60] = mx;
        ans[mx] = move(mx);
        dfs2(mx, u, 1);
    }
    else {
        for (int v : tree[u]) {
            if (want[v]) {
                vert[tin[v] % 60] = v;
                ans[v] = move(v);
                dfs2(v, u, 0);
                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], 1);
    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;
}   

Compilation message (stderr)

Ioi.cpp: In function 'long long int Ioi(int, int, int*, int*, int, int, int)':
Ioi.cpp:83:22: error: too many arguments to function 'void dfs1(int, int)'
     dfs1(u, par[u], 1);
                      ^
Ioi.cpp:25:6: note: declared here
 void dfs1(int u, int p) {
      ^~~~
Ioi.cpp:84:32: error: too few arguments to function 'void dfs2(int, int, bool)'
     if (want[u]) dfs2(u, par[u]);
                                ^
Ioi.cpp:37:6: note: declared here
 void dfs2(int u, int p, bool r) {
      ^~~~