C - Snuke Festival(双指针)

C - Snuke Festival (atcoder.jp)

给定n个a,b,c,找到满足ai <bj < ck 的组合的数量， 

#include <iostream>
#include <vector>
#include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>
#include <queue>
#include <set>
#include <map>
#include <stack>
#include <algorithm>
#define x first
#define y second
#define pb emplace_back
#define fu(i,a,b) for(int i=a;i<=b; ++ i)
#define fd(i,a,b) for(int i=a;i>=b;	-- i)
#define endl '\n'
#define ms(x,y) memset(x,y,sizeof x)
#define ios ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
using namespace std;

typedef long long LL;
typedef long double LD;
typedef unsigned long long ULL;
typedef vector<vector<LL>> VVL;
typedef vector<vector<int>> VVI;
typedef vector<LL> VL;
typedef vector<bool> VB;
typedef vector<int> VI;
typedef vector<string> VS;
typedef pair<int,int> PII;
typedef vector<PII> VPII;
typedef pair<PII,int> PIII;
typedef pair<double,double> PDD;
typedef pair<double,int> PDI;
typedef pair<char,int> PCI;
typedef pair<string,int> PSI;
typedef pair<int,string> PIS;
typedef pair<int,char> PIC;
typedef pair<LL,LL> PLL;
typedef __int128 i128;
typedef unsigned long long ULL;
const int N =1e5+  10 ,M = N *5,INF = 0x3f3f3f3f,P = 131;
const double eps = 1e-8,DNF = 1e18;
const int mod = 998244353 ,base= 20010;
const LL LNF=(LL) INF * INF;

int a[N],b[N],c[N];

void solve()
{
	int n;cin >> n ;
	fu(i,1,n) cin >> a[i];
	fu(i,1,n) cin >> b[i];
	fu(i,1,n) cin >> c[i];

	sort(a+  1, a + n +  1 );
	sort(b +  1, b + n +  1 );
	sort(c +  1, c + n +  1 );
	
	LL ans =0 ;
	for(int i=1,j=1,k=1;j <= n; j++ )
	{
		while(a[i] < b[j] && i <= n ) i ++ ;// a[i] >= b[j] 
		while(c[k] <= b[j] && k <= n ) k ++ ;// c[k] > b[j] 
		ans += 1ll * (i-1) * (n-k + 1 );
	}
	cout <<ans << endl;
		
}


signed main()
{
//  freopen("1.txt","r",stdin);
//	#define int long long 
//	init(N-1);
    ios
//	cout << fixed<<setprecision(2);
    int t=1;
//   	cin>>t;
    int now = 1;
    while(t -- )
    {
//     cout<<"Case "; 
//      cout<<"Case #"; 
//      cout<<"Scenario #"; 
//     cout<< now ++ <<": ";
//      cout<< now ++ <<": \n";
		solve();
    }


    return 0;
}