# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1119738 | vjudge1 | Count Squares (CEOI19_countsquares) | C++17 | 4032 ms | 336 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define int long long
#define tin long long
#define db double
#define F first
#define S second
#define yes "YES"
#define no "NO"
using namespace std;
int a[100000], N = 2e6 + 5, b[100000];
int mn = INT_MAX, mx = INT_MAX;
void solve(){
int n, m, ans = 0;
cin >> n >> m;
vector <int> v;
multiset <int> s;
for(int i = 1; i <= n ; i++){
cin >> a[i];
}
for(int i = 1 ; i <= m ; i++){
cin >> b[i];
}
for(int i = 1; i <= n ; i ++){
for(int j = i + 1 ; j <= n ; j ++){
v.pb(abs(a[i] - a[j]));
}
}
for(int i = 1; i <= m ; i ++){
for(int j = i + 1 ; j <= m ; j ++){
s.insert(abs(b[i] - b[j]));
}
}
for(int i = 0; i <= v.size() - 1; i ++){
if(s.find(v[i]) != s.end()) ans += s.count(v[i]);
}
cout << ans;
}
signed main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
int t = 1;
//cin >> t;
while(t--){
solve();
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |