Submission

Score: 90

User: Nathlol2

Problemset: ลำแสงเลเซอร์สะท้อน

Language: cpp

Time: 0.003 second

Submitted On: 2025-06-07 21:18:08

/*
* Author : NathInwza007
* Created : 07-06-2025 20:53:27 UTC+7
*/

#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define ld long double
#define pii pair<int, int>
#define pll pair<ll, ll>
#define fi first
#define sc second
#define inf (int)2e9
#define INF (ll)1e18
#define MOD (ll)1000000007
//998244353

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;

template <typename T>
using oset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

#define vt vector
#define ar array
#define pb push_back
#define eb emplace_back
#define all(arrname) (arrname).begin(), (arrname).end()
#define rall(arrname) (arrname).rbegin(), (arrname).rend()
#define sz(arrname) (int)(arrname).size()

void solve(){
    int n, m;
    cin >> n >> m;
    vt<int> a(n + 1), b(m + 1);
    a[0] = 0;
    for(int i = 1;i<=n;i++){
        cin >> a[i];
    }
    b[0] = 0;
    for(int i = 1;i<=m;i++){
        cin >> b[i];
    }
    int ans = 0;
    for(int i = 0;i<n;i++){
        for(int j = 0;j<m;j++){
            bool f = (i % 2 == 0);
            bool g = (j % 2 == 0);
            if(f && g){
                if(a[i] == b[j]){
                    ++ans;
                }else if(a[i] < b[j] && a[i + 1] > b[j + 1]){
                    ++ans;
                }else if(b[j] < a[i] && b[j + 1] > a[i + 1]){
                    ++ans;
                }
            }else if(f){
                if(a[i + 1] > b[j] && a[i] < b[j + 1]){
                    ++ans;
                }
            }else if(g){
                if(b[j + 1] > a[i] && b[j] < a[i + 1]){
                    ++ans;
                }
            }else{
                if(a[i] == b[j]){
                    ++ans;
                }else if(a[i] < b[j] && a[i + 1] > b[j + 1]){
                    ++ans;
                }else if(b[j] < a[i] && b[j + 1] > a[i + 1]){
                    ++ans;
                }
            }
        }
    }
    if(n % 2 == m % 2 && a[n] == b[m]){
        ++ans;
    }
    cout << ans << '\n';
}

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    
    int tc = 1;
    //cin >> tc;
    while(tc--){
        solve();
    }
    return 0;
}