Submission #2976792
Source Code Expand
#include <map> #include <set> #include <list> #include <cmath> #include <queue> #include <stack> #include <cstdio> #include <string> #include <vector> #include <complex> #include <cstdlib> #include <cstring> #include <numeric> #include <sstream> #include <iostream> #include <algorithm> #include <functional> #define mp make_pair #define pb push_back #define all(x) (x).begin(),(x).end() #define rep(i,n) for(int i=0;i<(n);i++) using namespace std; typedef long long ll; typedef unsigned long long ull; typedef vector<bool> vb; typedef vector<int> vi; typedef vector<vb> vvb; typedef vector<vi> vvi; typedef pair<int,int> pii; const int INF=1<<29; const double EPS=1e-9; const int dx[]={1,0,-1,0,1,1,-1,-1},dy[]={0,-1,0,1,1,-1,-1,1}; int main() { int N; cin >> N; vector<ll> A(N), B(N), C(N); 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(all(A)); sort(all(B)); sort(all(C)); ll ans = 0; for (int i = 0; i < N; i++) { ll b = B[i]; ll k1 = lower_bound(all(A), b) - A.begin() - 1; ll k2 = lower_bound(all(C), b + 1) - C.begin(); if (k1 < 0 || k2 >= N) continue; ans += (k1 + 1) * (N - k2); } cout << ans << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Snuke Festival |
User | kakira |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 1448 Byte |
Status | AC |
Exec Time | 145 ms |
Memory | 2560 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 300 / 300 | ||||
Status |
|
|
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 | AC | 144 ms | 2560 KB |
02.txt | AC | 144 ms | 2560 KB |
03.txt | AC | 118 ms | 2560 KB |
04.txt | AC | 118 ms | 2560 KB |
05.txt | AC | 82 ms | 2560 KB |
06.txt | AC | 82 ms | 2560 KB |
07.txt | AC | 71 ms | 2560 KB |
08.txt | AC | 71 ms | 2560 KB |
09.txt | AC | 60 ms | 2560 KB |
10.txt | AC | 60 ms | 2560 KB |
11.txt | AC | 57 ms | 2560 KB |
12.txt | AC | 56 ms | 2560 KB |
13.txt | AC | 140 ms | 2560 KB |
14.txt | AC | 140 ms | 2560 KB |
15.txt | AC | 139 ms | 2560 KB |
16.txt | AC | 141 ms | 2560 KB |
17.txt | AC | 141 ms | 2560 KB |
18.txt | AC | 140 ms | 2560 KB |
19.txt | AC | 145 ms | 2560 KB |
20.txt | AC | 55 ms | 2560 KB |
21.txt | AC | 55 ms | 2560 KB |
22.txt | AC | 135 ms | 2560 KB |
23.txt | AC | 138 ms | 2560 KB |
24.txt | AC | 139 ms | 2560 KB |
25.txt | AC | 141 ms | 2560 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 |