CSES - Datatähti Open 2017 - Results
Submission details
Task:Witch game
Sender:ruhanhabib39
Submission time:2017-01-20 21:43:18 +0200
Language:C++
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
#30
Test results
testverdicttimegroup
#1ACCEPTED0.05 s1details
#2ACCEPTED0.04 s1details
#3ACCEPTED0.04 s1details
#40.04 s1details
#50.03 s1details
#6ACCEPTED0.04 s2details
#7ACCEPTED0.04 s2details
#8ACCEPTED0.04 s2details
#90.04 s2details
#10ACCEPTED0.04 s2details
#11ACCEPTED0.05 s3details
#12ACCEPTED0.06 s3details
#13ACCEPTED0.06 s3details
#140.06 s3details
#150.05 s3details

Compiler report

input/code.cpp: In function 'int main()':
input/code.cpp:13:21: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    scanf("%lld", &n);
                     ^
input/code.cpp:15:27: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
       scanf("%d", &out[i]);
                           ^

Code

#include <bits/stdc++.h>
using namespace std;

typedef long long Long;

const int MAXN = 1e5;

Long n;
int out[MAXN + 10];
Long in[MAXN + 10];

int main() {
   scanf("%lld", &n);
   for(int i = 1; i <= n; i++) {
      scanf("%d", &out[i]);
      in[out[i]]++;
   }
   Long cc = n * (n - 1) * (n - 2) / 6;
   Long bad = 0;
   for(int u = 1; u <= n; u++) {
      int v = out[u];
      if(out[v] == u) {
         if(u < v) {
            bad += n-2;
            bad += (in[u]-1)*(in[u]-2) / 2;
         } else {
            bad += in[u]*(in[u] - 1) / 2;
         }
      } else {
         bad += (in[u] * (in[u] - 1)) / 2;
         if(out[out[v]] == v) {
            continue;
         }
         bad += n - in[u] - in[v] - 1;
      }
   }
   // cerr << "bad = " << bad << "\n";
   cc -= bad;
   printf("%lld\n", cc);
}

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
152001

Test 5

Group: 1

Verdict:

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

correct output
152040

user output
152041

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
20795850003

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
166651667000001

Test 15

Group: 3

Verdict:

input
100000
186 62491 95379 37431 88427 93...

correct output
166651667250100

user output
166651667650085