oj.uz

Submission #292372

# Submission time Handle Problem Language Result Execution time Memory
292372 2020-09-06T22:02:23 Z VROOM_VARUN Factories (JOI14_factories) C++14
15 / 100
 8000 ms 143408 KB 
/*
ID: varunra2
LANG: C++
TASK: factories
*/

#include <bits/stdc++.h>

#include "factories.h"
using namespace std;

#ifdef DEBUG
#include "lib/debug.h"
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#define debug_arr(...) \
  cerr << "[" << #__VA_ARGS__ << "]:", debug_arr(__VA_ARGS__)
#pragma GCC diagnostic ignored "-Wsign-compare"
//#pragma GCC diagnostic ignored "-Wunused-parameter"
//#pragma GCC diagnostic ignored "-Wunused-variable"
#else
#define debug(...) 42
#endif

#define EPS 1e-9
#define IN(A, B, C) assert(B <= A && A <= C)
#define INF (int)1e9
#define MEM(a, b) memset(a, (b), sizeof(a))
#define MOD 1000000007
#define MP make_pair
#define PB push_back
#define all(cont) cont.begin(), cont.end()
#define rall(cont) cont.end(), cont.begin()
#define x first
#define y second

const double PI = acos(-1.0);
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> PII;
typedef map<int, int> MPII;
typedef multiset<int> MSETI;
typedef set<int> SETI;
typedef set<string> SETS;
typedef vector<int> VI;
typedef vector<PII> VII;
typedef vector<VI> VVI;
typedef vector<string> VS;

#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define trav(a, x) for (auto& a : x)
#define sz(x) (int)(x).size()
typedef pair<int, int> pii;
typedef vector<int> vi;
#pragma GCC diagnostic ignored "-Wsign-compare"
// util functions
int n;
VI cent;
VI par;
vector<bool> use;
VI sub;
vector<VII> adj;
VVI lca;
vector<ll> d;
VI tin;
VI tout;
int timer = 0;

int dfs(int u, int v) {
  sub[u] = 1;
  for (auto& x : adj[u]) {
    if (x.x == v or use[x.x]) continue;
    sub[u] += dfs(x.x, u);
  }
  return sub[u];
}

int getCent(int u, int v, int siz) {
  for (auto& x : adj[u]) {
    if (x.x == v or use[x.x]) continue;
    if (sub[x.x] * 2 > siz) {
      return getCent(x.x, u, siz);
    }
  }
  return u;
}

void decompose(int u, int v, int cnt) {
  int cur = getCent(u, -1, dfs(u, -1));
  use[cur] = true;
  cent[cur] = cnt++;
  par[cur] = v;

  for (auto& x : adj[cur]) {
    if (use[x.x]) continue;
    decompose(x.x, cur, cnt);
  }
}

void init_siz(int N) {
  n = N;
  adj.resize(n);
  cent.resize(n);
  par.resize(n);
  use.resize(n);
  sub.resize(n);
  lca.resize(n);
  d.resize(n);
  tin.resize(n);
  tout.resize(n);
  for (int i = 0; i < n; i++) {
    lca[i].resize(20);
    use[i] = false;
  }
}

void getAdj(int a[], int b[], int d[]) {
  debug(n);
  for (int i = 0; i < n - 1; i++) {
    int u, v, w;
    u = a[i];
    v = b[i];
    w = d[i];
    adj[u].PB(MP(v, w));
    adj[v].PB(MP(u, w));
  }
}

void dfsLCA(int u, int v) {
  tin[u] = ++timer;
  lca[u][0] = v;
  for (int i = 1; i < 20; i++) {
    int to = lca[u][i - 1];
    if (to == -1)
      lca[u][i] = -1;
    else
      lca[u][i] = lca[to][i - 1];
  }
  for (auto& x : adj[u]) {
    if (x.x == v) continue;
    d[x.x] = d[u] + x.y;
    dfsLCA(x.x, u);
  }
  tout[u] = ++timer;
}

bool isAnc(int u, int v) {
  if (u == -1) return true;
  if (v == -1) return false;
  return tin[u] <= tin[v] and tout[u] >= tout[v];
}

int getLCA(int u, int v) {
  if (isAnc(u, v)) return u;
  if (isAnc(v, u)) return v;
  for (int i = 19; i >= 0; i--) {
    if (!isAnc(lca[u][i], v)) {
      u = lca[u][i];
    }
  }
  return lca[u][0];
}

ll getDist(int u, int v) { return d[u] + d[v] - 2 * d[getLCA(u, v)]; }

void Init(int N, int a[], int b[], int d[]) {
  init_siz(N);
  getAdj(a, b, d);
  decompose(0, -1, 0);
  dfsLCA(0, -1);
}

// MPII mindist;

ll Query(int s, int x[], int t, int y[]) {
  map<int, pair<ll, bool>> mindist;
  for (int i = 0; i < s; i++) {
    // okay so we need to traverse up from x[i];
    int u = x[i];
    while (u != -1) {
      if (mindist[u].y) {
        mindist[u].x = min(mindist[u].x, getDist(u, x[i]));
      } else {
        mindist[u].y = true;
        mindist[u].x = getDist(u, x[i]);
      }
      u = par[u];
    }
  }

  ll ret = (ll)1e17;

  for (int i = 0; i < t; i++) {
    int u = y[i];
    while (u != -1) {
      if (mindist[u].y) {
        ret = min(ret, mindist[u].x + getDist(u, y[i]));
      }
      u = par[u];
    }
  }

  return ret;
}

// int main() {
// #ifndef ONLINE_JUDGE
//   freopen("factories.in", "r", stdin);
//   freopen("factories.out", "w", stdout);
// #endif
//   cin.sync_with_stdio(0);
//   cin.tie(0);

//   int N, q;
//   cin >> N >> q;

//   int a[N - 1];
//   int b[N - 1];
//   int d[N - 1];

//   for (int i = 0; i < N - 1; i++) {
//     cin >> a[i] >> b[i] >> d[i];
//   }

//   Init(N, a, b, d);

//   for (int i = 0; i < q; i++) {
//     int s, t;
//     cin >> s >> t;
//     int x[s];
//     int y[t];
//     for (int j = 0; j < s; j++) {
//       cin >> x[j];
//     }
//     for (int j = 0; j < t; j++) {
//       cin >> y[j];
//     }

//     cout << Query(s, x, t, y) << '\n';
//   }

//   return 0;
// }

Compilation message

factories.cpp: In function 'void getAdj(int*, int*, int*)':
factories.cpp:21:20: warning: statement has no effect [-Wunused-value]
   21 | #define debug(...) 42
      |                    ^~
factories.cpp:117:3: note: in expansion of macro 'debug'
  117 |   debug(n);
      |   ^~~~~

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 46 ms 896 KB Output is correct
2 Correct 2752 ms 19320 KB Output is correct
3 Correct 4141 ms 19060 KB Output is correct
4 Correct 3831 ms 19548 KB Output is correct
5 Correct 4559 ms 19536 KB Output is correct
6 Correct 840 ms 19320 KB Output is correct
7 Correct 4164 ms 19196 KB Output is correct
8 Correct 4394 ms 19380 KB Output is correct
9 Correct 4555 ms 19652 KB Output is correct
10 Correct 840 ms 19076 KB Output is correct
11 Correct 4224 ms 19196 KB Output is correct

Subtask #2
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 640 KB Output is correct
2 Correct 4161 ms 141876 KB Output is correct
3 Execution timed out 8050 ms 143408 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #3
0 / 67.0

# Verdict Execution time Memory Grader output
1 Correct 46 ms 896 KB Output is correct
2 Correct 2752 ms 19320 KB Output is correct
3 Correct 4141 ms 19060 KB Output is correct
4 Correct 3831 ms 19548 KB Output is correct
5 Correct 4559 ms 19536 KB Output is correct
6 Correct 840 ms 19320 KB Output is correct
7 Correct 4164 ms 19196 KB Output is correct
8 Correct 4394 ms 19380 KB Output is correct
9 Correct 4555 ms 19652 KB Output is correct
10 Correct 840 ms 19076 KB Output is correct
11 Correct 4224 ms 19196 KB Output is correct
12 Correct 6 ms 640 KB Output is correct
13 Correct 4161 ms 141876 KB Output is correct
14 Execution timed out 8050 ms 143408 KB Time limit exceeded
15 Halted 0 ms 0 KB -