CSES - Datatähti Open 2017 - Results
Submission details
Task:Witch game
Sender:thuustalu
Submission time:2017-01-21 01:36:51 +0200
Language:C++
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
#30
Test results
testverdicttimegroup
#1ACCEPTED0.04 s1details
#2ACCEPTED0.03 s1details
#3ACCEPTED0.05 s1details
#40.04 s1details
#50.05 s1details
#6ACCEPTED0.05 s2details
#7ACCEPTED0.04 s2details
#8ACCEPTED0.05 s2details
#90.04 s2details
#10ACCEPTED0.03 s2details
#11ACCEPTED0.10 s3details
#12ACCEPTED0.09 s3details
#13ACCEPTED0.08 s3details
#140.09 s3details
#150.08 s3details

Code

#include <iostream>

typedef long long llong;

const int MAX_PLAYER = 100005;

using namespace std;

llong acc [MAX_PLAYER], acccnt [MAX_PLAYER];
llong choose [MAX_PLAYER][4];

int main () {
  llong playerc;
  cin >> playerc;

  for (int i = 1; i <= playerc; i++) {
    cin >> acc[i];
    acccnt[acc[i]]++;
  }

  llong nwtc = playerc * (playerc - 2);
  
  for (int i = 1; i <= playerc; i++) {
    if (acc[acc[i]] == i) {
      if (i < acc[i]) {
        nwtc -= (playerc - 2);
      }
      nwtc -= (acccnt[i] - 1) * (acccnt[i]) / 2;
    } else {
      nwtc -= (acccnt[i] * (acccnt[i] + 1)) / 2;
    }

    if (acc[acc[acc[i]]] == i) {
      nwtc++;
    }
  }

  choose[0][0] = 1;
  for (int i = 1; i <= playerc; i++) {
    choose[i][0] = 1;
    for (int j = 1; j <= 3; j++) {
      choose[i][j] = choose[i - 1][j - 1] + choose[i - 1][j];
    }
  }

  cout << choose[playerc][3] - nwtc << endl;
}

Test details

Test 1

Group: 1

Verdict: ACCEPTED

input
100
2 1 4 3 6 5 8 7 10 9 12 11 14 ...

correct output
156800

user output
156800

Test 2

Group: 1

Verdict: ACCEPTED

input
100
2 3 4 5 6 7 8 9 10 11 12 13 14...

correct output
152000

user output
152000

Test 3

Group: 1

Verdict: ACCEPTED

input
100
2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...

correct output
156849

user output
156849

Test 4

Group: 1

Verdict:

input
100
2 3 1 5 6 4 8 9 7 11 12 10 14 ...

correct output
151968

user output
151902

Test 5

Group: 1

Verdict:

input
100
8 98 100 62 42 36 95 70 22 49 ...

correct output
152040

user output
152038

Test 6

Group: 2

Verdict: ACCEPTED

input
5000
2 1 4 3 6 5 8 7 10 9 12 11 14 ...

correct output
20808340000

user output
20808340000

Test 7

Group: 2

Verdict: ACCEPTED

input
5000
2 3 4 5 6 7 8 9 10 11 12 13 14...

correct output
20795850000

user output
20795850000

Test 8

Group: 2

Verdict: ACCEPTED

input
5000
2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...

correct output
20808342499

user output
20808342499

Test 9

Group: 2

Verdict:

input
5000
2 3 1 5 6 4 8 9 7 11 12 10 14 ...

correct output
20795848337

user output
20795845005

Test 10

Group: 2

Verdict: ACCEPTED

input
5000
283 2880 2565 3289 4160 936 39...

correct output
20795852465

user output
20795852465

Test 11

Group: 3

Verdict: ACCEPTED

input
100000
2 1 4 3 6 5 8 7 10 9 12 11 14 ...

correct output
166656666800000

user output
166656666800000

Test 12

Group: 3

Verdict: ACCEPTED

input
100000
2 3 4 5 6 7 8 9 10 11 12 13 14...

correct output
166651667000000

user output
166651667000000

Test 13

Group: 3

Verdict: ACCEPTED

input
100000
2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...

correct output
166656666849999

user output
166656666849999

Test 14

Group: 3

Verdict:

input
100000
2 3 1 5 6 4 8 9 7 11 12 10 14 ...

correct output
166651666966668

user output
166651666900002

Test 15

Group: 3

Verdict:

input
100000
186 62491 95379 37431 88427 93...

correct output
166651667250100

user output
166651667250098