Submission #261827

#TimeUsernameProblemLanguageResultExecution timeMemory
261827FidiskCount Squares (CEOI19_countsquares)C++14
100 / 100
2609 ms141040 KiB
#include <bits/stdc++.h> using namespace std; #define oo 1e9 #define fi first #define se second #define sp(iiii) setprecision(iiii) #define IO ios_base::sync_with_stdio(false); cin.tie(0) #define ms(aaaa,xxxx) memset(aaaa,xxxx,sizeof(aaaa)) #define cntbit(xxxx) __builtin_popcount(xxxx) #define getbit(xxxx,aaaa) ((xxxx>>(aaaa-1))&1) #define _cos(xxxx) cos(xxxx*acos(-1)/180) #define _sin(xxxx) sin(xxxx*acos(-1)/180) #define _tan(xxxx) tan(xxxx*acos(-1)/180) #define PE cout<<fixed typedef long double ld; typedef long long ll; typedef unsigned long long ull; typedef pair<int,int> pii; typedef pair<pair<int,int>,int> piii; typedef pair<long long,long long> pll; typedef pair<pair<long long,long long>,long long> plll; const ld pi=acos(-1); ll n,m,a[5009],b[5009],i,j,res; map<ll,ll> sl; int main(){ IO; cin>>n>>m; for (i=1;i<=n;i++) { cin>>a[i]; } for (i=1;i<=m;i++) { cin>>b[i]; } for (i=1;i<=n;i++) { for (j=i+1;j<=n;j++) { sl[a[j]-a[i]]++; } } for (i=1;i<=m;i++) { for (j=i+1;j<=m;j++) { res+=sl[b[j]-b[i]]; } } cout<<res<<'\n'; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...