Submission #1272428

#	Time	Username	Problem	Language	Result	Execution time	Memory
1272428		KALARRY	Factories (JOI14_factories)	C++20	Compilation error	0 ms	0 KiB

factories

//chockolateman
#include<bits/stdc++.h>
// #include "factories.h"

using namespace std;

const long long INF = 1e15;

int s[500005],col[500005][21],anc[500005][21],par_c[500005],my_d[500005],timer;
long long ans[500005];
vector<pair<int,int>> adj[500005];
bool is_removed[500005];
vector<long long> dist[500005];

void dfs1(int v,int p,int d)
{
    s[v] = 1;
    col[v][d] = ++timer;
    for(auto e : adj[v])
    {
        int u = e.first;
        if(!is_removed[u] && u != p)
        {
            dfs1(u,v,d);
            s[v] += s[u];
        }
    }
}

int centroid(int v,int p, int n)
{
    for(auto e : adj[v])
    {
        int u = e.first;
        if(!is_removed[u] && u != p && 2*s[u] > n)
            return centroid(u,v,n);
    }
    return v;
}

void dfs2(int v,int p,int root)
{
    anc[v][my_d[root]] = root;
    for(auto e : adj[v])
    {
        int u = e.first;
        int w = e.second;
        if(!is_removed[u] && u != p)
        {
            dist[root][col[u][my_d[root]]] = dist[root][col[v][my_d[root]]] + w;
            dfs2(u,v,root);
        }
    }
}

void build(int v,int p,int d)
{
    timer = 0;
    dfs1(v,v,d);
    int n = s[v];
    int c = centroid(v,v,n);
    vector<int> temp;
    for(int i = 0 ; i <= timer ; i++)
        dist[c].push_back(0ll);
    dfs2(c,c,c);
    ans[c] = INF;
    if(p == -1)
        p = c;
    par_c[c] = p;
    my_d[c] = d;
    is_removed[c] = true;
    for(auto e : adj[c])
    {
        int u = e.first;
        if(!is_removed[u])
            build(u,c,d+1);
    } 
}

void update(int v)
{
    ans[v] = 0;
    int pos = v;
    while(par_c[pos] != pos)
    {
        pos = par_c[pos];
        ans[pos] = min(ans[pos],dist[pos][col[v][my_d[pos]]]);
    }
}

long long query(int v)
{
    long long ret = ans[v];
    int pos = v;
    while(par_c[pos] != pos)
    {
        pos = par_c[pos];
        ret = min(ret,ans[pos] + dist[pos][col[v][my_d[pos]]]);
    }
    return ret;
}

void undo(int v)
{
    ans[v] = INF;
    int pos = v;
    while(par_c[pos] != pos)
    {
        pos = par_c[pos];
        ans[pos] = INF;
    }
}

void Init(int N, int A[], int B[], int D[]) {
    for(int a,b,w,i = 0 ; i < N-1 ; i++)
    {
        a = A[i]+1;
        b = B[i]+1;
        w = D[i];
        adj[a].push_back({b,w});
        adj[b].push_back({a,w});
    }
    build(1,-1);
}

long long Query(int S, int X[], int T, int Y[]) {
    long long ret = INF;
    for(int i = 0 ; i < T ; i++)
        update(Y[i]+1);
    for(int i = 0 ; i < S ; i++)
        ret = min(ret,query(X[i]+1));
    for(int i = 0 ; i < T ; i++)
        undo(Y[i]+1);
    return ret;
}
#include <stdio.h>
#include <stdlib.h>

#define MAX_N          500000
#define MAX_Q          100000
#define MAX_SUM_ST    1000000
#define MAX_VALUE  1000000000

static int N, Q;
static int A[MAX_N], B[MAX_N], D[MAX_N];
static int S[MAX_N];
static int T[MAX_N];
static int X[MAX_SUM_ST];
static int Y[MAX_SUM_ST];

static int Qx[MAX_N];
static int Qy[MAX_N];

int main() {

  int i, j, k;
  int STop, TTop;

  if (2 != scanf("%d%d", &N, &Q)) {
    fprintf(stderr, "error: cannot read N and Q.\n");
    exit(1);
  }
  if (!(2 <= N && N <= MAX_N)) {
    fprintf(stderr, "error: N is out of bounds.\n");
    exit(1);
  }
  if (!(1 <= Q && Q <= MAX_Q)) {
    fprintf(stderr, "error: Q is out of bounds.\n");
    exit(1);
  }
  for (i = 0; i < N - 1; ++i) {
    if (1 != scanf("%d", &A[i])) {
      fprintf(stderr, "error: cannot read A[%d].\n", i);
      exit(1);
    }
    if (!(0 <= A[i] && A[i] <= N - 1)) {
      fprintf(stderr, "error: A[%d] is out of bounds.\n", i);
      exit(1);
    }
    if (1 != scanf("%d", &B[i])) {
      fprintf(stderr, "error: cannot read B[%d].\n", i);
      exit(1);
    }
    if (!(0 <= B[i] && B[i] <= N - 1)) {
      fprintf(stderr, "error: B[%d] is out of bounds.\n", i);
      exit(1);
    }
    if (A[i] == B[i]) {
      fprintf(stderr, "error: B[%d] is equal to A[%d].\n", i, i);
      exit(1);
    }
    if (1 != scanf("%d", &D[i])) {
      fprintf(stderr, "error: cannot read D[%d].\n", i);
      exit(1);
    }
    if (!(1 <= D[i] && D[i] <= MAX_VALUE)) {
      fprintf(stderr, "error: D[%d] is out of bounds.\n", i);
      exit(1);
    }
  }

  STop = 0;
  TTop = 0;

  for (j = 0; j < Q; ++j) {
    if (2 != scanf("%d%d", &S[j], &T[j])) {
      fprintf(stderr, "error: cannot read L[%d] and R[%d].\n", j, j);
      exit(1);
    }

    if(STop + S[j] > MAX_SUM_ST) {
      fprintf(stderr, "error: S[0] + S[1] + ... + S[%d] is out of bounds.\n", j);
      exit(1);
    }

    if(TTop + T[j] > MAX_SUM_ST) {
      fprintf(stderr, "error: T[0] + T[1] + ... + T[%d] is out of bounds.\n", j);
      exit(1);
    }

    for (k = 0; k < S[j]; ++k, ++STop) {
      if (1 != scanf("%d", &X[STop])) {
        fprintf(stderr, "error: cannot read X[%d][%d].\n", j, k);
        exit(1);
      }

      if (!(0 <= X[STop] && X[STop] <= N - 1)) {
        fprintf(stderr, "error: cannot read X[%d][%d].\n", j, k);
        exit(1);
      }
    }

    for (k = 0; k < T[j]; ++k, ++TTop) {
      if (1 != scanf("%d", &Y[TTop])) {
        fprintf(stderr, "error: cannot read Y[%d][%d].\n", j, k);
        exit(1);
      }

      if (!(0 <= Y[TTop] && Y[TTop] <= N - 1)) {
        fprintf(stderr, "error: cannot read Y[%d][%d].\n", j, k);
        exit(1);
      }
    }
  }

  STop = 0;
  TTop = 0;
  Init(N, A, B, D);

  for (j = 0; j < Q; ++j) {
    for (k = 0; k < S[j]; k++) {
        Qx[k] = X[STop++];
    }
    for (k = 0; k < T[j]; k++) {
        Qy[k] = Y[TTop++];
    }

    printf("%lld\n", Query(S[j], Qx, T[j], Qy));
  }


  return 0;
}

Compilation message (stderr)

factories.cpp: In function 'void Init(int, int*, int*, int*)':
factories.cpp:123:10: error: too few arguments to function 'void build(int, int, int)'
  123 |     build(1,-1);
      |     ~~~~~^~~~~~
factories.cpp:56:6: note: declared here
   56 | void build(int v,int p,int d)
      |      ^~~~~