【开源社区openEuler实践】G. Milky Days

题目

题解

#include<bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define ld long double
#define pb push_back
#define fi first
#define se second
#define pii pair<int, int>
#define lson p << 1
#define rson p << 1 | 1
const int N = 1e6, maxn = 1e6 + 5, inf = 1e13;
const int base = 137;
const __int128 mod = 212370440130137957LL;
// const int mod = 998244353;

int n, m;
int a[maxn], b[maxn];

void solve(){
    int res = 0;