Submission #2180786


Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
typedef long long ll;

const int maxn = 1e5 + 10;
ll n , b[maxn] , freqa[maxn] , freqc[maxn];



int main()
{
	ios_base::sync_with_stdio(0); cin.tie(NULL);
	cin >> n;
	for(int i=0,x;i<n;i++){ cin >> x; freqa[x]++; }
	for(int i=0,x;i<n;i++){ cin >> b[i]; }
	for(int i=0,x;i<n;i++){ cin >> x; freqc[x]++; }
	for(int i=1;i<maxn;i++)
	{
		freqa[i] += freqa[i-1];
		freqc[i] += freqc[i-1];
	}
	ll ans = 0;
	for(int i=0;i<n;i++)
	{
		ans += freqa[b[i] - 1] * (freqc[maxn - 1] - freqc[b[i]]); 
	}
	cout << ans;
}

Submission Info

Submission Time
Task C - Snuke Festival
User bugzzii
Language C++14 (GCC 5.4.1)
Score 0
Code Size 597 Byte
Status RE
Exec Time 99 ms
Memory 2560 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 300
Status
AC × 3
AC × 17
RE × 15
Set Name Test Cases
Sample s1.txt, s2.txt, s3.txt
All 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, 21.txt, 22.txt, 23.txt, 24.txt, 25.txt, 26.txt, 27.txt, 28.txt, 29.txt, s1.txt, s2.txt, s3.txt
Case Name Status Exec Time Memory
01.txt RE 97 ms 256 KB
02.txt RE 98 ms 256 KB
03.txt RE 97 ms 256 KB
04.txt RE 97 ms 256 KB
05.txt AC 22 ms 2560 KB
06.txt AC 22 ms 2560 KB
07.txt AC 20 ms 2560 KB
08.txt AC 20 ms 2560 KB
09.txt AC 19 ms 2560 KB
10.txt AC 19 ms 2560 KB
11.txt AC 19 ms 2560 KB
12.txt AC 18 ms 2560 KB
13.txt RE 97 ms 256 KB
14.txt RE 97 ms 256 KB
15.txt RE 96 ms 256 KB
16.txt RE 97 ms 256 KB
17.txt RE 96 ms 256 KB
18.txt RE 96 ms 256 KB
19.txt RE 97 ms 256 KB
20.txt AC 19 ms 2560 KB
21.txt AC 19 ms 2560 KB
22.txt RE 96 ms 256 KB
23.txt RE 96 ms 256 KB
24.txt RE 99 ms 256 KB
25.txt RE 98 ms 256 KB
26.txt AC 2 ms 1792 KB
27.txt AC 2 ms 1792 KB
28.txt AC 2 ms 1792 KB
29.txt AC 2 ms 1792 KB
s1.txt AC 2 ms 1792 KB
s2.txt AC 2 ms 1792 KB
s3.txt AC 2 ms 1792 KB