# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
152120 | gs18103 | 화살표 그리기 (KOI18_arrowH) | C++14 | 50 ms | 5576 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define fi first
#define se second
#define all(v) v.begin(), v.end()
#define eb emplace_back
#define INF 1e9
#define LINF 1e18
#define g(tp, x) get<x>(tp)
using namespace std;
vector <int> arr[101010];
int main() {
ios::sync_with_stdio(false); cin.tie(0);
int n;
cin >> n;
for(int i = 1; i <= n; i++) {
int x, y; cin >> x >> y; arr[y].eb(x);
}
long long ans = 0;
for(int i = 1; i <= n; i++) {
sort(all(arr[i]));
for(int j = 0; j < arr[i].size(); j++) {
int temp = INF;
if(j) temp = min(temp, arr[i][j]-arr[i][j-1]);
if(j+1<arr[i].size()) temp = min(temp, arr[i][j+1]-arr[i][j]);
if(temp != INF) ans += temp;
}
}
cout << ans;
}
Compilation message (stderr)
# | 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... |