제출 #1237678

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1237678		guanex	이상적인 도시 (IOI12_city)	C++20	23 / 100	21 ms	2244 KiB

city

#include<bits/stdc++.h>

using namespace std;

typedef long long ll;

int mod = 1e9;

int DistanceSum(int N, int *X, int *Y) {
  vector<int> x;
  vector<int> y;
  for(int i = 0; i < N; ++i){
    x.push_back(X[i]);
    y.push_back(Y[i]);
  }
  ll ans = 0;
  sort(x.begin(), x.end());
  sort(y.begin(), y.end());
  ll pastx = x[0];
  ll cntx = 0;
  ll pasty = y[0];
  ll cnty = 0;
  ll sumx = 0;
  ll sumy = 0;
  for(int i = 0; i < N; ++i){
    ll diff = x[i] - pastx;
    sumx += (diff * cntx);
    pastx = x[i];
    cntx++;
    diff = y[i] - pasty;
    sumy += (diff * cnty);
    cnty++;
    pasty = y[i];
    sumx %= mod;
    sumy %= mod;
    ans += sumx;
    ans += sumy;
    ans %= mod;
  }
  return ans % mod;

}

• Subtask 1: 0 / 11
• Subtask 2: 0 / 21
• Subtask 3: 23 / 23
• Subtask 4: 0 / 45