2019牛客国庆集训派对day6 H-Super Fast Fourier Transform(思维)-CSDN博客

本文链接：https://blog.csdn.net/weixin_43892298/article/details/105733061

题目大意

分析

因为a1 + s2 + ... + an <= 1e6 并且 n <= 1e5，可以看出应该有很多重读的数，统计一下，暴力解决。

AC代码


#include <map>
#include <set>
#include <ctime>
#include <cmath>
#include <queue>
#include <stack>
#include <bitset>
#include <cctype>
#include <cstdio>
#include <vector>
#include <utility>
#include <cstdlib>
#include <cstring>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <unordered_map>
#define eps 1e-8
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;
const int N = 1e5 + 5;
const int INF = 0x3f3f3f3f;
const ll ll_max = 4557430888798830399;

unordered_map<int, int> ma;
unordered_map<int, int> mb;
int a[N], b[N];

int main(){
    ios::sync_with_stdio(false);
//    cin.tie(nullptr);
    int n, m, x;
    while(cin >> n >> m){
        int c1 = 0, c2 = 0;
        ma.clear();
        mb.clear();
        while(n--){
            cin >> x;
            if (ma[x] == 0) {
                a[c1++] = x;
                ma[x] = 1;
            }
            else
                ma[x]++;
        }
        while(m--){
            cin >> x;
            if (mb[x] == 0){
                b[c2++] = x;
                mb[x]++;
            }
            else
                mb[x]++;
        }
        ll ans = 0;
        for (int i = 0; i < c1; ++i){
            for (int j = 0; j < c2; ++j){
                ans += ll(ma[a[i]]) * ll(mb[b[j]]) * ll(sqrt(fabs(a[i] - b[j])));
            }
        }
        cout << ans << "\n";
        
    }

    return 0;
}