結果
問題 |
No.3085 Easy Problems
|
ユーザー |
![]() |
提出日時 | 2025-04-04 21:42:06 |
言語 | C (gcc 13.3.0) |
結果 |
AC
|
実行時間 | 424 ms / 2,000 ms |
コード長 | 2,118 bytes |
コンパイル時間 | 713 ms |
コンパイル使用メモリ | 26,496 KB |
実行使用メモリ | 7,848 KB |
最終ジャッジ日時 | 2025-04-04 21:42:28 |
合計ジャッジ時間 | 15,678 ms |
ジャッジサーバーID (参考情報) |
judge6 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 31 |
コンパイルメッセージ
main.c: In function ‘main’: main.c:123:9: warning: ignoring return value of ‘scanf’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 123 | scanf("%d", &n); | ^~~~~~~~~~~~~~~ main.c:126:17: warning: ignoring return value of ‘scanf’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 126 | scanf("%d %d", &A[i], &B[i]); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ main.c:140:9: warning: ignoring return value of ‘scanf’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 140 | scanf("%d", &q); | ^~~~~~~~~~~~~~~ main.c:143:17: warning: ignoring return value of ‘scanf’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 143 | scanf("%d %d", &x, &y); | ^~~~~~~~~~~~~~~~~~~~~~
ソースコード
#include<stdio.h> int A[200005], B[200005]; int h[200005], l, z; int comp_h(int a, int b) { if (z == 0) { if (h[a] > h[b]) return 1; else return -1; } else { if (B[h[a]] > B[h[b]]) return 1; else if (B[h[a]] < B[h[b]]) return -1; else if (A[h[a]] > A[h[b]]) return 1; else return -1; } } void swap_h(int a, int b) { int f = h[a]; h[a] = h[b]; h[b] = f; return; } void push(int ne) { h[l] = ne; int p = l++; for (; p > 0; p = (p - 1) / 2) if (comp_h((p - 1) / 2, p) > 0) swap_h((p - 1) / 2, p); return; } int pop() { swap_h(0, --l); int p = 0; for (;;) { if (2 * p + 2 < l) { if (comp_h(2 * p + 1, 2 * p + 2) > 0) { if (comp_h(p, 2 * p + 2) > 0) swap_h(p, 2 * p + 2); p = 2 * p + 2; } else { if (comp_h(p, 2 * p + 1) > 0) swap_h(p, 2 * p + 1); p = 2 * p + 1; } } else if (2 * p + 1 < l) { if (comp_h(p, 2 * p + 1) > 0) swap_h(p, 2 * p + 1); p = 2 * p + 1; } else break; } return h[l]; } int n; int diff[200005], id[200005]; int cnt1(int d) { int min, mid, max; min = -1; max = n; while (max - min > 1) { mid = (max + min) / 2; if (diff[mid] > d) max = mid; else min = mid; } return max; } int cnt2(int a, int b) { int min, mid, max, left, right; min = -1; max = n; while (max - min > 1) { mid = (max + min) / 2; if (B[id[mid]] < b) min = mid; else max = mid; } left = max; min = -1; max = n; while (max - min > 1) { mid = (max + min) / 2; if (B[id[mid]] < b) min = mid; else if (B[id[mid]] > b) max = mid; else if (A[id[mid]] > a) max = mid; else min = mid; } right = max; return right - left; } int main() { scanf("%d", &n); int i; for (i = 0; i < n; i++) scanf("%d %d", &A[i], &B[i]); z = 0; l = 0; for (i = 0; i < n; i++) push(A[i]); for (i = 0; i < n; i++) diff[i] = pop(); z = 1; l = 0; for (i = 0; i < n; i++) push(i); for (i = 0; i < n; i++) id[i] = pop(); int q, x, y; scanf("%d", &q); for (i = 0; i < q; i++) { scanf("%d %d", &x, &y); printf("%d\n", cnt1(x) - cnt2(x, y)); } return 0; }