CSES - Datatähti 2017 loppu - Results
Submission details
Task:Noitapeli
Sender:fergusq
Submission time:2017-01-19 16:36:28 +0200
Language:C++
Status:READY
Result:23
Feedback
groupverdictscore
#1ACCEPTED23
#20
#30
Test results
testverdicttimegroup
#1ACCEPTED0.04 s1details
#2ACCEPTED0.04 s1details
#3ACCEPTED0.05 s1details
#4ACCEPTED0.03 s1details
#5ACCEPTED0.05 s1details
#6ACCEPTED0.05 s2details
#7ACCEPTED0.04 s2details
#8--2details
#9ACCEPTED0.06 s2details
#10ACCEPTED0.05 s2details
#11ACCEPTED0.12 s3details
#12ACCEPTED0.14 s3details
#13--3details
#14ACCEPTED0.14 s3details
#15ACCEPTED0.16 s3details

Code

#include <iostream>
#include <algorithm>
#include <unordered_set>
using namespace std;

#define max(a, b) (((a)>(b))?(a):(b))
#define min(a, b) (((a)<(b))?(a):(b))

long long nCr(int n, int k) {
  long long a = 1;
  for (int i = n; i > max(k, n-k); i--) {
    a *= i;
  }
  for (int i = 2; i <= min(n-k, k); i++) {
    a /= i;
  }
  return a;
}

int main() {
  int n;
  cin >> n;

  unordered_set<int> a[n+1];
  
  long long c = nCr(n, 3);
  //cout << c << "\n";
  for (int i = 1; i <= n; i++) {
    int j;
    cin >> j;
    if (a[i].count(j)>0 && a[j].count(i)>0) continue;
    a[i].insert(j);
    a[j].insert(i);
    unordered_set<int> ins;
    ins.insert(a[i].begin(), a[i].end());
    ins.insert(a[j].begin(), a[j].end());
    //cout << n-ins.size() << "\n";
    //for (int i : ins) cout << ": " << i << "\n";
    c -= n-ins.size();
  }
  cout << c << "\n";
}

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: ACCEPTED

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

correct output
151968

user output
151968

Test 5

Group: 1

Verdict: ACCEPTED

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

correct output
152040

user output
152040

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:

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

correct output
20808342499

user output
(empty)

Test 9

Group: 2

Verdict: ACCEPTED

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

correct output
20795848337

user output
20795848337

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:

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

correct output
166656666849999

user output
(empty)

Test 14

Group: 3

Verdict: ACCEPTED

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

correct output
166651666966668

user output
166651666966668

Test 15

Group: 3

Verdict: ACCEPTED

input
100000
186 62491 95379 37431 88427 93...

correct output
166651667250100

user output
166651667250100