CSES - Datatähti Open 2017

CSES - Datatähti Open 2017 - Results

Submission details
Task:	Witch game
Sender:	nigus
Submission time:	2022-03-01 14:01:10 +0200
Language:	C++ (C++17)
Status:	READY
Result:	100

Feedback
group	verdict	score
#1	ACCEPTED	23
#2	ACCEPTED	24
#3	ACCEPTED	53

Test results
test	verdict	time	group
#1	ACCEPTED	0.01 s	1	details
#2	ACCEPTED	0.01 s	1	details
#3	ACCEPTED	0.01 s	1	details
#4	ACCEPTED	0.01 s	1	details
#5	ACCEPTED	0.01 s	1	details
#6	ACCEPTED	0.01 s	2	details
#7	ACCEPTED	0.01 s	2	details
#8	ACCEPTED	0.01 s	2	details
#9	ACCEPTED	0.01 s	2	details
#10	ACCEPTED	0.01 s	2	details
#11	ACCEPTED	0.04 s	3	details
#12	ACCEPTED	0.05 s	3	details
#13	ACCEPTED	0.05 s	3	details
#14	ACCEPTED	0.05 s	3	details
#15	ACCEPTED	0.06 s	3	details

Compiler report

input/code.cpp: In function 'int main()':
input/code.cpp:44:12: warning: unused variable 'c' [-Wunused-variable]
     ll a,b,c,d,e;
            ^
input/code.cpp:44:14: warning: unused variable 'd' [-Wunused-variable]
     ll a,b,c,d,e;
              ^
input/code.cpp:44:16: warning: unused variable 'e' [-Wunused-variable]
     ll a,b,c,d,e;
                ^

Code

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

#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define per(i, b, a) for(int i = b - 1; i >= a; i--)
#define trav(a, x) for(auto& a : x)
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef long double ld;
typedef unsigned long long ull;

unsigned seed = chrono::system_clock::now().time_since_epoch().count();
mt19937 eng(seed);

ll random2(){
    return (1ll << 31ll)*eng()+eng();
}

ll n,m,k,q,T;

const ll big = 1000000007;
const ll big2 = 1000000009;
const ll mod =  998244353;

const int MAXN = 200001;

ll DEG[MAXN] = {0};

set<ll> S;
int A[MAXN] = {0};

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);

   // freopen("fhc.txt","r",stdin);
   // freopen("autput.txt","w",stdout);

    ll a,b,c,d,e;

    cin >> n;
    rep(c1,0,n){
        cin >> a;
        a--;
        A[c1] = a;
        b = c1;
        if(a > b)swap(a, b);
        ll h = a*n+b;
        if(S.find(h) == S.end()){
            S.insert(h);
            DEG[a]++;
            DEG[b]++;
        }
    }
    ll ans = (n * (n-1) * (n-2)) / 6 - sz(S) * (n-2);
    rep(c1,0,n){
        ans += (DEG[c1] * (DEG[c1]-1)) / 2;
    }
    ll tri = 0;
    rep(c1,0,n){
        if(A[A[A[c1]]] == c1)tri++;
    }
    ans -= tri/3;
    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: ACCEPTED

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

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)