Submission #1119517

#TimeUsernameProblemLanguageResultExecution timeMemory
1119517vjudge1Count Squares (CEOI19_countsquares)C++17
100 / 100
1910 ms141140 KiB
// made by Tima // 2025 will be a golden year... #include "bits/stdc++.h" #include <ext/pb_ds/assoc_container.hpp> #define ll long long #define pb push_back #define pf push_front #define ppb pop_back #define ppf pop_front #define int long long #define F first #define S second #define all(x) (x).begin(), (x).end() #define pii pair<int,int> #define tpii pair <pair <int,int> , int> #define bruh cout << "NO\n" using namespace std; using namespace __gnu_pbds; const int N = 3e5 + 5; int mod = 1e9 + 7; const int INF = 1e18; int n,m,a[N],b[N]; void Gold(){ cin >> n >> m; for(int i = 1 ; i <= n ; i++){ cin >> a[i]; } for(int i = 1 ; i <= m ; i++){ cin >> b[i]; } map <int,int> mp; int ans = 0; for(int i = 1 ; i <= n ; i++){ for(int j = 1 ; j <= m ; j++){ ans += mp[a[i] - b[j]]; mp[a[i] - b[j]]++; } } cout << ans; } //https://codeforces.com/blog/entry/133289 signed main(/*Zhunussov Temirlan*/){ //freopen("txt.in","r",stdin);freopen("txt.out","w",stdout); ios_base::sync_with_stdio(0);cin.tie(0); srand(time(0)); int TT = 1; // cin >> TT; for(int i = 1 ; i <= TT ; i++){ //cout << "Case " << i << ": "; Gold(); } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...