CSES - Datatähti Open 2017

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
group	verdict	score
#1	ACCEPTED	23
#2	ACCEPTED	24
#3	TIME LIMIT EXCEEDED	0

Test results
test	verdict	time	group
#1	ACCEPTED	0.04 s	1	details
#2	ACCEPTED	0.04 s	1	details
#3	ACCEPTED	0.05 s	1	details
#4	ACCEPTED	0.04 s	1	details
#5	ACCEPTED	0.04 s	1	details
#6	ACCEPTED	0.08 s	2	details
#7	ACCEPTED	0.08 s	2	details
#8	ACCEPTED	0.14 s	2	details
#9	ACCEPTED	0.07 s	2	details
#10	ACCEPTED	0.08 s	2	details
#11	ACCEPTED	0.51 s	3	details
#12	ACCEPTED	0.53 s	3	details
#13	TIME LIMIT EXCEEDED	--	3	details
#14	ACCEPTED	0.52 s	3	details
#15	ACCEPTED	0.60 s	3	details

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 ...` view save

correct output
`156800` view save

user output
`156800` view save

Test 2

Group: 1

Verdict: ACCEPTED

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

correct output
`152000` view save

user output
`152000` view save

Test 3

Group: 1

Verdict: ACCEPTED

input
`100 2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`156849` view save

user output
`156849` view save

Test 4

Group: 1

Verdict: ACCEPTED

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

correct output
`151968` view save

user output
`151968` view save

Test 5

Group: 1

Verdict: ACCEPTED

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

correct output
`152040` view save

user output
`152040` view save

Test 6

Group: 2

Verdict: ACCEPTED

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

correct output
`20808340000` view save

user output
`20808340000` view save

Test 7

Group: 2

Verdict: ACCEPTED

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

correct output
`20795850000` view save

user output
`20795850000` view save

Test 8

Group: 2

Verdict: ACCEPTED

input
`5000 2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`20808342499` view save

user output
`20808342499` view save

Test 9

Group: 2

Verdict: ACCEPTED

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

correct output
`20795848337` view save

user output
`20795848337` view save

Test 10

Group: 2

Verdict: ACCEPTED

input
`5000 283 2880 2565 3289 4160 936 39...` view save

correct output
`20795852465` view save

user output
`20795852465` view save

Test 11

Group: 3

Verdict: ACCEPTED

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

correct output
`166656666800000` view save

user output
`166656666800000` view save

Test 12

Group: 3

Verdict: ACCEPTED

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

correct output
`166651667000000` view save

user output
`166651667000000` view save

Test 13

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`100000 2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`166656666849999` view save

user output
(empty)

Test 14

Group: 3

Verdict: ACCEPTED

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

correct output
`166651666966668` view save

user output
`166651666966668` view save

Test 15

Group: 3

Verdict: ACCEPTED

input
`100000 186 62491 95379 37431 88427 93...` view save

correct output
`166651667250100` view save

user output
`166651667250100` view save

Datatähti Open 2017

Witch game

Compiler report

Code

Test details

Test 1

Test 2

Test 3

Test 4

Test 5

Test 6

Test 7

Test 8

Test 9

Test 10

Test 11

Test 12

Test 13

Test 14

Test 15

Tasks

Submissions (nigus)