Noitapeli

#include <iostream>
#include <set>
#include <vector>
#include <algorithm>

using namespace std;
typedef pair<int, pair<int, int>> iii;
#define MP make_pair
#define PB push_back

int n;
int s[100005];
set<iii> st;

bool ok(int a, int b, int c) {
    if (s[a] == b || s[a] == c || s[b] == a || s[b] == c || s[c] == a || s[c] == b) return false;
    vector<int> v;
    v.PB(a);
    v.PB(b);
    v.PB(c);
    sort(v.begin(), v.end());
    iii cp = MP(v[0], MP(v[1], v[2]));  
    st.insert(cp);
    return true;
}

int main() {
    cin >> n;
    for (int i = 1; i <= n; ++i) cin >> s[i];
    for (int i = 1; i <= n; ++i) {
        for (int j = 1; j <= n; ++j) {
            for (int k = 1; k <= n; ++k) {
                if (i == j || i == k || k == j) continue;
                ok(i, j, k);
            }
        }
    }
    cout << st.size() << "\n";
    return 0;
}

Test 1

Group: 1

Verdict: ACCEPTED

Test 2

Group: 1

Verdict: ACCEPTED

Test 3

Group: 1

Verdict: ACCEPTED

Test 4

Group: 1

Verdict: ACCEPTED

Test 5

Group: 1

Verdict: ACCEPTED

Test 6

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 7

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 8

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 9

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 10

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 11

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 12

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 13

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 14

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 15

Group: 3

Verdict: TIME LIMIT EXCEEDED