oj.uz

답안 #623712

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
623712 2022-08-06T10:59:37 Z Vladth11 Star Trek (CEOI20_startrek) C++14
38 / 100
 66 ms 21720 KB 
#include <bits/stdc++.h>
#define C 1
#define P 0
#define debug(x) cerr << #x << " " << x << "\n"
#define debugs(x) cerr << #x << " " << x << " "

using namespace std;
typedef long long ll;
typedef pair <ll, ll> pii;
typedef pair <long double, pii> muchie;

const ll NMAX = 100001;
const ll VMAX = 101;
const ll INF = (1LL << 60);
const ll MOD = 1000000007;
const ll BLOCK = 447;
const ll base = 117;
const ll nr_of_bits = 18;
const ll inv2 = 500000004;

vector <ll> v[NMAX];
ll col[NMAX];
ll children[NMAX][2];
ll maximal[NMAX];
ll rosii[NMAX];
ll adv[NMAX];

void DFS(ll node, ll p){
    col[node] = P;
    for(auto x : v[node]){
        if(x == p) continue;
        DFS(x, node);
        children[node][col[x]]++;
    }
    if(children[node][C] == (ll)v[node].size() - (p != 0)){
        col[node] = P;
    }else{
        col[node] = C;
    }
    if(col[node] == P)
        rosii[node] = 1;
    for(auto x : v[node]){
        if(x == p) continue;
        if(col[node] != col[x] && children[node][C] >= (ll)v[node].size() - (p != 0) - 1){
            rosii[node] += rosii[x];
        }
    }
}

ll perdanti = 0;

void Rerooting(ll node, ll p){
    adv[node] = col[node];
    if(adv[node] == P)
        perdanti++;
    for(auto x : v[node]){
        if(x == p) continue;
        ll cx = col[x], cnode = col[node];
        children[node][col[x]]--;
        if(children[node][C] == v[node].size() - 1){
            col[node] = P;
        }else{
            col[node] = C;
        }
        children[x][col[node]]++;
        if(children[x][C] == v[x].size()){
            col[x] = P;
        }else{
            col[x] = C;
        }
        Rerooting(x, node);
        children[x][col[node]]--;
        col[x] = cx;
        col[node] = cnode;
        children[node][col[x]]++;
    }
}

int main() {
    //ifstream cin(".in");
    //ofstream cout(".out");
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    ll n, d, i;
    cin >> n >> d;
    for(i = 1; i < n; i++){
        ll a, b;
        cin >> a >> b;
        v[a].push_back(b);
        v[b].push_back(a);
    }
    DFS(1, 0);
    Rerooting(1, 0);
    ll schimba = 1LL * perdanti * rosii[1];
    schimba %= MOD;
    if(col[1] == P){
        cout << schimba;
    }else{
        cout << (1LL * n * n - schimba + MOD) % MOD;
    }
    return 0;
}

Compilation message

startrek.cpp: In function 'void Rerooting(ll, ll)':
startrek.cpp:60:30: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   60 |         if(children[node][C] == v[node].size() - 1){
      |            ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
startrek.cpp:66:27: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   66 |         if(children[x][C] == v[x].size()){
      |            ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~

Subtask #1
0.0 / 0.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2676 KB Output is correct
2 Incorrect 2 ms 2680 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 2644 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2676 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 2 ms 2644 KB Output is correct
4 Correct 2 ms 2644 KB Output is correct
5 Correct 2 ms 2644 KB Output is correct
6 Correct 1 ms 2680 KB Output is correct

Subtask #4
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2676 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 2 ms 2644 KB Output is correct
4 Correct 2 ms 2644 KB Output is correct
5 Correct 2 ms 2644 KB Output is correct
6 Correct 1 ms 2680 KB Output is correct
7 Correct 2 ms 2772 KB Output is correct
8 Correct 3 ms 2772 KB Output is correct
9 Correct 3 ms 2772 KB Output is correct
10 Correct 2 ms 2772 KB Output is correct
11 Correct 2 ms 2772 KB Output is correct

Subtask #5
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2676 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 2 ms 2644 KB Output is correct
4 Correct 2 ms 2644 KB Output is correct
5 Correct 2 ms 2644 KB Output is correct
6 Correct 1 ms 2680 KB Output is correct
7 Correct 2 ms 2772 KB Output is correct
8 Correct 3 ms 2772 KB Output is correct
9 Correct 3 ms 2772 KB Output is correct
10 Correct 2 ms 2772 KB Output is correct
11 Correct 2 ms 2772 KB Output is correct
12 Correct 66 ms 15980 KB Output is correct
13 Correct 64 ms 21720 KB Output is correct
14 Correct 46 ms 11012 KB Output is correct
15 Correct 58 ms 11208 KB Output is correct
16 Correct 60 ms 11268 KB Output is correct

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2676 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 2 ms 2644 KB Output is correct
4 Correct 2 ms 2644 KB Output is correct
5 Correct 2 ms 2644 KB Output is correct
6 Correct 1 ms 2680 KB Output is correct
7 Correct 2 ms 2772 KB Output is correct
8 Correct 3 ms 2772 KB Output is correct
9 Correct 3 ms 2772 KB Output is correct
10 Correct 2 ms 2772 KB Output is correct
11 Correct 2 ms 2772 KB Output is correct
12 Correct 1 ms 2660 KB Output is correct
13 Incorrect 2 ms 2788 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #7
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2676 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 2 ms 2644 KB Output is correct
4 Correct 2 ms 2644 KB Output is correct
5 Correct 2 ms 2644 KB Output is correct
6 Correct 1 ms 2680 KB Output is correct
7 Correct 2 ms 2772 KB Output is correct
8 Correct 3 ms 2772 KB Output is correct
9 Correct 3 ms 2772 KB Output is correct
10 Correct 2 ms 2772 KB Output is correct
11 Correct 2 ms 2772 KB Output is correct
12 Correct 66 ms 15980 KB Output is correct
13 Correct 64 ms 21720 KB Output is correct
14 Correct 46 ms 11012 KB Output is correct
15 Correct 58 ms 11208 KB Output is correct
16 Correct 60 ms 11268 KB Output is correct
17 Correct 1 ms 2660 KB Output is correct
18 Incorrect 2 ms 2788 KB Output isn't correct
19 Halted 0 ms 0 KB -

Subtask #8
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2676 KB Output is correct
2 Incorrect 2 ms 2680 KB Output isn't correct
3 Halted 0 ms 0 KB -