CSES - Datatähti Open 2017

CSES - Datatähti Open 2017 - Results

Submission details
Task:	Witch game
Sender:	abcdef6199
Submission time:	2017-01-22 10:21:46 +0200
Language:	C++
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.05 s	1	details
#2	ACCEPTED	0.04 s	1	details
#3	ACCEPTED	0.05 s	1	details
#4	ACCEPTED	0.05 s	1	details
#5	ACCEPTED	0.04 s	1	details
#6	ACCEPTED	0.05 s	2	details
#7	ACCEPTED	0.05 s	2	details
#8	ACCEPTED	0.04 s	2	details
#9	ACCEPTED	0.05 s	2	details
#10	ACCEPTED	0.05 s	2	details
#11	ACCEPTED	0.18 s	3	details
#12	ACCEPTED	0.18 s	3	details
#13	ACCEPTED	0.20 s	3	details
#14	ACCEPTED	0.18 s	3	details
#15	ACCEPTED	0.34 s	3	details

Compiler report

input/code.cpp: In function 'int main()':
input/code.cpp:49:20: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &n);
                    ^
input/code.cpp:50:52: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for (int i = 1; i <= n; ++i) scanf("%d", &a[i]);
                                                    ^

Code

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

typedef long long LL;
typedef pair<int, int> II;

const int N = (int) 1e5 + 10;
int n, a[N];
vector<int> adj[N];

#define m ((l + r) >> 1)
struct SegmentTree {
    struct Node {
        int cnt, val;
        Node() {};
        Node(int cnt, int val): cnt(cnt), val(val) {};
    } ST[N * 5];
    void Build(int k, int l, int r) {
        if (l == r) return ST[k] = Node(1, 1), void(0);
        Build(k << 1, l, m);
        Build(k << 1 | 1, m + 1, r);
        ST[k].val = ST[k << 1].val + ST[k << 1 | 1].val;
    }
    void Update(int k, int l, int r, int i, int v) {
        if (l == r) {
            ST[k].cnt += v;
            if (ST[k].cnt <= 0) ST[k].val = 0;
            else ST[k].val = 1;
            return;
        }
        if (i <= m) Update(k << 1, l, m, i, v);
        else Update(k << 1 | 1, m + 1, r, i, v);
        ST[k].val = ST[k << 1].val + ST[k << 1 | 1].val;
    }
    int Query(int k, int l, int r, int i, int j) {
        if (l > j || r < i) return 0;
        if (i <= l && r <= j) return ST[k].val;
        return Query(k << 1, l, m, i, j) + Query(k << 1 | 1, m + 1, r, i, j);
    }
} ST;
#undef m

int main() {
    #ifdef LOCAL
        freopen("Data.inp", "r", stdin);
        freopen("Data.out", "w", stdout);
    #endif

    scanf("%d", &n);
    for (int i = 1; i <= n; ++i) scanf("%d", &a[i]);
    for (int i = 1; i <= n; ++i) adj[a[i]].push_back(i);

    LL ans = 0; ST.Build(1, 1, n);
    for (int x = 1; x <= n; ++x) {
        int y = a[x]; if (y < x || a[y] != x) continue;
        for (int i = 0; i < (int) adj[x].size(); ++i) ST.Update(1, 1, n, adj[x][i], -1);
        for (int i = 0; i < (int) adj[y].size(); ++i) ST.Update(1, 1, n, adj[y][i], -1);
        if (x + 1 <= y - 1) ans += ST.Query(1, 1, n, x + 1, y - 1);
        for (int i = 0; i < (int) adj[x].size(); ++i) ST.Update(1, 1, n, adj[x][i], 1);
        for (int i = 0; i < (int) adj[y].size(); ++i) ST.Update(1, 1, n, adj[y][i], 1);
    }

    for (int y = 1; y <= n; ++y) {
        ST.Update(1, 1, n, a[y], -1);
        for (int i = 0; i < (int) adj[y].size(); ++i) ST.Update(1, 1, n, adj[y][i], -1);
        for (int t = 0; t < (int) adj[y].size(); ++t) {
            int x = adj[y][t]; if (x + 1 > y - 1) continue;
            for (int i = 0; i < (int) adj[x].size(); ++i) ST.Update(1, 1, n, adj[x][i], -1);
            ans -= ST.Query(1, 1, n, x + 1, y - 1);
            for (int i = 0; i < (int) adj[x].size(); ++i) ST.Update(1, 1, n, adj[x][i], 1);
        }
        ST.Update(1, 1, n, a[y], 1);
        for (int i = 0; i < (int) adj[y].size(); ++i) ST.Update(1, 1, n, adj[y][i], 1);
    }

    for (int x = 1; x <= n; ++x) {
        ST.Update(1, 1, n, a[x], -1);
        for (int i = 0; i < (int) adj[x].size(); ++i) ST.Update(1, 1, n, adj[x][i], -1);
        for (int t = 0; t < (int) adj[x].size(); ++t) {
            int y = adj[x][t]; if (x + 1 > y - 1) continue;
            for (int i = 0; i < (int) adj[y].size(); ++i) ST.Update(1, 1, n, adj[y][i], -1);
            ans -= ST.Query(1, 1, n, x + 1, y - 1);
            for (int i = 0; i < (int) adj[y].size(); ++i) ST.Update(1, 1, n, adj[y][i], 1);
        }
        ST.Update(1, 1, n, a[x], 1);
        for (int i = 0; i < (int) adj[x].size(); ++i) ST.Update(1, 1, n, adj[x][i], 1);
    }

    for (int z = 1; z <= n; ++z) {
        ST.Update(1, 1, n, a[z], -1);
        for (int i = 0; i < (int) adj[z].size(); ++i) ST.Update(1, 1, n, adj[z][i], -1);
        int c1 = (z > 1) ? ST.Query(1, 1, n, 1, z - 1) : 0;
        int c2 = (z < n) ? ST.Query(1, 1, n, z + 1, n) : 0;
        ans += (LL) c1 * c2;
        ST.Update(1, 1, n, a[z], 1);
        for (int i = 0; i < (int) adj[z].size(); ++i) ST.Update(1, 1, n, adj[z][i], 1);
    }

    cout << ans;
    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 (abcdef6199)