oj.uz

답안 #86582

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
86582 2018-11-26T17:12:27 Z SpeedOfMagic Zagrade (COI17_zagrade) C++17
100 / 100
 2144 ms 91724 KB 
/** MIT License Copyright (c) 2018 Vasilyev Daniil **/
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
template<typename T> using v = vector<T>;
//template<typename T, typename U>  using hmap = __gnu_pbds::gp_hash_table<T, U>;
typedef long long longlong;
#define int longlong
typedef long double ld;
typedef string str;
typedef vector<int> vint;
#define rep(a, l, r) for(int a = (l); a < (r); a++)
#define pb push_back
#define fs first
#define sc second
#define sz(a) ((int) a.size())
const long long inf = 4611686018427387903; //2^62 - 1
#if 0  //FileIO
const string fileName = "";
ifstream fin ((fileName == "" ? "input.txt"  : fileName + ".in" ));
ofstream fout((fileName == "" ? "output.txt" : fileName + ".out"));
#define get fin>>
#define put fout<<
#else
#define get cin>>
#define put cout<<
#endif
#define eol put endl
void read() {} template<typename Arg,typename... Args> void read (Arg& arg,Args&... args){get (arg)     ;read(args...) ;}
void print(){} template<typename Arg,typename... Args> void print(Arg  arg,Args...  args){put (arg)<<" ";print(args...);}
int getInt(){int a; get a; return a;}
int popcount(int a) { return __builtin_popcount(a); }
//code goes here
const int N = 3e5 + 1;
vector<int> t[N]; //init me
int siz[N];
bitset<N> added;

int vals[N];

int calcSize(int cur, int p) {
    siz[cur] = 1;
    for (auto i : t[cur])
        if (!added.test(i) && i != p)
            siz[cur] += calcSize(i, cur);
    return siz[cur];
}


map<int, int> dist[N];
int p;
map<int, int> allDist;
void addDistances(int cur, int l, int r, int par = -1) {
    if (l == 0) {
        allDist[r]++;
        dist[p][r]++;
    }
    for (int i : t[cur])
        if (!added.test(i) && i != par) {
            if (vals[i] == 1)
                addDistances(i, l + 1, r, cur);
            else
                addDistances(i, max(0ll, l - 1), r + (l == 0), cur);
        }
}

int ans = 0;
void checkDistances(int cur, int l, int r, int par = -1) {
    if (r == 0)
        ans += allDist[l] - dist[p][l];
    for (int i : t[cur])
        if (!added.test(i) && i != par) {
            if (vals[i] == 1)
                checkDistances(i, l + (r == 0), max(0ll, r - 1), cur);
            else
                checkDistances(i, l, r + 1, cur);
        }
}

void solve(int cur) {
    allDist.clear();
    p = 0;
    int l = vals[cur] == 1, r = vals[cur] == -1;
    for (auto i : t[cur])
        if (!added.test(i)) {
            dist[p].clear();
            if (vals[i] == 1)
                addDistances(i, l + 1, r, cur);
            else
                addDistances(i, max(0ll, l - 1), r + (l == 0), cur);
            p++;
        }

    if (vals[cur] == -1)
        allDist[1]++;
    else
        ans += allDist[0];
    p = 0;
    for (auto i : t[cur])
        if (!added.test(i)) {
            checkDistances(i, vals[i] == 1, vals[i] == -1);
            p++;
        }
}

void find_centroid(int cur) {
    int lim = calcSize(cur, -1) / 2;
    int pr = -1;
    for (bool again = 1; again;) {
        again = 0;
        for (auto i : t[cur])
			if (!added.test(i) && i != pr && siz[i] > lim) {
                pr = cur;
				cur = i;
                again = 1;
                break;
            }
    }
    added.set(cur);
    solve(cur);

    for (auto i : t[cur])
        if (!added.test(i))
            find_centroid(i);
}

void run() {
    int n;
    get n;
    str s;
    get s;
    rep(i, 1, n + 1)
        if (s[i - 1] == '(')
            vals[i] = 1;
        else
            vals[i] = -1;
    rep(i, 1, n) {
        int v, u;
        read(v, u);
        t[v].pb(u);
        t[u].pb(v);
    }
    find_centroid(1);
    put ans;
}
signed main() {srand(time(0)); ios::sync_with_stdio(0); cin.tie(0); put fixed << setprecision(15); run(); return 0;}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 24 ms 21624 KB Output is correct
2 Correct 22 ms 21748 KB Output is correct
3 Correct 22 ms 21748 KB Output is correct
4 Correct 21 ms 21748 KB Output is correct
5 Correct 21 ms 21748 KB Output is correct
6 Correct 23 ms 21756 KB Output is correct
7 Correct 23 ms 21816 KB Output is correct
8 Correct 21 ms 21816 KB Output is correct
9 Correct 25 ms 21816 KB Output is correct
10 Correct 20 ms 21900 KB Output is correct

Subtask #2
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 601 ms 53416 KB Output is correct
2 Correct 1127 ms 64348 KB Output is correct
3 Correct 613 ms 64348 KB Output is correct
4 Correct 996 ms 64348 KB Output is correct
5 Correct 593 ms 64348 KB Output is correct
6 Correct 774 ms 64348 KB Output is correct
7 Correct 588 ms 64348 KB Output is correct
8 Correct 743 ms 64348 KB Output is correct
9 Correct 627 ms 64348 KB Output is correct
10 Correct 2144 ms 83984 KB Output is correct
11 Correct 416 ms 83984 KB Output is correct

Subtask #3
60.0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 24 ms 21624 KB Output is correct
2 Correct 22 ms 21748 KB Output is correct
3 Correct 22 ms 21748 KB Output is correct
4 Correct 21 ms 21748 KB Output is correct
5 Correct 21 ms 21748 KB Output is correct
6 Correct 23 ms 21756 KB Output is correct
7 Correct 23 ms 21816 KB Output is correct
8 Correct 21 ms 21816 KB Output is correct
9 Correct 25 ms 21816 KB Output is correct
10 Correct 20 ms 21900 KB Output is correct
11 Correct 601 ms 53416 KB Output is correct
12 Correct 1127 ms 64348 KB Output is correct
13 Correct 613 ms 64348 KB Output is correct
14 Correct 996 ms 64348 KB Output is correct
15 Correct 593 ms 64348 KB Output is correct
16 Correct 774 ms 64348 KB Output is correct
17 Correct 588 ms 64348 KB Output is correct
18 Correct 743 ms 64348 KB Output is correct
19 Correct 627 ms 64348 KB Output is correct
20 Correct 2144 ms 83984 KB Output is correct
21 Correct 416 ms 83984 KB Output is correct
22 Correct 1034 ms 83984 KB Output is correct
23 Correct 1020 ms 83984 KB Output is correct
24 Correct 1012 ms 83984 KB Output is correct
25 Correct 986 ms 83984 KB Output is correct
26 Correct 685 ms 83984 KB Output is correct
27 Correct 695 ms 83984 KB Output is correct
28 Correct 690 ms 83984 KB Output is correct
29 Correct 2082 ms 91724 KB Output is correct
30 Correct 2003 ms 91724 KB Output is correct
31 Correct 220 ms 91724 KB Output is correct
32 Correct 417 ms 91724 KB Output is correct