제출 #491381

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
491381		nemethm	Count Squares (CEOI19_countsquares)	C++17	100 / 100	2100 ms	140896 KiB

countsquares

#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <vector>
#include <deque>
#include <set>
#include <map>
#include <string>
#include <limits>
#include <assert.h>
#include <cmath>
#include <algorithm>
using namespace std;
using ll = long long int;
const ll mod = 998244353;

int main(){
	cin.tie(0);
	ios_base::sync_with_stdio(false);
  int h, w;
  cin >> h >> w;
  vector<ll> hor(h), ver(w);
  for(auto& i : hor){
    cin >> i;
  }
  for(auto& i : ver){
    cin >> i;
  }
  map<ll, ll> m;
  for(int i = 0; i < h; ++i){
    for(int j = i + 1; j < h; ++j){
      ++m[hor[j] - hor[i]];
    }
  }
  ll answ = 0;
  for(int i = 0; i < w; ++i){
    for(int j = i + 1; j < w; ++j){
      answ += m[ver[j] - ver[i]];
    }
  }
  cout << answ << endl;
}

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