제출 #282748

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
282748		infinite_iq	Count Squares (CEOI19_countsquares)	C++14	100 / 100	2403 ms	141008 KiB

countsquares

#define fast ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#include <bits/stdc++.h>
using namespace std;
#define sqr 340
#define mp make_pair
#define mid (l+r)/2
#define le node * 2 
#define ri node * 2 + 1 
#define pb push_back
#define ppb pop_back
#define fi first
#define se second
#define lb lower_bound
#define ub upper_bound
#define ins insert
#define era erase
#define C continue
#define mem(dp,i) memset(dp,i,sizeof(dp))
#define mset multiset
#define all(x) x.begin(), x.end()
#define gc getchar_unlocked
typedef long long ll;
typedef short int si;
typedef long double ld;
typedef pair<int,int> pi;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pi> vpi;
typedef vector<pll> vpll;
typedef pair<double,ll>pdi;
const ll inf=1e18;
const ll mod=998244353;
const ld Pi=acos(-1) ;
ll n , m , ans ;
ll a [1509] , b [1509] ;
map < ll , ll > num ;  
int main () {
        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 < n ; i ++ ) {
                for ( int j = 0 ; j < i ; j ++ ) {
                        num [a[i]-a[j]] ++ ;
                }
        }
        for ( int i = 0 ; i < m ; i ++ ) {
                for ( int j = 0 ; j < i ; j ++ ) {
                        ans += num [b[i]-b[j]] ;
                }
        }
        cout << ans << endl ;
}

• Subtask 1: 7 / 7
• Subtask 2: 40 / 40
• Subtask 3: 53 / 53