oj.uz

Submission #220019

# Submission time Handle Problem Language Result Execution time Memory
220019 2020-04-06T20:26:10 Z Haunted_Cpp Uzastopni (COCI15_uzastopni) C++17
160 / 160
 181 ms 18040 KB 
#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};
 
// It should something like -> O ( N * V ^ 3 ), 50 pts  
 
const int N = 1e4 + 1;
const int V = 1e2 + 1;
 
vvi g (N); 
 
// We are dealing with sets. No duplicates allowed. This is why bitset is correct.
bitset<V> dp [N][V];
bitset<V> juntar [V];
bitset<V> valido;

int joke [N];


void dfs (int node = 0) {
  GO (to, g[node]) {
    dfs (to);
  }
  
  F0R (i, V) juntar[i].reset();
  
  GO (to, g[node]) {
    FOR (x, 1, V) {
      juntar[x] = (juntar[x] | dp[to][x]);
    }
  }
  
  vpii intervalo_l;
  vpii intervalo_r;
  
  // To the right
  FOR (i, joke[node] + 1, V) {
    FOR (j, i, V) {
      if (juntar[i][j]) {
        intervalo_r.eb(i, j);
      }
    }
  }
  // To the left
  for (int i = joke[node] - 1; i > 0; i--) {
    for (int j = i; j > 0; j--) {
      if (juntar[j][i]) {
        intervalo_l.eb(j, i);
      }
    }
  }
  
  dp[node][joke[node]][joke[node]] = 1;
  
  valido.reset();
  valido[joke[node]] = 1;
  
  // Processar Left
  GO (to, intervalo_l) {
    int L = to.f;
    int R = to.s;
    assert (L <= R);
    if (valido[R + 1]) {
      dp[node][L][joke[node]] = 1;
      valido[L] = 1;
    }
  }
  
  // Processar Right
  GO (to, intervalo_r) {
    int L = to.f;
    int R = to.s;
    assert (L <= R);
    if (valido[L - 1]) {
      dp[node][joke[node]][R] = 1;
      valido[R] = 1;
    }
  }
  
  // Processar Both sides
  FOR (i, 1, joke[node]) {
    if (valido[i]) {
      FOR (j, joke[node] + 1, V) {
        if (valido[j]) {
          dp[node][i][j] = 1;
        }
      }
    }
  } 
  
  
  
  
  
  
  
  /*
  for (int tamanho = 1; tamanho < V; tamanho++) {
    for (int L = 1; L + tamanho < V; L++) {
      const int R = L + tamanho; // Inclusive
      for (int k = L; k <= R; k++) {
        bool ansA = (dp[node][L][k] & Get[k + 1][R]);
        bool ansB = (Get[L][k] & dp[node][k + 1][R]);  
        dp[node][L][R] = (dp[node][L][R] | ansA);
        if (ansA || ansB) break;
      }
    }
  } 
  */
}
 
int main () {
  ios::sync_with_stdio(0);
  cin.tie(0);
  int n;
  cin >> n;
  F0R (i, n) cin >> joke[i];
  F0R (i, n - 1) {
    int st, et;
    cin >> st >> et;
    --st; --et;
    g[st].eb(et);
  }
  dfs ();
  int res = 0;
  FOR (i, 1, V) res += dp[0][i].count();
  cout << res << '\n';
  return 0;
}

Subtask #1
160.0 / 160.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 640 KB Output is correct
2 Correct 6 ms 768 KB Output is correct
3 Correct 6 ms 768 KB Output is correct
4 Correct 6 ms 768 KB Output is correct
5 Correct 7 ms 768 KB Output is correct
6 Correct 6 ms 768 KB Output is correct
7 Correct 6 ms 768 KB Output is correct
8 Correct 6 ms 768 KB Output is correct
9 Correct 6 ms 768 KB Output is correct
10 Correct 6 ms 768 KB Output is correct
11 Correct 166 ms 16760 KB Output is correct
12 Correct 170 ms 16636 KB Output is correct
13 Correct 181 ms 16760 KB Output is correct
14 Correct 136 ms 18040 KB Output is correct
15 Correct 138 ms 17912 KB Output is correct
16 Correct 138 ms 17888 KB Output is correct
17 Correct 178 ms 16632 KB Output is correct
18 Correct 180 ms 16728 KB Output is correct
19 Correct 125 ms 16504 KB Output is correct
20 Correct 127 ms 16504 KB Output is correct