Submission #219850

#	Time	Username	Problem	Language	Result	Execution time	Memory
219850		Haunted_Cpp	Uzastopni (COCI15_uzastopni)	C++17	56 / 160	131 ms	9592 KiB

uzastopni

#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <cassert>
#include <string>
#include <cstring>
#include <bitset>
#include <random>
#include <chrono>
#include <iomanip>
 
/*
#pragma GCC optimize ("Ofast")
#pragma GCC target("fma,sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#pragma GCC optimize("unroll-loops")
*/
 
#define FOR(i, a, b) for(int i = a; i < (int) b; i++)
#define F0R(i, a) FOR (i, 0, a)
#define ROF(i, a, b) for(int i = a; i >= (int) b; i--)
#define R0F(i, a) ROF(i, a, 0)
#define GO(i, a) for (auto i : a)
 
#define rsz resize
#define eb emplace_back
#define pb push_back
#define sz(x) (int) x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define f first
#define s second
 
using namespace std;
 
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pii> vpii;
typedef vector<vi> vvi;
typedef vector<vpii> vvpii;
typedef long long i64;
typedef vector<i64> vi64;
typedef vector<vi64> vvi64;
typedef pair<i64, i64> pi64;
typedef vector<pi64> vpi64;
 
const int dr[] = {+1, -1, +0, +0, +1, -1, +1, -1};
const int dc[] = {+0, +0, +1, -1, +1, -1, -1, +1};
const int ms[] = {+31, +29, +31, 30, +31, +30, +31, +31, +30, +31, +30, +31};

const int N = 1e2 + 5;
const int V = 1e2 + 5;

vvi g (N); 

i64 dp [N][V][V];
int joke [N];

void dfs (int node = 0) {
  vpii bridge;
  bridge.eb(joke[node], node);
  GO (to, g[node]) {
    dfs (to);
    bridge.eb(joke[to], to);
  }
  sort (all(bridge));
  int start = -1;
  F0R (i, sz(bridge)) {
    if (bridge[i] == make_pair(joke[node], node)) {
      start = i;
      break;
    }
  }
  assert (start != -1);
  const int cur = joke[node];
  dp[node][cur][cur] = 1;
  FOR (element, start, sz(bridge)) {
    int to = bridge[element].second;
    F0R (x, V) {
      FOR (y, x, V) {
        const int left = x;
        const int right = y;
        FOR (i, right + 1, V) { 
          dp[node][left][i] += dp[node][x][y] * dp[to][right + 1][i];
        }
        FOR (i, 1, left) {
          dp[node][i][right] += dp[node][x][y] * dp[to][i][left - 1];
        } 
      }
    }
  }
  R0F (element, start) {
    int to = bridge[element].second;
    F0R (x, V) {
      FOR (y, x, V) {
        const int left = x;
        const int right = y;
        FOR (i, right + 1, V) { 
          dp[node][left][i] += dp[node][x][y] * dp[to][right + 1][i];
        }
        FOR (i, 1, left) {
          dp[node][i][right] += dp[node][x][y] * dp[to][i][left - 1];
        } 
      }
    }
  } 
}

int main () {
  ios::sync_with_stdio(0);
  cin.tie(0);
  int n;
  cin >> n;
  assert (n <= 100);
  F0R (i, n) cin >> joke[i];
  F0R (i, n - 1) {
    int st, et;
    cin >> st >> et;
    --st; --et;
    g[st].eb(et);
  }
  memset (dp, 0, sizeof(dp));
  dfs ();
  i64 res = 0;
  F0R (i, V) F0R (j, V) {
    res += dp[0][i][j];
  }
  cout << res << '\n';
  return 0;
}

• Subtask 1: 56 / 160