CSES - Datatähti Open 2017

CSES - Datatähti Open 2017 - Results

Submission details
Task:	Witch game
Sender:	egor.lifar
Submission time:	2017-01-21 22:18:50 +0200
Language:	C++
Status:	READY
Result:	0

Feedback
group	verdict	score
#1	WRONG ANSWER	0
#2	WRONG ANSWER	0
#3	TIME LIMIT EXCEEDED	0

Test results
test	verdict	time	group
#1	ACCEPTED	0.04 s	1	details
#2	ACCEPTED	0.05 s	1	details
#3	ACCEPTED	0.05 s	1	details
#4	ACCEPTED	0.04 s	1	details
#5	WRONG ANSWER	0.03 s	1	details
#6	ACCEPTED	0.17 s	2	details
#7	ACCEPTED	0.18 s	2	details
#8	ACCEPTED	0.09 s	2	details
#9	ACCEPTED	0.19 s	2	details
#10	WRONG ANSWER	0.28 s	2	details
#11	TIME LIMIT EXCEEDED	--	3	details
#12	TIME LIMIT EXCEEDED	--	3	details
#13	TIME LIMIT EXCEEDED	--	3	details
#14	TIME LIMIT EXCEEDED	--	3	details
#15	TIME LIMIT EXCEEDED	--	3	details

Code

#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <numeric>
#include <cstring>
#include <ctime>
#include <cstdlib>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <cmath>
#include <bitset>
#include <cassert>
#include <queue>
#include <stack>
#include <deque>
#include <cassert>
 
  
  
using namespace std;
  
  
template<typename T1, typename T2>inline void chkmin(T1 &x, T2 y) { if (x > y) x = y; }
template<typename T1, typename T2>inline void chkmax(T1 &x, T2 y) { if (x < y) x = y; }
/** Interface */
  
inline int readChar();
template <class T = int> inline T readInt(); 
template <class T> inline void writeInt( T x, char end = 0 );
inline void writeChar( int x ); 
inline void writeWord( const char *s );
  
/** Read */
  
static const int buf_size = 4096;
  
inline int getChar() {
    static char buf[buf_size];
    static int len = 0, pos = 0;
    if (pos == len)
        pos = 0, len = fread(buf, 1, buf_size, stdin);
    if (pos == len)
        return -1;
    return buf[pos++];
}
  
inline int readChar() {
    int c = getChar();
    while (c <= 32)
        c = getChar();
    return c;
}
  
template <class T>
inline T readInt() {
    int s = 1, c = readChar();
    T x = 0;
    if (c == '-')
        s = -1, c = getChar();
    while ('0' <= c && c <= '9')
        x = x * 10 + c - '0', c = getChar();
    return s == 1 ? x : -x;
}
  
/** Write */
  
static int write_pos = 0;
static char write_buf[buf_size];
  
inline void writeChar( int x ) {
    if (write_pos == buf_size)
        fwrite(write_buf, 1, buf_size, stdout), write_pos = 0;
    write_buf[write_pos++] = x;
}
  
template <class T> 
inline void writeInt( T x, char end ) {
    if (x < 0)
        writeChar('-'), x = -x;
  
    char s[24];
    int n = 0;
    while (x || !n)
        s[n++] = '0' + x % 10, x /= 10;
    while (n--)
        writeChar(s[n]);
    if (end)
        writeChar(end);
}
  
inline void writeWord( const char *s ) {
    while (*s)
        writeChar(*s++);
}
  
struct Flusher {
    ~Flusher() {
        if (write_pos)
            fwrite(write_buf, 1, write_pos, stdout), write_pos = 0;
    }
} flusher;
  

#define prev prev228
#define left left228
#define right right228  
#define sz(c) (int)(c).size()
#define all(c) (c).begin(), (c).end()
const int MAXN = 100001;


int n;
int x[MAXN];
vector<int> v[MAXN];


int main() {
    n = readInt();
    for (int i = 0; i < n; i++) {
        x[i] = readInt();
        x[i]--;
        if (x[i] == i) {
            cout << 0 << endl;
            return 0;
        }
        v[x[i]].push_back(i);
    }
    long long ans = 0;
    for (int i = 0; i < n; i++) {
        for (int j = i + 1; j < n; j++) {
            if (x[i] != j && x[j] != i) {
                int cnts = n - j - 1;
                cnts -= v[i].end() - lower_bound(all(v[i]), j + 1);
                cnts -= v[j].end() - lower_bound(all(v[j]), j + 1);
                if (x[i] > j && x[x[i]] != i && x[x[i]] != j) {
                    cnts--;
                }
                if (x[j] > j && x[x[j]] != i && x[x[j]] != j) {
                    cnts--;
                }
                ans += cnts;
            }
        }
    }
    cout << ans << endl;
    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: WRONG ANSWER

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

correct output
`152040` view save

user output
`152029` 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: WRONG ANSWER

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

correct output
`20795852465` view save

user output
`20795851676` view save

Test 11

Group: 3

Verdict: TIME LIMIT EXCEEDED

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

correct output
`166656666800000` view save

user output
(empty)

Test 12

Group: 3

Verdict: TIME LIMIT EXCEEDED

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

correct output
`166651667000000` view save

user output
(empty)

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: TIME LIMIT EXCEEDED

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

correct output
`166651666966668` view save

user output
(empty)

Test 15

Group: 3

Verdict: TIME LIMIT EXCEEDED

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

correct output
`166651667250100` view save

user output
(empty)

Datatähti Open 2017

Witch game

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 (egor.lifar)