fork download
copy 
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. #define int              long long int
  4. #define double           long double
  5. #define print(a)         for(auto x : a) cout << x << " "; cout << endl
  6.  
  7.  
  8. const int M = 1000000007;
  9. const int N = 3e5+9;
  10. const int INF = 2e9+1;
  11. const int LINF = 2000000000000000001;
  12.  
  13. inline int power(int a, int b, int mod=M) {
  14.     int x = 1;
  15.     a %= mod;
  16.     while (b) {
  17.         if (b & 1) x = (x * a) % mod; 
  18.         a = (a * a) % mod;
  19.         b >>= 1;
  20.     }
  21.     return x;
  22. }
  23.  
  24.  
  25. //_ ***************************** START Below *******************************
  26.  
  27.  
  28.  
  29.  
  30. vector<int> a;
  31. vector<int> b;
  32.  
  33. int consistency(int n){
  34.  
  35.     map<int,int> mp;
  36.     for(int i=0; i<n; i++){
  37.         mp[a[i]] = b[i];
  38.     }
  39.  
  40.     vector<int> p, q;
  41.     for(auto& t : mp){
  42.         p.push_back(t.first);
  43.         q.push_back(t.second);
  44.     }
  45.  
  46.  
  47.     vector<int> sufixMaxi(n+1, -INF);
  48.     for(int i=n-1; i>=0; i--){
  49.         sufixMaxi[i] = max(sufixMaxi[i+1], q[i]);
  50.     }
  51.  
  52.     int ct = 0;
  53.     for(int i=0; i<n; i++){
  54.         auto j = upper_bound(begin(p), end(p), a[i]) - begin(p);
  55.  
  56.         if(j!=n && b[i] < sufixMaxi[j]){
  57.             ct++;
  58.         }
  59.     }
  60.  
  61.     return n-ct;
  62.  
  63. }
  64.  
  65.  
  66.  
  67.  
  68.  
  69.  
  70.  
  71.  
  72.  
  73.  
  74.  
  75.  
  76.  
  77.  
  78.  
  79. int practice(int n){
  80.  
  81.  
  82.     return 0;
  83. }
  84.  
  85.  
  86.  
  87.  
  88.  
  89. void solve() {
  90.  
  91.     int n;
  92.     cin>> n;
  93.  
  94.     a.resize(n);
  95.     b.resize(n);
  96.     for(int i=0; i<n; i++) cin >> a[i];
  97.     for(int i=0; i<n; i++) cin >> b[i];
  98.  
  99.     cout << consistency(n) << endl;
  100.  
  101.  
  102. }
  103.  
  104.  
  105.  
  106.  
  107.  
  108. int32_t main() {
  109.     ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  110.  
  111.     int t = 1;
  112.     cin >> t;
  113.     while (t--) {
  114.         solve();
  115.     }
  116.  
  117.     return 0;
  118. }
Success #stdin #stdout 0.01s 5288KB
comments (?)
stdin
copy 
2
3
1 3 5
2 3 1
6
1 2 3 6 5 4
3 2 1 4 5 6
stdout
copy 
2
3
https://ideone.com/ELxxHi
language:
C++14 (gcc 8.3)
created:
2 days ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!