Submission #1739158


Source Code Expand

Copy
#include <algorithm>
#include <iostream>
#define int long long 
using namespace std;
signed main(){
  int N;
  cin >> N;
  int 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(A,A+N);
  sort(B,B+N);
  sort(C,C+N);
  int t = 0, k = 0;
  int ans = 0;
  for(int i = 0; i < N; ++i){
    int b = B[i];
    while(t < N && A[t] < b) ++t;
    while(k < N && C[k] <= b) ++k;
    //cout << t << " " << k << endl;
    if(A[t-1] < b && b < C[k]){
      ans += (t)*(N-k);
    }else{
      break;
    }
  }
  cout << ans << endl;
  return 0;
}

Submission Info

Submission Time
Task C - Snuke Festival
User TAB
Language C++14 (GCC 5.4.1)
Score 300
Code Size 662 Byte
Status
Exec Time 144 ms
Memory 2560 KB

Test Cases

Set Name Score / Max Score Test Cases
Sample 0 / 0 s1.txt, s2.txt, s3.txt
All 300 / 300 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 137 ms 2560 KB
02.txt 137 ms 2560 KB
03.txt 112 ms 2560 KB
04.txt 112 ms 2560 KB
05.txt 79 ms 2560 KB
06.txt 78 ms 2560 KB
07.txt 66 ms 2560 KB
08.txt 66 ms 2560 KB
09.txt 55 ms 2560 KB
10.txt 55 ms 2560 KB
11.txt 51 ms 2560 KB
12.txt 51 ms 2560 KB
13.txt 136 ms 2560 KB
14.txt 135 ms 2560 KB
15.txt 136 ms 2560 KB
16.txt 136 ms 2560 KB
17.txt 136 ms 2560 KB
18.txt 135 ms 2560 KB
19.txt 136 ms 2560 KB
20.txt 51 ms 2560 KB
21.txt 50 ms 2560 KB
22.txt 130 ms 2560 KB
23.txt 134 ms 2560 KB
24.txt 144 ms 2560 KB
25.txt 134 ms 2560 KB
26.txt 1 ms 256 KB
27.txt 1 ms 256 KB
28.txt 1 ms 256 KB
29.txt 1 ms 256 KB
s1.txt 1 ms 256 KB
s2.txt 1 ms 256 KB
s3.txt 1 ms 256 KB