oj.uz

Submission #524193

# Submission time Handle Problem Language Result Execution time Memory
524193 2022-02-08T18:37:58 Z ammar2000 Count Squares (CEOI19_countsquares) C++17
100 / 100
 1900 ms 140972 KB 
#include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define F first
#define S second
#define coy cout<<"YES\n"
#define con cout<<"NO\n"
#define co1 cout<<"-1\n"
#define sc(x) scanf("%lld",&x)
#define all(x) x.begin(),x.end()
#define fast ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
using namespace std;
const int SI=3e5+7;
ll INF=8e18+7;
int dx[] = {1 , -1 , 0 , 0};
int dy[] = {0 , 0 , 1 , -1};
int MOD=1e9+7;
ll n,m,a[SI],b[SI];
map  <ll,ll> mp;
int main()
{
   fast
   cin>>n>>m;
   for (int i=0;i<n;i++)
    cin>>a[i];
   for (int i=0;i<m;i++)
    cin>>b[i];
   for (int i=0;i<m;i++)
    for (int u=i+1;u<m;u++)
       mp[b[u]-b[i]]++;
   ll ans=0;
   for (int i=0;i<n;i++)
    for (int u=i+1;u<n;u++)
       ans+=mp[a[u]-a[i]];
   cout << ans<<"\n";
   // use scanf not cin
   return 0;
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 0 ms 204 KB Output is correct

Subtask #2
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 150 ms 22788 KB Output is correct
7 Correct 146 ms 22856 KB Output is correct
8 Correct 151 ms 22704 KB Output is correct
9 Correct 145 ms 22084 KB Output is correct
10 Correct 12 ms 716 KB Output is correct

Subtask #3
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 150 ms 22788 KB Output is correct
7 Correct 146 ms 22856 KB Output is correct
8 Correct 151 ms 22704 KB Output is correct
9 Correct 145 ms 22084 KB Output is correct
10 Correct 12 ms 716 KB Output is correct
11 Correct 1900 ms 140972 KB Output is correct
12 Correct 1884 ms 140844 KB Output is correct
13 Correct 1831 ms 140832 KB Output is correct
14 Correct 1830 ms 139076 KB Output is correct
15 Correct 86 ms 1376 KB Output is correct