| Task: | Witch game |
| Sender: | zscoder |
| Submission time: | 2017-01-21 09:32:50 +0200 |
| Language: | C++ |
| Status: | READY |
| Result: | 23 |
| group | verdict | score |
|---|---|---|
| #1 | ACCEPTED | 23 |
| #2 | RUNTIME ERROR | 0 |
| #3 | RUNTIME ERROR | 0 |
| test | verdict | time | group | |
|---|---|---|---|---|
| #1 | ACCEPTED | 0.04 s | 1 | details |
| #2 | ACCEPTED | 0.06 s | 1 | details |
| #3 | ACCEPTED | 0.04 s | 1 | details |
| #4 | ACCEPTED | 0.04 s | 1 | details |
| #5 | ACCEPTED | 0.03 s | 1 | details |
| #6 | RUNTIME ERROR | 0.17 s | 2 | details |
| #7 | RUNTIME ERROR | 0.20 s | 2 | details |
| #8 | RUNTIME ERROR | 0.21 s | 2 | details |
| #9 | RUNTIME ERROR | 0.19 s | 2 | details |
| #10 | RUNTIME ERROR | 0.18 s | 2 | details |
| #11 | RUNTIME ERROR | 0.18 s | 3 | details |
| #12 | RUNTIME ERROR | 0.17 s | 3 | details |
| #13 | RUNTIME ERROR | 0.18 s | 3 | details |
| #14 | RUNTIME ERROR | 0.22 s | 3 | details |
| #15 | RUNTIME ERROR | 0.17 s | 3 | details |
Code
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define fbo find_by_order
#define ook order_of_key
typedef long long ll;
typedef pair<ll,ll> ii;
typedef vector<int> vi;
typedef long double ld;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> pbds;
typedef set<int>::iterator sit;
typedef map<int,int>::iterator mit;
typedef vector<int>::iterator vit;
bool d[1001][1001];
int a[1001];
int main()
{
ios_base::sync_with_stdio(0); cin.tie(0);
ll n; cin>>n;
for(int i = 0; i < n; i++)
{
cin>>a[i]; a[i]--;
d[i][a[i]]=d[a[i]][i]=1;
}
ll ans = (n*(n-1)*(n-2))/6;
for(int i = 0; i < n; i++)
{
for(int j = i + 1; j < n; j++)
{
if(d[i][j]) ans-=(n-2);
}
}
for(int i = 0; i < n; i++)
{
for(int j = 0; j < n; j++)
{
for(int k = i + 1; k < n; k++)
{
if(d[i][j]&&d[j][k])
{
ans++;
}
}
}
}
for(int i = 0; i < n; i++)
{
for(int j = i + 1; j < n; j++)
{
for(int k = j + 1; k < n; k++)
{
if(d[i][j]&&d[i][k]&&d[j][k]) ans--;
}
}
}
cout<<ans;
}
Test details
Test 1
Group: 1
Verdict: ACCEPTED
| input |
|---|
| 100 2 1 4 3 6 5 8 7 10 9 12 11 14 ... |
| correct output |
|---|
| 156800 |
| user output |
|---|
| 156800 |
Test 2
Group: 1
Verdict: ACCEPTED
| input |
|---|
| 100 2 3 4 5 6 7 8 9 10 11 12 13 14... |
| correct output |
|---|
| 152000 |
| user output |
|---|
| 152000 |
Test 3
Group: 1
Verdict: ACCEPTED
| input |
|---|
| 100 2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
| correct output |
|---|
| 156849 |
| user output |
|---|
| 156849 |
Test 4
Group: 1
Verdict: ACCEPTED
| input |
|---|
| 100 2 3 1 5 6 4 8 9 7 11 12 10 14 ... |
| correct output |
|---|
| 151968 |
| user output |
|---|
| 151968 |
Test 5
Group: 1
Verdict: ACCEPTED
| input |
|---|
| 100 8 98 100 62 42 36 95 70 22 49 ... |
| correct output |
|---|
| 152040 |
| user output |
|---|
| 152040 |
Test 6
Group: 2
Verdict: RUNTIME ERROR
| input |
|---|
| 5000 2 1 4 3 6 5 8 7 10 9 12 11 14 ... |
| correct output |
|---|
| 20808340000 |
| user output |
|---|
| (empty) |
Test 7
Group: 2
Verdict: RUNTIME ERROR
| input |
|---|
| 5000 2 3 4 5 6 7 8 9 10 11 12 13 14... |
| correct output |
|---|
| 20795850000 |
| user output |
|---|
| (empty) |
Test 8
Group: 2
Verdict: RUNTIME ERROR
| input |
|---|
| 5000 2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
| correct output |
|---|
| 20808342499 |
| user output |
|---|
| (empty) |
Test 9
Group: 2
Verdict: RUNTIME ERROR
| input |
|---|
| 5000 2 3 1 5 6 4 8 9 7 11 12 10 14 ... |
| correct output |
|---|
| 20795848337 |
| user output |
|---|
| (empty) |
Test 10
Group: 2
Verdict: RUNTIME ERROR
| input |
|---|
| 5000 283 2880 2565 3289 4160 936 39... |
| correct output |
|---|
| 20795852465 |
| user output |
|---|
| (empty) |
Test 11
Group: 3
Verdict: RUNTIME ERROR
| input |
|---|
| 100000 2 1 4 3 6 5 8 7 10 9 12 11 14 ... |
| correct output |
|---|
| 166656666800000 |
| user output |
|---|
| (empty) |
Test 12
Group: 3
Verdict: RUNTIME ERROR
| input |
|---|
| 100000 2 3 4 5 6 7 8 9 10 11 12 13 14... |
| correct output |
|---|
| 166651667000000 |
| user output |
|---|
| (empty) |
Test 13
Group: 3
Verdict: RUNTIME ERROR
| input |
|---|
| 100000 2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
| correct output |
|---|
| 166656666849999 |
| user output |
|---|
| (empty) |
Test 14
Group: 3
Verdict: RUNTIME ERROR
| input |
|---|
| 100000 2 3 1 5 6 4 8 9 7 11 12 10 14 ... |
| correct output |
|---|
| 166651666966668 |
| user output |
|---|
| (empty) |
Test 15
Group: 3
Verdict: RUNTIME ERROR
| input |
|---|
| 100000 186 62491 95379 37431 88427 93... |
| correct output |
|---|
| 166651667250100 |
| user output |
|---|
| (empty) |