제출 #976915

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
976915		batsukh2006	Count Squares (CEOI19_countsquares)	C++17	100 / 100	1901 ms	141096 KiB

countsquares

#include<iostream>
#include<stdio.h>
#include<math.h>
#include<map>
#include<string>
#include<algorithm>
#include<vector>
#include<string.h>
#include<utility>
#include<set>
#include<cmath>
#include<queue>
#include<deque>
#include<functional>
#include<stack>
#include<limits.h>
#include<iomanip>
#include<unordered_map> 
#include<numeric>
#include<tuple>
#include<bitset>
using namespace std;
 
#define MOD 1000000007
#define int long long
#define ff first
#define ss second
#define endl '\n'
void solve(){
	int n,m; cin>>n>>m;
	vector<int> y(n+1),x(m+1);
	for(int i=1; i<=n; i++) cin>>y[i];
	for(int i=1; i<=m; i++) cin>>x[i];
	map<int,int> mp;
	for(int i=1; i<=n; i++){
		for(int j=i+1; j<=n; j++){
			mp[y[j]-y[i]]++;
		}
	}
	int ans=0;
	for(int i=1; i<=m; i++){
		for(int j=i+1; j<=m; j++){
			ans+=mp[x[j]-x[i]];
		}
	}
	cout<<ans;
}
signed main(){
    // freopen("file.in", "r", stdin);
    // freopen("file.out", "w", stdout);
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    
    int t=1;
    // cin>>t;
    while(t--){
        solve();
        cout<<endl;
    }
    return 0;
}

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