1a:I[48803,["6079","static/chunks/363642f4-ca12a5ed7d30075e.js","5653","static/chunks/5653-10777e0e1fc92dce.js","5000","static/chunks/5000-a7bfe5b9669501e3.js","5538","static/chunks/5538-ed47f067afaa5003.js","7412","static/chunks/7412-2a540dc7a2630d42.js","9362","static/chunks/9362-e9f488fde79ed646.js","3729","static/chunks/3729-8164898f6bdc738c.js","8720","static/chunks/8720-56867bcc82acef59.js","9992","static/chunks/9992-c6b29c96d53cc0fe.js","9211","static/chunks/9211-2c147ebefe26b47c.js","9791","static/chunks/app/submission/%5Bid%5D/page-47099a350c9e7e40.js"],"CodeViewer"] 1c:I[48988,["6079","static/chunks/363642f4-ca12a5ed7d30075e.js","5653","static/chunks/5653-10777e0e1fc92dce.js","5000","static/chunks/5000-a7bfe5b9669501e3.js","5538","static/chunks/5538-ed47f067afaa5003.js","7412","static/chunks/7412-2a540dc7a2630d42.js","9362","static/chunks/9362-e9f488fde79ed646.js","3729","static/chunks/3729-8164898f6bdc738c.js","8720","static/chunks/8720-56867bcc82acef59.js","9992","static/chunks/9992-c6b29c96d53cc0fe.js","9211","static/chunks/9211-2c147ebefe26b47c.js","9791","static/chunks/app/submission/%5Bid%5D/page-47099a350c9e7e40.js"],"TestCaseDisplay"] 1b:T4e6,#include #include #include #include #include using namespace std; int main() { int N; cin >> N; vector x(N), y(N); for (int i = 0; i < N; i++) { double a, b; cin >> a >> b; x[i] = a; y[i] = b; } vector center(2); for (int i = 0; i < N; i++) { center[0] += x[i]; center[1] += y[i]; } center[0] /= N; center[1] /= N; double max_distance = 0; double weight = 0.1; for (int i = 0; i < 200000; i++) { max_distance = 0; int max_point = 0; for (int j = 0; j < N; j++) { double distance = sqrt(pow(x[j] - center[0], 2) + pow(y[j] - center[1], 2)); if (distance > max_distance) { max_

제출 #81937

제출 정보

제출 결과

제출 코드

찾은 반례

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력: