CSES - Datatähti Open 2017 - Results
Submission details
Task:Witch game
Sender:nigus
Submission time:2017-01-19 23:23:34 +0200
Language:C++
Status:READY
Result:47
Feedback
groupverdictscore
#1ACCEPTED23
#2ACCEPTED24
#30
Test results
testverdicttimegroup
#1ACCEPTED0.04 s1details
#2ACCEPTED0.04 s1details
#3ACCEPTED0.05 s1details
#4ACCEPTED0.04 s1details
#5ACCEPTED0.04 s1details
#6ACCEPTED0.08 s2details
#7ACCEPTED0.08 s2details
#8ACCEPTED0.14 s2details
#9ACCEPTED0.07 s2details
#10ACCEPTED0.08 s2details
#11ACCEPTED0.51 s3details
#12ACCEPTED0.53 s3details
#13--3details
#14ACCEPTED0.52 s3details
#15ACCEPTED0.60 s3details

Compiler report

input/code.cpp: In function 'int main()':
input/code.cpp:19:14: warning: unused variable 'c3' [-Wunused-variable]
     ll c1,c2,c3,c4,c5;
              ^
input/code.cpp:19:17: warning: unused variable 'c4' [-Wunused-variable]
     ll c1,c2,c3,c4,c5;
                 ^
input/code.cpp:19:20: warning: unused variable 'c5' [-Wunused-variable]
     ll c1,c2,c3,c4,c5;
                    ^
input/code.cpp:23:21: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d" , &b);
                     ^
input/code.cpp:27:25: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d" , &a);
                         ^

Code

#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

ll mod = 1000000007ll;
ll n,m,k,x,y;

vector<ll> A;
vector<vector<ll> > C(100001 , vector<ll>());
ll deg[100001] = {0};
vector<unordered_set<ll> > CS;

int main()
{
    //freopen("input.txt","r",stdin);
    //freopen("output.txt","w",stdout);

    ll c1,c2,c3,c4,c5;
    int a,b,c;

    //cin >> n;
    scanf("%d" , &b);
    n = ll(b);
    for(c1 = 0; c1 < n; c1++){
        //cin >> a;
        scanf("%d" , &a);
        A.push_back(a-1);
        unordered_set<ll> S1;
        CS.push_back(S1);
    }

    for(c1 = 0; c1 < n; c1++){
        a = A[c1];
        if(c1 < a || A[a] != c1){
            //cout << c1 << "\n";
            deg[a]++;
            deg[c1]++;
            C[a].push_back(c1);
            C[c1].push_back(a);
            CS[a].insert(c1);
            CS[c1].insert(a);
        }
    }

    ll ans = (n * (n-1) * (n-2)) / 6;

    ll trip = 0;
    ll things = 0;
    ll tria = 0;
    for(c1 = 0; c1 < n; c1++){
        a = A[c1];
        bool mark[100001] = {0};
        for(c2 = 0; c2 < deg[c1]; c2++){
            c = C[c1][c2];
            mark[c] = 1;
        }

        if(c1 < a || A[a] != c1){

            /*
            if(deg[a] < deg[c1]){
                b = c1;
            }
            else{
                b = a;
                a = c1;
            }
            */
            b = c1;

            ll inter = deg[b] - 1;

            for(c2 = 0; c2 < deg[a]; c2++){
                c = C[a][c2];
                if(c != a && c != b){
                    if(mark[c] == 0)inter++;
                    if(mark[c] == 1)tria++;
                    mark[c] = 1;
                }
            }


            /*
            for(c2 = 0; c2 < deg[b]; c2++){
                c = C[b][c2];
                if(c != a){
                    if(CS[a].find(c) == CS[a].end()){
                        inter++;
                    }
                    else{
                        tria++;
                    }
                }
            }
            */
            //cout << a+1 << " " << b+1 << "  ,  " << inter << " " << tria << "\n";
            ll thing = n-2;
            thing -= inter;
            things += thing;
            trip += inter;
        }
    }

   // for(c1 = 0; c1 < n; c1++){
    //    if(A[c1] > c1 && A[A[c1]] > A[c1] && A[A[A[c1]]] == c1)tria++;
   // }

    //cout << tria << "\n";
    tria /= 3;

    trip -= tria;

    trip /= 2;
    things += trip;
    ans -= things;

    cout << ans << "\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: 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