oj.uz

Submission #296210

# Submission time Handle Problem Language Result Execution time Memory
296210 2020-09-10T12:08:52 Z PedroBigMan Star Trek (CEOI20_startrek) C++14
65 / 100
 297 ms 38696 KB 
#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <string>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <queue>
#include <deque>
#include <list>
#include <iomanip>
#include <stdlib.h>
#include <time.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typedef long double ld;
#define REP(i,a,b) for(ll i=a; i<b; i++)
#define pb push_back
#define mp make_pair
#define pl pair<ll,ll>
#define ff first
#define ss second
#define whole(x) x.begin(),x.end()
#define DEBUG(i) cout<<"Pedro Is The Master "<<i<<endl
#define INF 5000000000000000000LL
ll mod=1000000007LL;

template<class A=ll> 
void Out(vector<A> a) {REP(i,0,a.size()) {cout<<a[i]<<" ";} cout<<endl;}

template<class A=ll>
void In(vector<A> &a, ll N) {A cur; REP(i,0,N) {cin>>cur; a.pb(cur);}} 

class Matrix
{
    public:
    ll a,b,c,d;
    
    Matrix() {a=1LL; b=0LL; c=0LL; d=1LL;}
    Matrix(ll x, ll y, ll w, ll z) {a=x; b=y; c=w; d=z;}
    
    Matrix operator *(Matrix X)
    {
        Matrix ANS(a*X.a+b*X.c,a*X.b+b*X.d,c*X.a+d*X.c,c*X.b+d*X.d);
        ANS.a%=mod; ANS.b%=mod; ANS.c%=mod; ANS.d%=mod;
        return ANS;
    }
};

Matrix fastexp(Matrix A, ll e)
{
    if(e==0LL) {Matrix id; return id;}
    if(e%2LL==0LL) {Matrix V = fastexp(A,e/2LL); return (V*V);}
    else {Matrix V=fastexp(A,e/2LL); return (V*V*A);}
}

class Tree
{
    public:
    ll N; 
    vector<ll> p; 
    vector<vector<ll> > sons;
    vector<vector<ll> > adj;
    ll root;
    vector<bool> visited;
    vector<ll> sub; //number of nodes in subtree
    vector<ll> w,l,state,SL,SLR;
    
    Tree(vector<vector<ll> > ad, ll r=0LL)
    {
        N=ad.size(); root=r; adj=ad;
        REP(i,0,N) {visited.pb(false);}
        vector<ll> xx; REP(i,0,N) {sons.pb(xx); p.pb(-1); sub.pb(1LL);}
        DFS_Build(r,r);
        REP(i,0,N) {w.pb(-1); l.pb(-1); state.pb(-1); SL.pb(0LL); SLR.pb(0LL);}
    }
    
    void Reset()
    {
        REP(i,0,N) {visited[i]=false;}
    }
    
    void DFS_Build(ll s, ll par)
    {
        p[s]=par;
        visited[s]=true;
        REP(i,0,adj[s].size())
        {
            if(adj[s][i]==par) {continue;}
            sons[s].pb(adj[s][i]);
            DFS_Build(adj[s][i],s);
            sub[s]+=sub[adj[s][i]];
        }
        return;
    }
    
    void fE(ll s)
    {
        ll c;
        REP(i,0,sons[s].size()) {c=sons[s][i]; fE(c);}
        REP(i,0,sons[s].size()) {c=sons[s][i]; SL[s]+=(1LL-state[c]);}
        if(sons[s].size()==0) {w[s]=1LL; l[s]=0LL; state[s]=0LL; return;}
        ll LC=0LL; ll lc=-1LL;
        state[s]=0LL; REP(i,0,sons[s].size()) {c=sons[s][i]; if(state[c]==0LL) {LC++; lc=c;}}
        if(LC>0LL) {state[s]=1LL;}
        if(state[s]==0LL)
        {
            w[s]=0LL; REP(i,0,sons[s].size()) {c=sons[s][i]; w[s]+=l[c];}
            w[s]++;
            l[s]=sub[s]-w[s];
        }
        else if(LC>1LL)
        {
            w[s]=sub[s]; l[s]=0LL;
        }
        else
        {
            w[s]=sub[s]-sub[lc]+l[lc];
            l[s]=sub[s]-w[s];
        }
    }
    
    void Build_SLR(ll s)
    {
        if(s==0LL) {SLR[s]=SL[s];}
        else
        {
            ll A=p[s];
            if(SLR[A]>1-SL[s]) {SLR[s]=SL[s];}
            else {SLR[s]=SL[s]+1LL;}
        }
        
        REP(i,0,sons[s].size()) {ll c=sons[s][i]; Build_SLR(c);}
    }
};

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    ll N,U; cin>>N>>U;
    vector<vector<ll> > adj; vector<ll> xx; REP(i,0,N) {adj.pb(xx);}
    pl cur;
    REP(i,0,N-1)
    {
        cin>>cur.ff>>cur.ss; cur.ff--; cur.ss--; 
        adj[cur.ff].pb(cur.ss); 
        adj[cur.ss].pb(cur.ff); 
    }
    ll A,B,C,D,E,F,G;
    A=0LL; B=0LL; C=0LL; D=0LL; E=0LL; F=0LL; G=0LL;
    if(N<=1000LL)
    {
        REP(i,0,N)
        {
            Tree T(adj,i);
            T.fE(i);
            A+=T.w[i]; B+=T.l[i];
            if(T.state[i]==1) {C++;} else {D++;}
            if(i==0) {E=A; F=B; G=C;}
        }
        A%=mod; B%=mod;
        Matrix M((C*N)%mod,A,(D*N)%mod,B);
        M=fastexp(M,U-1LL);
        pl las; las.ff=M.a*C+M.b*D; las.ss=M.c*C+M.d*D;
        las.ff%=mod; las.ss%=mod;
        ll ans=G*N*las.ff+E*las.ss;
        ans%=mod; if(ans<0) {ans+=mod;}
        cout<<ans<<endl;
        return 0LL;
    }
    Tree T(adj,0LL); T.fE(0LL);
    if(T.state[0]==1LL) {G=1LL;}
    E=T.w[0]; F=T.l[0];
    T.Build_SLR(0LL);
    REP(i,0,N) {if(T.SLR[i]>0) {C++;} else {D++;}}
    ll ans = G*N*C+E*D; ans%=mod; if(ans<0LL) {ans+=mod;}
    cout<<ans<<endl;
    return 0;
}

Compilation message

startrek.cpp: In member function 'void Tree::DFS_Build(ll, ll)':
startrek.cpp:20:33: 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]
   20 | #define REP(i,a,b) for(ll i=a; i<b; i++)
......
   90 |         REP(i,0,adj[s].size())
      |             ~~~~~~~~~~~~~~~~~    
startrek.cpp:90:9: note: in expansion of macro 'REP'
   90 |         REP(i,0,adj[s].size())
      |         ^~~
startrek.cpp: In member function 'void Tree::fE(ll)':
startrek.cpp:20:33: 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]
   20 | #define REP(i,a,b) for(ll i=a; i<b; i++)
......
  103 |         REP(i,0,sons[s].size()) {c=sons[s][i]; fE(c);}
      |             ~~~~~~~~~~~~~~~~~~   
startrek.cpp:103:9: note: in expansion of macro 'REP'
  103 |         REP(i,0,sons[s].size()) {c=sons[s][i]; fE(c);}
      |         ^~~
startrek.cpp:20:33: 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]
   20 | #define REP(i,a,b) for(ll i=a; i<b; i++)
......
  104 |         REP(i,0,sons[s].size()) {c=sons[s][i]; SL[s]+=(1LL-state[c]);}
      |             ~~~~~~~~~~~~~~~~~~   
startrek.cpp:104:9: note: in expansion of macro 'REP'
  104 |         REP(i,0,sons[s].size()) {c=sons[s][i]; SL[s]+=(1LL-state[c]);}
      |         ^~~
startrek.cpp:20:33: 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]
   20 | #define REP(i,a,b) for(ll i=a; i<b; i++)
......
  107 |         state[s]=0LL; REP(i,0,sons[s].size()) {c=sons[s][i]; if(state[c]==0LL) {LC++; lc=c;}}
      |                           ~~~~~~~~~~~~~~~~~~
startrek.cpp:107:23: note: in expansion of macro 'REP'
  107 |         state[s]=0LL; REP(i,0,sons[s].size()) {c=sons[s][i]; if(state[c]==0LL) {LC++; lc=c;}}
      |                       ^~~
startrek.cpp:20:33: 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]
   20 | #define REP(i,a,b) for(ll i=a; i<b; i++)
......
  111 |             w[s]=0LL; REP(i,0,sons[s].size()) {c=sons[s][i]; w[s]+=l[c];}
      |                           ~~~~~~~~~~~~~~~~~~
startrek.cpp:111:23: note: in expansion of macro 'REP'
  111 |             w[s]=0LL; REP(i,0,sons[s].size()) {c=sons[s][i]; w[s]+=l[c];}
      |                       ^~~
startrek.cpp: In member function 'void Tree::Build_SLR(ll)':
startrek.cpp:20:33: 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]
   20 | #define REP(i,a,b) for(ll i=a; i<b; i++)
......
  136 |         REP(i,0,sons[s].size()) {ll c=sons[s][i]; Build_SLR(c);}
      |             ~~~~~~~~~~~~~~~~~~   
startrek.cpp:136:9: note: in expansion of macro 'REP'
  136 |         REP(i,0,sons[s].size()) {ll c=sons[s][i]; Build_SLR(c);}
      |         ^~~
startrek.cpp: In function 'int main()':
startrek.cpp:153:18: warning: variable 'F' set but not used [-Wunused-but-set-variable]
  153 |     ll A,B,C,D,E,F,G;
      |                  ^

Subtask #1
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 292 ms 760 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct

Subtask #3
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 3 ms 384 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 3 ms 384 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 291 ms 760 KB Output is correct
8 Correct 278 ms 640 KB Output is correct
9 Correct 252 ms 760 KB Output is correct
10 Correct 297 ms 760 KB Output is correct
11 Correct 288 ms 664 KB Output is correct

Subtask #5
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 3 ms 384 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 291 ms 760 KB Output is correct
8 Correct 278 ms 640 KB Output is correct
9 Correct 252 ms 760 KB Output is correct
10 Correct 297 ms 760 KB Output is correct
11 Correct 288 ms 664 KB Output is correct
12 Correct 140 ms 33248 KB Output is correct
13 Correct 146 ms 38552 KB Output is correct
14 Correct 122 ms 30688 KB Output is correct
15 Correct 136 ms 30688 KB Output is correct
16 Correct 137 ms 30688 KB Output is correct

Subtask #6
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 3 ms 384 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 291 ms 760 KB Output is correct
8 Correct 278 ms 640 KB Output is correct
9 Correct 252 ms 760 KB Output is correct
10 Correct 297 ms 760 KB Output is correct
11 Correct 288 ms 664 KB Output is correct
12 Correct 0 ms 384 KB Output is correct
13 Correct 295 ms 664 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 4 ms 384 KB Output is correct
17 Correct 4 ms 384 KB Output is correct
18 Correct 4 ms 384 KB Output is correct
19 Correct 4 ms 384 KB Output is correct
20 Correct 4 ms 384 KB Output is correct
21 Correct 288 ms 712 KB Output is correct
22 Correct 283 ms 640 KB Output is correct
23 Correct 251 ms 640 KB Output is correct
24 Correct 290 ms 668 KB Output is correct
25 Correct 289 ms 640 KB Output is correct
26 Correct 288 ms 760 KB Output is correct
27 Correct 287 ms 640 KB Output is correct
28 Correct 164 ms 640 KB Output is correct
29 Correct 291 ms 640 KB Output is correct
30 Correct 289 ms 760 KB Output is correct

Subtask #7
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 3 ms 384 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 291 ms 760 KB Output is correct
8 Correct 278 ms 640 KB Output is correct
9 Correct 252 ms 760 KB Output is correct
10 Correct 297 ms 760 KB Output is correct
11 Correct 288 ms 664 KB Output is correct
12 Correct 140 ms 33248 KB Output is correct
13 Correct 146 ms 38552 KB Output is correct
14 Correct 122 ms 30688 KB Output is correct
15 Correct 136 ms 30688 KB Output is correct
16 Correct 137 ms 30688 KB Output is correct
17 Correct 0 ms 384 KB Output is correct
18 Correct 295 ms 664 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 0 ms 384 KB Output is correct
21 Correct 4 ms 384 KB Output is correct
22 Correct 4 ms 384 KB Output is correct
23 Correct 4 ms 384 KB Output is correct
24 Correct 4 ms 384 KB Output is correct
25 Correct 4 ms 384 KB Output is correct
26 Correct 288 ms 712 KB Output is correct
27 Correct 283 ms 640 KB Output is correct
28 Correct 251 ms 640 KB Output is correct
29 Correct 290 ms 668 KB Output is correct
30 Correct 289 ms 640 KB Output is correct
31 Correct 288 ms 760 KB Output is correct
32 Correct 287 ms 640 KB Output is correct
33 Correct 164 ms 640 KB Output is correct
34 Correct 291 ms 640 KB Output is correct
35 Correct 289 ms 760 KB Output is correct
36 Correct 134 ms 34404 KB Output is correct
37 Correct 140 ms 38696 KB Output is correct
38 Correct 121 ms 30568 KB Output is correct
39 Correct 133 ms 30820 KB Output is correct
40 Correct 139 ms 30560 KB Output is correct
41 Incorrect 139 ms 36580 KB Output isn't correct
42 Halted 0 ms 0 KB -

Subtask #8
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 292 ms 760 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 4 ms 384 KB Output is correct
10 Correct 4 ms 384 KB Output is correct
11 Correct 3 ms 384 KB Output is correct
12 Correct 4 ms 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 291 ms 760 KB Output is correct
15 Correct 278 ms 640 KB Output is correct
16 Correct 252 ms 760 KB Output is correct
17 Correct 297 ms 760 KB Output is correct
18 Correct 288 ms 664 KB Output is correct
19 Correct 140 ms 33248 KB Output is correct
20 Correct 146 ms 38552 KB Output is correct
21 Correct 122 ms 30688 KB Output is correct
22 Correct 136 ms 30688 KB Output is correct
23 Correct 137 ms 30688 KB Output is correct
24 Correct 0 ms 384 KB Output is correct
25 Correct 295 ms 664 KB Output is correct
26 Correct 1 ms 384 KB Output is correct
27 Correct 0 ms 384 KB Output is correct
28 Correct 4 ms 384 KB Output is correct
29 Correct 4 ms 384 KB Output is correct
30 Correct 4 ms 384 KB Output is correct
31 Correct 4 ms 384 KB Output is correct
32 Correct 4 ms 384 KB Output is correct
33 Correct 288 ms 712 KB Output is correct
34 Correct 283 ms 640 KB Output is correct
35 Correct 251 ms 640 KB Output is correct
36 Correct 290 ms 668 KB Output is correct
37 Correct 289 ms 640 KB Output is correct
38 Correct 288 ms 760 KB Output is correct
39 Correct 287 ms 640 KB Output is correct
40 Correct 164 ms 640 KB Output is correct
41 Correct 291 ms 640 KB Output is correct
42 Correct 289 ms 760 KB Output is correct
43 Correct 134 ms 34404 KB Output is correct
44 Correct 140 ms 38696 KB Output is correct
45 Correct 121 ms 30568 KB Output is correct
46 Correct 133 ms 30820 KB Output is correct
47 Correct 139 ms 30560 KB Output is correct
48 Incorrect 139 ms 36580 KB Output isn't correct
49 Halted 0 ms 0 KB -