CSES - Leirikisa 4 - Results
Submission details
Task:paleta
Sender:Hansuzu
Submission time:2016-08-01 17:23:01 +0300
Language:C++
Status:READY
Result:0
Feedback
groupverdictscore
#10
Test results
testverdicttime
#1ACCEPTED0.05 sdetails
#2ACCEPTED0.05 sdetails
#3ACCEPTED0.06 sdetails
#40.06 sdetails
#5ACCEPTED0.07 sdetails
#60.06 sdetails
#70.06 sdetails
#80.06 sdetails
#9ACCEPTED0.06 sdetails
#100.06 sdetails
#11ACCEPTED0.06 sdetails
#120.06 sdetails
#13ACCEPTED0.06 sdetails
#140.06 sdetails
#150.06 sdetails
#160.06 sdetails
#170.06 sdetails
#180.08 sdetails
#19ACCEPTED0.07 sdetails
#200.48 sdetails
#21ACCEPTED0.06 sdetails
#220.47 sdetails
#23ACCEPTED0.06 sdetails

Code

#include <iostream>
using namespace std;
int N, K;

const int M=1000000007;

int f[1222333];

int u[1222333];

int cli;
int cl[1222333];

int clz[1222333];

void gc(int c){
  if (cl[c]) return;
  cl[c]=cli;
  ++clz[cli];
  gc(f[c]);
}

void go(int c){
  if (u[c]==2) return;
  if (u[c]==1){
    ++cli;
    gc(c);
    return;
  }
  u[c]=1;
  go(f[c]);
  u[c]=2;
}


long long ksmp[1222333];
long long kerp[1222333];

int main(){
  cin >> N >> K;
  ksmp[1]=K;
  kerp[1]=0;
  for (int i=2; i<1222333; ++i){
    ksmp[i]=kerp[i-1];
    kerp[i]=ksmp[i-1]*(K-1)%M;
  }
  
  
  for (int i=0; i<N; ++i) cin >> f[i], --f[i];
  for (int i=0; i<N; ++i) go(i);
  long long ans=1;
  int cla=0;
  for (int i=1; i<=cli; ++i){
    long long vrt;
    if (clz[i]==1) vrt=K;
    else vrt=ksmp[clz[i]-1]*(K-1)%M+kerp[clz[i]-1]*(K-2)%M;
    vrt%=M;
    ans*=vrt;
    ans%=M;
    cla+=clz[i];
  }
  for (int j=0; j<N-cla; ++j) ans*=(K-1), ans%=M;
  cout << ans << "\n";
  
}

Test details

Test 1

Verdict: ACCEPTED

input
2 3
2 1

correct output
6

user output
6

Test 2

Verdict: ACCEPTED

input
3 4
2 3 1

correct output
24

user output
24

Test 3

Verdict: ACCEPTED

input
3 4
2 1 1

correct output
36

user output
36

Test 4

Verdict:

input
10 4
3 10 7 9 1 4 8 5 6 2

correct output
69120

user output
20736

Test 5

Verdict: ACCEPTED

input
10 2
9 4 2 5 8 10 6 3 1 7

correct output
0

user output
0

Test 6

Verdict:

input
20 6
15 16 6 12 8 2 11 4 14 17 8 11...

correct output
749062329

user output
749946849

Test 7

Verdict:

input
10 3
10 7 6 5 9 2 3 6 4 1

correct output
1296

user output
864

Test 8

Verdict:

input
100 6
70 62 57 34 87 73 81 45 11 25 ...

correct output
170647921

user output
17161084

Test 9

Verdict: ACCEPTED

input
5 7
2 3 4 5 5

correct output
9072

user output
9072

Test 10

Verdict:

input
200 13
88 97 79 1 184 104 127 159 157...

correct output
798243726

user output
172378049

Test 11

Verdict: ACCEPTED

input
5 2
1 2 3 4 5

correct output
32

user output
32

Test 12

Verdict:

input
1000 17
321 466 231 684 53 480 95 61 5...

correct output
799039396

user output
832103922

Test 13

Verdict: ACCEPTED

input
5 1
1 2 3 4 5

correct output
1

user output
1

Test 14

Verdict:

input
2000 27
545 945 734 555 1974 1119 694 ...

correct output
87259530

user output
55335269

Test 15

Verdict:

input
5 4
2 3 4 5 1

correct output
240

user output
72

Test 16

Verdict:

input
20000 207
4712 13482 9751 10677 2744 326...

correct output
920405949

user output
235487926

Test 17

Verdict:

input
10 9
2 3 4 5 6 7 8 9 10 1

correct output
73741825

user output
294912

Test 18

Verdict:

input
100000 137
35216 66352 76631 39149 68563 ...

correct output
873619169

user output
266003511

Test 19

Verdict: ACCEPTED

input
5 2
2 1 3 4 5

correct output
16

user output
16

Test 20

Verdict:

input
1000000 1337
157667 207184 572776 559466 52...

correct output
815275681

user output
261810297

Test 21

Verdict: ACCEPTED

input
5 2
2 3 4 5 1

correct output
0

user output
0

Test 22

Verdict:

input
1000000 137037
302969 577811 4130 64 558319 7...

correct output
387136640

user output
750632404

Test 23

Verdict: ACCEPTED

input
6 2
2 3 4 5 6 1

correct output
2

user output
2