Member SRM 465 DIV2 Medium
TurretPlacement
class TurretPlacement { public: long long count(vector <int> x, vector <int> y) { long long result = 0; int n = x.size(); for (int i = 0; i < n; ++i) { for (int j = i+1; j < n; ++j) { double d = sqrt((x[i]-x[j]) * (x[i]-x[j]) + (y[i]-y[j]) * (y[i]-y[j])); for (double s1 = 0.5; s1 < d; s1 += 0.5) { // iの方のサイズ if (d-s1 > 0) result += (int)((d-s1)/0.5); // jのサイズで条件を満たすものの個数 else break; } } } return result; } };