Submission #3815770

---

Source Code Expand

#include <iostream>
#include <string>
#include<algorithm>
#include <vector>
#include<stack>
#include<queue>
#include<list>
#include<set>
#include<map>
#include<numeric>
#include<regex>
using namespace std;

typedef long long ll;
#define modulo 1000000007 // 10^9 + 7
#define MAX 1000000000 // 10^9

int main() {
	int N; cin >> N;
	int A[N+1], B[N+1], C[N+1];
	for (int i = 0; i < N; i++) cin >> A[i];
	for (int i = 0; i < N; i++) cin >> B[i];
	for (int i = 0; i < N; i++) cin >> C[i];

	sort(A, A + N);
	sort(B, B + N);
	sort(C, C + N);
	A[N] = MAX;
	B[N] = MAX;
	
	// B[i] > A[j] を満たすjの数
	int D[N];
	int j = 0;
	for (int i = 0; i < N; i++) {
		while (B[i] > A[j]) j++;
		D[i] = j;
	}


	/*
	cout << " D[i] = ";
	for(int k = 0; k < N; k++) {
		cout << D[k] << " ";
	}
	cout << endl << " E[i] = ";
	*/


	j = 0;
	int E[N];
	E[0] = 0;
	for (int i = 0; i < N; i++) {
		while (C[i] > B[j]) {
			E[i] += D[j];
			j++;
		}
		
		E[i + 1] = E[i];
		
		
		// cout << E[i] << " ";


	}

	// cout << endl;

	int ans = 0;
	for (int i = 0; i < N; i++) {
		ans += E[i];
	}
	
	cout << ans << endl;


	return 0;
}

Submission Info

Judge Result