oj.uz

답안 #219888

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
219888 2020-04-06T16:24:31 Z Haunted_Cpp Uzastopni (COCI15_uzastopni) C++17
80 / 160
 500 ms 17792 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};
 
const int N = 1e4 + 1;
const int V = 1e2 + 1;
 
vvi g (N); 
 
// Um conjunto so pode ocorrer 1 unica vez
bitset<V> dp [N][V];
 
int joke [N];
int Get [V][V];
 
void dfs (int node = 0) {
  GO (to, g[node]) {
    dfs (to);
  }
  dp[node][joke[node]][joke[node]] = 1;
  memset (Get, 0, sizeof(Get));
  GO (to, g[node]) {
    FOR (x, 1, V) {
      FOR (y, x, V) {
        if (!Get[x][y]) Get[x][y] = (dp[to][x][y] > 0);
      }
    }
  }
  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 ans = (dp[node][L][k] & Get[k + 1][R]);
        dp[node][L][R] = (dp[node][L][R] | ans);
      }
    }
  } 
  
  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++) {
        if (dp[node][L][R]) continue;
        bool ans = (Get[L][k] & dp[node][k + 1][R]);  
        dp[node][L][R] = (dp[node][L][R] | ans);
      }
    }
  }
   
}
 
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);
  }
  memset (dp, 0, sizeof(dp));
  dfs ();
  int res = 0;
  FOR (i, 1, V) FOR (j, i, V) {
    res += dp[0][i][j];
  }
  cout << res << '\n';
  return 0;
}

Subtask #1
80.0 / 160.0

# 결과 실행 시간 메모리 Grader output
1 Correct 64 ms 16384 KB Output is correct
2 Correct 85 ms 16384 KB Output is correct
3 Correct 97 ms 16384 KB Output is correct
4 Correct 95 ms 16512 KB Output is correct
5 Correct 115 ms 16384 KB Output is correct
6 Correct 115 ms 16640 KB Output is correct
7 Correct 117 ms 16384 KB Output is correct
8 Correct 118 ms 16384 KB Output is correct
9 Correct 115 ms 16384 KB Output is correct
10 Correct 117 ms 16512 KB Output is correct
11 Execution timed out 1098 ms 16768 KB Time limit exceeded
12 Execution timed out 1096 ms 16768 KB Time limit exceeded
13 Execution timed out 1094 ms 16768 KB Time limit exceeded
14 Execution timed out 1097 ms 17792 KB Time limit exceeded
15 Execution timed out 1094 ms 17792 KB Time limit exceeded
16 Execution timed out 1096 ms 17792 KB Time limit exceeded
17 Execution timed out 1101 ms 16768 KB Time limit exceeded
18 Execution timed out 1095 ms 16768 KB Time limit exceeded
19 Execution timed out 1095 ms 16640 KB Time limit exceeded
20 Execution timed out 1097 ms 16640 KB Time limit exceeded