제출 #413402

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
413402		souvenir_vayne	공장들 (JOI14_factories)	C++14	컴파일 에러	0 ms	0 KiB

factories

#include <bits/stdc++.h>
#include "factories.h"
#define pb push_back
#define LINF 0x3f3f3f3f3f3f3f3f
#define endl '\n'
#define ll long long
#define f first
#define s second
using namespace std;

const int MAXN = 5e5+5;
int anc[MAXN][22], al[MAXN], h[MAXN], pai[MAXN], sz[MAXN], used[MAXN], best[MAXN];
vector<pii> g[MAXN];

int getsz(int u, int p) {
    sz[u] = 1;
    for(pii &i : g[u])
        if(i.f != p && !used[i.f])
            sz[u] += getsz(i.f, u);
    return sz[u];
}

int findc(int u, int p, int n) {
    for(pii &i : g[u])
        if(i.f != p && !used[i.f] && sz[i.f] > n/2)
            return findc(i.f, u, n);
    return u;
}

void build(int u, int p) {
    int c = findc(u, -1, getsz(u, -1));
    used[c] = 1;
    pai[c] = p;

    for(pii &i : g[c])
        if(!used[i.f])
            build(i.f, c);
}

void dfs(int u) {

    for(pii &i : g[u])
        if(i.f != anc[u][0]) {
            anc[i.f][0] = u;
            al[i.f] = al[u] + 1;
            h[i.f] = h[u] + i.s;
            dfs(i.f);
        }
}

int getlca(int a, int b) {
    if(al[a] < al[b])
        swap(a, b);
    for(int i = 0; i <= 20; i++)
        if( (1<<i) & (al[b] - al[a]) )
            a = anc[a][i];

    if(a == b)
        return a;

    for(int i = 20; i >= 0; i--)
        if(anc[a][i] != anc[b][i])
            a = anc[a][i], b = anc[b][i];

    return anc[a][0];

}

int dist(int a, int b) {
    return h[a] + h[b] - 2*h[getlca(a, b)];
}

void update(int u) {
    int aux = u;
    while(u != -1) {
        best[u] = min(best[u], dist(aux, u));
        //debug2(u, best[u]);
        u = pai[u];
    }
}

int query(int u) {
    int aux = u, ans = LINF;
    while(u != -1) {
        ans = min(ans, best[u] + dist(aux, u));
        u = pai[u];
    }
    return ans;
}

void reset(int u) {
    while(u != -1) {
        best[u] = LINF;
        u = pai[u];
    }
}

void Init(int n, int a[], int b[], int c[]) {
    for(int i = 0; i < n; i++)
        best[i] = LINF;

    for(int i = 0; i < n-1; i++) {
        g[a[i]].pb({b[i], c[i]});
        g[b[i]].pb({a[i], c[i]});
    }

    dfs(0);
    for(int j = 1; j < 22; j++)
        for(int i = 1; i <= n; i++)
            anc[i][j] = anc[anc[i][j-1]][j-1];
    build(0, -1);
}

long long Query(int s, int x[], int t, int y[]) {

    int ans = LINF;
    for(int i = 0; i < s; i++)
        update(x[i]);
    for(int i = 0; i < t; i++)
        ans = min(ans, query(y[i]));
    for(int i = 0; i < s; i++)
        reset(x[i]);
    return ans;
}

컴파일 시 표준 에러 (stderr) 메시지

factories.cpp:13:8: error: 'pii' was not declared in this scope; did you mean 'pai'?
   13 | vector<pii> g[MAXN];
      |        ^~~
      |        pai
factories.cpp:13:11: error: template argument 1 is invalid
   13 | vector<pii> g[MAXN];
      |           ^
factories.cpp:13:11: error: template argument 2 is invalid
factories.cpp: In function 'int getsz(int, int)':
factories.cpp:17:9: error: 'pii' was not declared in this scope; did you mean 'pai'?
   17 |     for(pii &i : g[u])
      |         ^~~
      |         pai
factories.cpp:17:16: error: found ':' in nested-name-specifier, expected '::'
   17 |     for(pii &i : g[u])
      |                ^
      |                ::
factories.cpp:17:14: error: 'i' has not been declared
   17 |     for(pii &i : g[u])
      |              ^
factories.cpp:20:5: error: expected primary-expression before 'return'
   20 |     return sz[u];
      |     ^~~~~~
factories.cpp:19:36: error: expected ';' before 'return'
   19 |             sz[u] += getsz(i.f, u);
      |                                    ^
      |                                    ;
   20 |     return sz[u];
      |     ~~~~~~                          
factories.cpp:20:5: error: expected primary-expression before 'return'
   20 |     return sz[u];
      |     ^~~~~~
factories.cpp:19:36: error: expected ')' before 'return'
   19 |             sz[u] += getsz(i.f, u);
      |                                    ^
      |                                    )
   20 |     return sz[u];
      |     ~~~~~~                          
factories.cpp:17:8: note: to match this '('
   17 |     for(pii &i : g[u])
      |        ^
factories.cpp: In function 'int findc(int, int, int)':
factories.cpp:24:9: error: 'pii' was not declared in this scope; did you mean 'pai'?
   24 |     for(pii &i : g[u])
      |         ^~~
      |         pai
factories.cpp:24:16: error: found ':' in nested-name-specifier, expected '::'
   24 |     for(pii &i : g[u])
      |                ^
      |                ::
factories.cpp:24:14: error: 'i' has not been declared
   24 |     for(pii &i : g[u])
      |              ^
factories.cpp:27:5: error: expected primary-expression before 'return'
   27 |     return u;
      |     ^~~~~~
factories.cpp:26:37: error: expected ';' before 'return'
   26 |             return findc(i.f, u, n);
      |                                     ^
      |                                     ;
   27 |     return u;
      |     ~~~~~~                           
factories.cpp:27:5: error: expected primary-expression before 'return'
   27 |     return u;
      |     ^~~~~~
factories.cpp:26:37: error: expected ')' before 'return'
   26 |             return findc(i.f, u, n);
      |                                     ^
      |                                     )
   27 |     return u;
      |     ~~~~~~                           
factories.cpp:24:8: note: to match this '('
   24 |     for(pii &i : g[u])
      |        ^
factories.cpp: In function 'void build(int, int)':
factories.cpp:35:9: error: 'pii' was not declared in this scope; did you mean 'pai'?
   35 |     for(pii &i : g[c])
      |         ^~~
      |         pai
factories.cpp:35:16: error: found ':' in nested-name-specifier, expected '::'
   35 |     for(pii &i : g[c])
      |                ^
      |                ::
factories.cpp:35:14: error: 'i' has not been declared
   35 |     for(pii &i : g[c])
      |              ^
factories.cpp:38:1: error: expected primary-expression before '}' token
   38 | }
      | ^
factories.cpp:37:27: error: expected ';' before '}' token
   37 |             build(i.f, c);
      |                           ^
      |                           ;
   38 | }
      | ~                          
factories.cpp:38:1: error: expected primary-expression before '}' token
   38 | }
      | ^
factories.cpp:37:27: error: expected ')' before '}' token
   37 |             build(i.f, c);
      |                           ^
      |                           )
   38 | }
      | ~                          
factories.cpp:35:8: note: to match this '('
   35 |     for(pii &i : g[c])
      |        ^
factories.cpp:38:1: error: expected primary-expression before '}' token
   38 | }
      | ^
factories.cpp: In function 'void dfs(int)':
factories.cpp:42:9: error: 'pii' was not declared in this scope; did you mean 'pai'?
   42 |     for(pii &i : g[u])
      |         ^~~
      |         pai
factories.cpp:42:16: error: found ':' in nested-name-specifier, expected '::'
   42 |     for(pii &i : g[u])
      |                ^
      |                ::
factories.cpp:42:14: error: 'i' has not been declared
   42 |     for(pii &i : g[u])
      |              ^
factories.cpp:49:1: error: expected primary-expression before '}' token
   49 | }
      | ^
factories.cpp:48:10: error: expected ';' before '}' token
   48 |         }
      |          ^
      |          ;
   49 | }
      | ~         
factories.cpp:49:1: error: expected primary-expression before '}' token
   49 | }
      | ^
factories.cpp:48:10: error: expected ')' before '}' token
   48 |         }
      |          ^
      |          )
   49 | }
      | ~         
factories.cpp:42:8: note: to match this '('
   42 |     for(pii &i : g[u])
      |        ^
factories.cpp:49:1: error: expected primary-expression before '}' token
   49 | }
      | ^
factories.cpp: In function 'int query(int)':
factories.cpp:4:14: warning: overflow in conversion from 'long int' to 'int' changes value from '4557430888798830399' to '1061109567' [-Woverflow]
    4 | #define LINF 0x3f3f3f3f3f3f3f3f
      |              ^~~~~~~~~~~~~~~~~~
factories.cpp:83:24: note: in expansion of macro 'LINF'
   83 |     int aux = u, ans = LINF;
      |                        ^~~~
factories.cpp: In function 'void reset(int)':
factories.cpp:4:14: warning: overflow in conversion from 'long int' to 'int' changes value from '4557430888798830399' to '1061109567' [-Woverflow]
    4 | #define LINF 0x3f3f3f3f3f3f3f3f
      |              ^~~~~~~~~~~~~~~~~~
factories.cpp:93:19: note: in expansion of macro 'LINF'
   93 |         best[u] = LINF;
      |                   ^~~~
factories.cpp: In function 'void Init(int, int*, int*, int*)':
factories.cpp:4:14: warning: overflow in conversion from 'long int' to 'int' changes value from '4557430888798830399' to '1061109567' [-Woverflow]
    4 | #define LINF 0x3f3f3f3f3f3f3f3f
      |              ^~~~~~~~~~~~~~~~~~
factories.cpp:100:19: note: in expansion of macro 'LINF'
  100 |         best[i] = LINF;
      |                   ^~~~
factories.cpp:3:12: error: request for member 'push_back' in 'g[(*(a + ((sizetype)(((long unsigned int)i) * 4))))]', which is of non-class type 'int'
    3 | #define pb push_back
      |            ^~~~~~~~~
factories.cpp:103:17: note: in expansion of macro 'pb'
  103 |         g[a[i]].pb({b[i], c[i]});
      |                 ^~
factories.cpp:3:12: error: request for member 'push_back' in 'g[(*(b + ((sizetype)(((long unsigned int)i) * 4))))]', which is of non-class type 'int'
    3 | #define pb push_back
      |            ^~~~~~~~~
factories.cpp:104:17: note: in expansion of macro 'pb'
  104 |         g[b[i]].pb({a[i], c[i]});
      |                 ^~
factories.cpp: In function 'long long int Query(int, int*, int, int*)':
factories.cpp:4:14: warning: overflow in conversion from 'long int' to 'int' changes value from '4557430888798830399' to '1061109567' [-Woverflow]
    4 | #define LINF 0x3f3f3f3f3f3f3f3f
      |              ^~~~~~~~~~~~~~~~~~
factories.cpp:116:15: note: in expansion of macro 'LINF'
  116 |     int ans = LINF;
      |               ^~~~