제출 #1163344

#제출 시각아이디문제언어결과실행 시간메모리
1163344HappyCapybara이상적인 도시 (IOI12_city)C++20
23 / 100
26 ms3344 KiB
#include<bits/stdc++.h>
using namespace std;

#define ll long long

int DistanceSum(int N, int *X, int *Y){
  map<ll,ll> rows, cols;
  for (int i=0; i<N; i++){
    rows[X[i]]++;
    cols[Y[i]]++;
  }
  ll res = 0;
  ll cur = 0, cl = 0;
  for (auto [r, x] : rows){
    cur += x*(r-rows.begin()->first);
    cl += x;
  }
  for (auto [r, x] : rows){
    res += x*cur;
    cl -= x;
    cur -= cl;
  }
  cur = 0; cl = 0;
  for (auto [c, x] : cols){
    cur += x*(c-cols.begin()->first);
    cl += x;
  }
  for (auto [c, x] : cols){
    res += x*cur;
    cl -= x;
    cur -= cl;
  }
  return res % 1000000000;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...