Submission #8442139


Source Code Expand

#include "bits/stdc++.h"

#define REP(i,num) for(int i=0;i<(num);++i)
#define ALL(c) c.begin(),c.end()
#define LOOP(i) while(i--)
#define PRINTALL(c) for(auto& x:c){cout<<x<<' ';}cout<<endl;
#define PAIRCOMP(c,comp) [](const pair<ll,ll>& lhs,const pair<ll,ll>& rhs){return lhs.c comp rhs.c;}

using namespace std;
using ll = long long;

constexpr ll atcoder_mod = 1e9+7;

template<typename T=int>
T in(){T x; cin >> x; return (x);}
template<typename T=int,typename C=vector<T>>
C vecin(int N){C x(N);REP(i,N){x[i]=in<T>();}return move(x);}

void vout(){cout << endl;}
template<typename Head,typename... Tail>
void vout(Head&& h,Tail&&... t){cout << ' ' << h;vout(forward<Tail>(t)...);}
void out(){cout << endl;}
template<typename Head,typename... Tail>
void out(Head&& h,Tail&&... t){cout << h;vout(forward<Tail>(t)...);}

int main(){
	cin.tie(0);
	ios::sync_with_stdio(false);
	cout<<fixed<<setprecision(10);

	int N=in();
	auto A=vecin(N);
	auto B=vecin(N);
	auto C=vecin(N);
	sort(ALL(A));
	sort(ALL(B));
	sort(ALL(C));
	
	ll sum=0;
	REP(i,N){
		auto findB = lower_bound(ALL(B),A[i]+1);
		while(findB!=B.end()){
			auto findC = lower_bound(ALL(C),(*findB)+1);
			if(findC!=C.end()){
				sum += distance(findC,C.end());
			}
			++findB;
		}

	}
	out(sum);
	return 0;
}

Submission Info

Submission Time
Task C - Snuke Festival
User zelosace
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1324 Byte
Status TLE
Exec Time 2103 ms
Memory 1536 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 300
Status
AC × 3
AC × 12
TLE × 20
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 TLE 2103 ms 1408 KB
02.txt TLE 2103 ms 1408 KB
03.txt TLE 2103 ms 1408 KB
04.txt TLE 2103 ms 1408 KB
05.txt TLE 2103 ms 1408 KB
06.txt TLE 2103 ms 1408 KB
07.txt TLE 2103 ms 1408 KB
08.txt TLE 2103 ms 1408 KB
09.txt TLE 2103 ms 1408 KB
10.txt TLE 2103 ms 1408 KB
11.txt TLE 2103 ms 1408 KB
12.txt TLE 2103 ms 1408 KB
13.txt TLE 2103 ms 1408 KB
14.txt TLE 2103 ms 1408 KB
15.txt AC 56 ms 1408 KB
16.txt AC 53 ms 1408 KB
17.txt TLE 2103 ms 1536 KB
18.txt AC 53 ms 1408 KB
19.txt TLE 2103 ms 1408 KB
20.txt TLE 2103 ms 1408 KB
21.txt AC 26 ms 1408 KB
22.txt AC 39 ms 1408 KB
23.txt TLE 2103 ms 1408 KB
24.txt TLE 2103 ms 1408 KB
25.txt TLE 2103 ms 1408 KB
26.txt AC 1 ms 256 KB
27.txt AC 1 ms 256 KB
28.txt AC 1 ms 256 KB
29.txt AC 1 ms 256 KB
s1.txt AC 1 ms 256 KB
s2.txt AC 1 ms 256 KB
s3.txt AC 1 ms 256 KB