| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1190008 | jayss | Best Place (NOI17_bestplace) | C++20 | 11 ms | 328 KiB |
#include <bits/stdc++.h>
using namespace std;
#define int long long
int sqr(int x) {
int l = 0, r = x;
while (l < r) {
int m = (l + r) / 2;
if (m * m < x) l = m + 1;
else r = m;
}
return l;
}
signed main() {
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int n; cin >> n;
int x = 0, y = 0;
for (int i = 0;i < n;i++) {
int xi, yi; cin >> xi >> yi;
x += xi;
y += yi;
}
cout << sqr(x) << ' ' << sqr(y);
return 0;
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
