oj.uz

답안 #567059

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
567059 2022-05-23T07:44:06 Z azberjibiou Star Trek (CEOI20_startrek) C++17
78 / 100
 1000 ms 14884 KB 
#include <bits/stdc++.h>
#define gibon ios::sync_with_stdio(false); cin.tie(0);
#define fir first
#define sec second
#define pdd pair<long double, long double>
#define pii pair<int, int>
#define pll pair<ll, ll>
#define ld long double
#define pmax pair<__int128, __int128>
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
typedef long long ll;
using namespace std;
int dx[4]= {0, 1, 0, -1}, dy[4]= {1, 0, -1, 0};
int ddx[8]={1, 1, 0, -1, -1, -1, 0, 1}, ddy[8]={0, 1, 1, 1, 0, -1, -1, -1};
const int mxN=100025;
const int mxM=300005;
const int mxK=1000000000;
const ll MOD=1000'000'007;
const ll INF=1000000000000000005;
ll N, D;
vector <int> v[mxN];
int outw[mxN];
int downw[mxN], upw[mxN];
bool W[mxN];
ll degL[mxN];
ll leafw2[mxN], sizl2[mxN], par2[mxN];
ll numw;
int match[mxN];
ll swapL1[mxN];
void dfs_downw(int now, int pre)
{
    for(int nxt : v[now])   if(nxt!=pre)
    {
        dfs_downw(nxt, now);
    }
    downw[now]=(outw[now]==0 ? 1 : 0);
    if(now!=1)  outw[pre]+=downw[now];
}
void dfs_upw(int now, int pre)
{
    if(now!=1)
    {
        upw[now]=(outw[pre]-downw[now]==0 ? 1 : 0);
        outw[now]+=upw[now];
    }
    for(int nxt : v[now])   if(nxt!=pre)
    {
        dfs_upw(nxt, now);
    }
}
int findpar(int a)
{
    return (par2[a]==a ? a : par2[a]=findpar(par2[a]));
}
void onion(int a, int b)
{
    int p=findpar(a), q=findpar(b);
    par2[p]=q;  sizl2[q]+=sizl2[p]; leafw2[q]+=leafw2[p];
}
int dfs_match(int now, int pre)
{
    for(int nxt : v[now])   if(nxt!=pre && W[nxt] && degL[nxt]==0)
    {
        int tmp=dfs_match(nxt, now);
        if(tmp!=0)  match[now]=tmp, match[tmp]=now;
    }
    if(match[now])  return 0;
    else    return now;
}
int dfs_swap(int now)
{
    if(swapL1[now]!=0)  return swapL1[now];
    ll sum=1;
    for(int nxt : v[match[now]])    if(nxt!=now && W[nxt] && degL[nxt]==0)
    {
        sum+=dfs_swap(nxt);
    }
    return swapL1[now]=sum;
}
ll f(ll a)
{
    return (a%MOD+MOD)%MOD;
}
int main()
{
    gibon
    cin >> N >> D;
    for(int i=1;i<N;i++)
    {
        int a, b;   cin >> a >> b;
        v[a].push_back(b);
        v[b].push_back(a);
    }
    dfs_downw(1, -1);
    dfs_upw(1, -1);
    for(int i=1;i<=N;i++)
    {
        W[i]=(outw[i]>=1);
        numw+=W[i];
    }
    for(int i=1;i<=N;i++)   for(int ele : v[i]) if(!W[ele]) degL[i]++;
    for(int i=1;i<=N;i++)
    {
        par2[i]=i;
        if(degL[i]==1) leafw2[i]=1;
        if(!W[i])   sizl2[i]=1;
    }
    for(int i=1;i<=N;i++)   for(int ele : v[i]) if(degL[ele]<3 && !W[i]) onion(i, ele);
    for(int i=1;i<=N;i++)   if(W[i] && degL[i]==0 && match[i]==0)   dfs_match(i, -1);
    for(int i=1;i<=N;i++)   if(W[i] && degL[i]==0)  dfs_swap(i);
    ll k1=numw, k2=0;
    for(int i=1;i<=N;i++)   k2-=swapL1[i];  k2=f(k2);
    for(int i=1;i<=N;i++)   if(findpar(i)==i)   k2+=sizl2[i]*(sizl2[i]-leafw2[i]), k2=f(k2);
    ll recur=numw;
    ll powN=N;
    for(int i=1;i<=D-1;i++)
    {
        recur=k1*powN%MOD*N%MOD+k2*powN%MOD-k2*recur%MOD;
        recur=f(recur);
        powN=powN*N%MOD*N%MOD;
    }
    if(W[1])
    {
        ll ans=powN*N%MOD;
        if(degL[1]==0)  ans-=(powN-recur)*swapL1[1]; ans=f(ans);
        if(degL[1]==1)  ans-=(powN-recur)*sizl2[findpar(1)]; ans=f(ans);
        cout << ans;
    }
    else
    {
        ll ans=0;
        ans+=(powN-recur)*sizl2[findpar(1)];
        cout << f(ans);
    }
}

Compilation message

startrek.cpp: In function 'int main()':
startrek.cpp:114:5: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
  114 |     for(int i=1;i<=N;i++)   k2-=swapL1[i];  k2=f(k2);
      |     ^~~
startrek.cpp:114:45: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
  114 |     for(int i=1;i<=N;i++)   k2-=swapL1[i];  k2=f(k2);
      |                                             ^~
startrek.cpp:127:9: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
  127 |         if(degL[1]==0)  ans-=(powN-recur)*swapL1[1]; ans=f(ans);
      |         ^~
startrek.cpp:127:54: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
  127 |         if(degL[1]==0)  ans-=(powN-recur)*swapL1[1]; ans=f(ans);
      |                                                      ^~~
startrek.cpp:128:9: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
  128 |         if(degL[1]==1)  ans-=(powN-recur)*sizl2[findpar(1)]; ans=f(ans);
      |         ^~
startrek.cpp:128:62: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
  128 |         if(degL[1]==1)  ans-=(powN-recur)*sizl2[findpar(1)]; ans=f(ans);
      |                                                              ^~~

Subtask #1
0.0 / 0.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 2 ms 2772 KB Output is correct

Subtask #2
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Execution timed out 1086 ms 2644 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #3
8.0 / 8.0

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

Subtask #4
15.0 / 15.0

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

Subtask #5
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 2 ms 2644 KB Output is correct
4 Correct 1 ms 2644 KB Output is correct
5 Correct 2 ms 2644 KB Output is correct
6 Correct 2 ms 2644 KB Output is correct
7 Correct 2 ms 2824 KB Output is correct
8 Correct 2 ms 2772 KB Output is correct
9 Correct 2 ms 2772 KB Output is correct
10 Correct 2 ms 2772 KB Output is correct
11 Correct 2 ms 2708 KB Output is correct
12 Correct 89 ms 13324 KB Output is correct
13 Correct 74 ms 13176 KB Output is correct
14 Correct 61 ms 10632 KB Output is correct
15 Correct 103 ms 11376 KB Output is correct
16 Correct 76 ms 11396 KB Output is correct

Subtask #6
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 2 ms 2644 KB Output is correct
4 Correct 1 ms 2644 KB Output is correct
5 Correct 2 ms 2644 KB Output is correct
6 Correct 2 ms 2644 KB Output is correct
7 Correct 2 ms 2824 KB Output is correct
8 Correct 2 ms 2772 KB Output is correct
9 Correct 2 ms 2772 KB Output is correct
10 Correct 2 ms 2772 KB Output is correct
11 Correct 2 ms 2708 KB Output is correct
12 Correct 1 ms 2644 KB Output is correct
13 Correct 3 ms 2772 KB Output is correct
14 Correct 3 ms 2644 KB Output is correct
15 Correct 3 ms 2680 KB Output is correct
16 Correct 2 ms 2676 KB Output is correct
17 Correct 2 ms 2680 KB Output is correct
18 Correct 2 ms 2676 KB Output is correct
19 Correct 2 ms 2644 KB Output is correct
20 Correct 2 ms 2644 KB Output is correct
21 Correct 3 ms 2772 KB Output is correct
22 Correct 2 ms 2772 KB Output is correct
23 Correct 2 ms 2792 KB Output is correct
24 Correct 3 ms 2812 KB Output is correct
25 Correct 2 ms 2772 KB Output is correct
26 Correct 3 ms 2772 KB Output is correct
27 Correct 3 ms 2772 KB Output is correct
28 Correct 3 ms 2680 KB Output is correct
29 Correct 3 ms 2772 KB Output is correct
30 Correct 3 ms 2772 KB Output is correct

Subtask #7
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 2 ms 2644 KB Output is correct
4 Correct 1 ms 2644 KB Output is correct
5 Correct 2 ms 2644 KB Output is correct
6 Correct 2 ms 2644 KB Output is correct
7 Correct 2 ms 2824 KB Output is correct
8 Correct 2 ms 2772 KB Output is correct
9 Correct 2 ms 2772 KB Output is correct
10 Correct 2 ms 2772 KB Output is correct
11 Correct 2 ms 2708 KB Output is correct
12 Correct 89 ms 13324 KB Output is correct
13 Correct 74 ms 13176 KB Output is correct
14 Correct 61 ms 10632 KB Output is correct
15 Correct 103 ms 11376 KB Output is correct
16 Correct 76 ms 11396 KB Output is correct
17 Correct 1 ms 2644 KB Output is correct
18 Correct 3 ms 2772 KB Output is correct
19 Correct 3 ms 2644 KB Output is correct
20 Correct 3 ms 2680 KB Output is correct
21 Correct 2 ms 2676 KB Output is correct
22 Correct 2 ms 2680 KB Output is correct
23 Correct 2 ms 2676 KB Output is correct
24 Correct 2 ms 2644 KB Output is correct
25 Correct 2 ms 2644 KB Output is correct
26 Correct 3 ms 2772 KB Output is correct
27 Correct 2 ms 2772 KB Output is correct
28 Correct 2 ms 2792 KB Output is correct
29 Correct 3 ms 2812 KB Output is correct
30 Correct 2 ms 2772 KB Output is correct
31 Correct 3 ms 2772 KB Output is correct
32 Correct 3 ms 2772 KB Output is correct
33 Correct 3 ms 2680 KB Output is correct
34 Correct 3 ms 2772 KB Output is correct
35 Correct 3 ms 2772 KB Output is correct
36 Correct 77 ms 14380 KB Output is correct
37 Correct 96 ms 14272 KB Output is correct
38 Correct 50 ms 11468 KB Output is correct
39 Correct 78 ms 12528 KB Output is correct
40 Correct 61 ms 12564 KB Output is correct
41 Correct 76 ms 14884 KB Output is correct
42 Correct 77 ms 13264 KB Output is correct
43 Correct 43 ms 10568 KB Output is correct
44 Correct 96 ms 12512 KB Output is correct
45 Correct 77 ms 12492 KB Output is correct

Subtask #8
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 2 ms 2772 KB Output is correct
3 Correct 1 ms 2644 KB Output is correct
4 Correct 2 ms 2644 KB Output is correct
5 Execution timed out 1086 ms 2644 KB Time limit exceeded
6 Halted 0 ms 0 KB -