제출 #872214

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
872214		SalihSahin	Svjetlo (COCI20_svjetlo)	C++14	0 / 110	159 ms	54744 KiB

svjetlo

#include<bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define int long long 
using namespace std;

const int N = 5e5 + 5;
const int mod = 1e9+7;
const int inf = 1e18 + 10;
const int L = 20 * 20 * 20;

vector<int> in(N), adj[N];
vector<int> arr;

void dfs(int node, int par){
    arr.pb(node);
    for(auto itr: adj[node]){
        if(itr != par){
            dfs(itr, node);
        }
    }
}

int32_t main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    int n;
    cin>>n;
    string s;
    cin>>s;
    for(int i = 0; i < n-1; i++){
        int a, b;
        cin>>a>>b;
        in[a]++;
        in[b]++;
        adj[a].pb(b);
        adj[b].pb(a);
    }
    int uc = 0;
    for(int i = 1; i <= n; i++){
        if(in[i] == 1){
            uc = i;
            break;
        }
    }

    dfs(uc, uc);
    int first = n, last = 0;
    vector<int> tree(n);
    int ans = 0;

    for(int i = 0; i < n; i++){
        tree[i] = s[arr[i] - 1] - '0';
        if(tree[i] == 0){
            first = min(first, i);
            last = max(last, i);
        }
    }
    vector<int> nt;
    for(int i = 0; i < n; i++){
        if(i >= first && i <= last) nt.pb(tree[i]);
    }
    int l = 0, r = n-1;
    bool now = 0;
    while(l <= r){
        ans += r - l + 1;
        while(nt[l] == now && l <= r) l++;
        while(nt[r] == now && r >= l) r--;
        now ^= 1;
    }

    cout<<ans<<endl;
    return 0;
}

• Subtask 1: 0 / 20
• Subtask 2: 0 / 30
• Subtask 3: 0 / 30
• Subtask 4: 0 / 30