제출 #1213193

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1213193		LIA	이상적인 도시 (IOI12_city)	C++17	0 / 100	234 ms	636 KiB

city

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef tuple<ll, ll, ll> plll;
typedef vector<plll> vplll;
typedef pair<ll, ll> pll;
typedef vector<ll> vll;
typedef vector<pll> vpll;
typedef vector<vector<pll>> vvpll;
typedef vector<vector<ll>> vvll;
typedef vector<bool> vb;
typedef vector<vector<bool>> vvb;
#define loop(i, s, e) for (ll i = (s); i < (e); ++i)
#define loopr(i, e, s) for (ll i = (e)-1; i >= (s); --i)
#define all(a) a.begin(), a.end()
const ll inf = 1e18;
const ll mod = 1e9;
ll ans = 0;
ll n;

int DistanceSum(int N, int *x, int *y) {
  n=N;
  loop(i,0,n) {
    loop(j,i+1,n)ans+= (abs(x[i]-x[j]) +  abs(y[j]-y[i]));
  }
  return ans;

}
/*
3

0 0

0 1

0 2
 */

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