#include <stdio.h>
#define N 100000
#define INF 0x3f3f3f3f
int min(int a, int b) { return a < b ? a : b; }
unsigned int Z = 12345;
int rand_() {
return (Z *= 3) >> 1;
}
int cc[N], xx[N];
void sort(int *ii, int l, int r) {
while (l < r) {
int i = l, j = l, k = r, i_ = ii[l + rand_() % (r - l)], tmp;
while (j < k) {
int c = cc[ii[j]] != cc[i_] ? cc[ii[j]] - cc[i_] : xx[ii[j]] - xx[i_];
if (c == 0)
j++;
else if (c < 0) {
tmp = ii[i], ii[i] = ii[j], ii[j] = tmp;
i++, j++;
} else {
k--;
tmp = ii[j], ii[j] = ii[k], ii[k] = tmp;
}
}
sort(ii, l, i);
l = k;
}
}
int main() {
static int ii[N];
int n, i, d;
long long ans;
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d%d", &xx[i], &cc[i]);
for (i = 0; i < n; i++)
ii[i] = i;
sort(ii, 0, n);
ans = 0;
for (i = 0; i < n; i++) {
d = INF;
if (i > 0 && cc[ii[i]] == cc[ii[i - 1]])
d = min(d, xx[ii[i]] - xx[ii[i - 1]]);
if (i + 1 < n && cc[ii[i]] == cc[ii[i + 1]])
d = min(d, xx[ii[i + 1]] - xx[ii[i]]);
if (d != INF)
ans += d;
}
printf("%lld\n", ans);
return 0;
}
Compilation message
arrow.c: In function 'main':
arrow.c:43:2: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
43 | scanf("%d", &n);
| ^~~~~~~~~~~~~~~
arrow.c:45:3: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
45 | scanf("%d%d", &xx[i], &cc[i]);
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
348 KB |
Output is correct |
| 2 |
Correct |
0 ms |
348 KB |
Output is correct |
| 3 |
Correct |
0 ms |
348 KB |
Output is correct |
| 4 |
Correct |
0 ms |
348 KB |
Output is correct |
| 5 |
Correct |
0 ms |
348 KB |
Output is correct |
| 6 |
Correct |
0 ms |
428 KB |
Output is correct |
| 7 |
Correct |
0 ms |
348 KB |
Output is correct |
| 8 |
Correct |
0 ms |
348 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
348 KB |
Output is correct |
| 2 |
Correct |
0 ms |
348 KB |
Output is correct |
| 3 |
Correct |
0 ms |
348 KB |
Output is correct |
| 4 |
Correct |
0 ms |
348 KB |
Output is correct |
| 5 |
Correct |
0 ms |
348 KB |
Output is correct |
| 6 |
Correct |
0 ms |
428 KB |
Output is correct |
| 7 |
Correct |
0 ms |
348 KB |
Output is correct |
| 8 |
Correct |
0 ms |
348 KB |
Output is correct |
| 9 |
Correct |
1 ms |
344 KB |
Output is correct |
| 10 |
Correct |
1 ms |
348 KB |
Output is correct |
| 11 |
Correct |
1 ms |
456 KB |
Output is correct |
| 12 |
Correct |
1 ms |
436 KB |
Output is correct |
| 13 |
Correct |
1 ms |
348 KB |
Output is correct |
| 14 |
Correct |
1 ms |
348 KB |
Output is correct |
| 15 |
Correct |
1 ms |
348 KB |
Output is correct |
| 16 |
Correct |
1 ms |
436 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
348 KB |
Output is correct |
| 2 |
Correct |
0 ms |
348 KB |
Output is correct |
| 3 |
Correct |
0 ms |
348 KB |
Output is correct |
| 4 |
Correct |
0 ms |
348 KB |
Output is correct |
| 5 |
Correct |
0 ms |
348 KB |
Output is correct |
| 6 |
Correct |
0 ms |
428 KB |
Output is correct |
| 7 |
Correct |
0 ms |
348 KB |
Output is correct |
| 8 |
Correct |
0 ms |
348 KB |
Output is correct |
| 9 |
Correct |
1 ms |
344 KB |
Output is correct |
| 10 |
Correct |
1 ms |
348 KB |
Output is correct |
| 11 |
Correct |
1 ms |
456 KB |
Output is correct |
| 12 |
Correct |
1 ms |
436 KB |
Output is correct |
| 13 |
Correct |
1 ms |
348 KB |
Output is correct |
| 14 |
Correct |
1 ms |
348 KB |
Output is correct |
| 15 |
Correct |
1 ms |
348 KB |
Output is correct |
| 16 |
Correct |
1 ms |
436 KB |
Output is correct |
| 17 |
Correct |
3 ms |
604 KB |
Output is correct |
| 18 |
Correct |
2 ms |
604 KB |
Output is correct |
| 19 |
Correct |
2 ms |
600 KB |
Output is correct |
| 20 |
Correct |
3 ms |
604 KB |
Output is correct |
| 21 |
Correct |
2 ms |
604 KB |
Output is correct |
| 22 |
Correct |
2 ms |
604 KB |
Output is correct |
| 23 |
Correct |
3 ms |
604 KB |
Output is correct |
| 24 |
Correct |
3 ms |
600 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
348 KB |
Output is correct |
| 2 |
Correct |
0 ms |
348 KB |
Output is correct |
| 3 |
Correct |
0 ms |
348 KB |
Output is correct |
| 4 |
Correct |
0 ms |
348 KB |
Output is correct |
| 5 |
Correct |
0 ms |
348 KB |
Output is correct |
| 6 |
Correct |
0 ms |
428 KB |
Output is correct |
| 7 |
Correct |
0 ms |
348 KB |
Output is correct |
| 8 |
Correct |
0 ms |
348 KB |
Output is correct |
| 9 |
Correct |
1 ms |
344 KB |
Output is correct |
| 10 |
Correct |
1 ms |
348 KB |
Output is correct |
| 11 |
Correct |
1 ms |
456 KB |
Output is correct |
| 12 |
Correct |
1 ms |
436 KB |
Output is correct |
| 13 |
Correct |
1 ms |
348 KB |
Output is correct |
| 14 |
Correct |
1 ms |
348 KB |
Output is correct |
| 15 |
Correct |
1 ms |
348 KB |
Output is correct |
| 16 |
Correct |
1 ms |
436 KB |
Output is correct |
| 17 |
Correct |
3 ms |
604 KB |
Output is correct |
| 18 |
Correct |
2 ms |
604 KB |
Output is correct |
| 19 |
Correct |
2 ms |
600 KB |
Output is correct |
| 20 |
Correct |
3 ms |
604 KB |
Output is correct |
| 21 |
Correct |
2 ms |
604 KB |
Output is correct |
| 22 |
Correct |
2 ms |
604 KB |
Output is correct |
| 23 |
Correct |
3 ms |
604 KB |
Output is correct |
| 24 |
Correct |
3 ms |
600 KB |
Output is correct |
| 25 |
Correct |
29 ms |
3160 KB |
Output is correct |
| 26 |
Correct |
26 ms |
2708 KB |
Output is correct |
| 27 |
Correct |
29 ms |
2908 KB |
Output is correct |
| 28 |
Correct |
25 ms |
2648 KB |
Output is correct |
| 29 |
Correct |
30 ms |
2900 KB |
Output is correct |
| 30 |
Correct |
24 ms |
2396 KB |
Output is correct |
| 31 |
Correct |
28 ms |
2888 KB |
Output is correct |
| 32 |
Correct |
26 ms |
2808 KB |
Output is correct |
