CSES - Datatähti Open 2017 - Results
Submission details
Task:Witch game
Sender:bciobanu
Submission time:2017-01-22 14:59:05 +0200
Language:C++
Status:READY
Result:47
Feedback
groupverdictscore
#1ACCEPTED23
#2ACCEPTED24
#30
Test results
testverdicttimegroup
#1ACCEPTED0.03 s1details
#2ACCEPTED0.05 s1details
#3ACCEPTED0.03 s1details
#4ACCEPTED0.04 s1details
#5ACCEPTED0.04 s1details
#6ACCEPTED0.11 s2details
#7ACCEPTED0.09 s2details
#8ACCEPTED0.12 s2details
#9ACCEPTED0.13 s2details
#10ACCEPTED0.15 s2details
#110.20 s3details
#120.17 s3details
#130.20 s3details
#140.20 s3details
#150.18 s3details

Code

#include <bits/stdc++.h>
#define SZ(x) ((int) (x).size())
using namespace std;

typedef long long int64;

const int NMAX = 5000;

int frequency[NMAX];
int value[NMAX];

int main(void) {
    cin.tie(0);
    ios_base::sync_with_stdio(false);
    
    int n; cin >> n;
    for (int i = 0; i < n; i++) {
        cin >> value[i];
        value[i]--;
        frequency[value[i]]++;
    }
    
    int64_t answer = 0LL;
    for (int i = 0; i < n; i++) {
        memset(frequency, 0, 4 * n);
        for (int j = i + 1; j < n; j++) {
            frequency[value[j]]++;
        }
        for (int j = i + 1; j < n - 1; j++) {
            frequency[value[j]]--; 
            if (value[i] == j || value[j] == i) {
                continue;
            }
            answer += (n - j - 1) - frequency[i] - frequency[j];
            if (value[i] == value[j]) {
                if (value[i] > j && (value[value[i]] != i && value[value[i]] != j)) {
                    answer--;
                }
            } else {
                if (value[i] > j && (value[value[i]] != i && value[value[i]] != j)) {
                    answer--;
                }
                if (value[j] > j && (value[value[j]] != i && value[value[j]] != j)) {
                    answer--;
                }
            }
        }
    }
    cout << answer << '\n';
    return 0;
}

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

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

correct output
166656666800000

user output
(empty)

Test 12

Group: 3

Verdict:

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

correct output
166651667000000

user output
(empty)

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:

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

correct output
166651666966668

user output
(empty)

Test 15

Group: 3

Verdict:

input
100000
186 62491 95379 37431 88427 93...

correct output
166651667250100

user output
(empty)