Submission #77217541

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
#include <stdio.h>
#include <stdlib.h>
struct q_s {
  int qsize;
  int q[212345 * 2];
  int (*cmp)(int, int);
};
void qadjust(struct q_s* q, int pos) {
  for (;;) {
    int i;
    int minpos = pos;
    for (i = 1; i <= 2; i++) {
      int c = pos * 2 + i;
      if (c < q->qsize && q->cmp(q->q[minpos], q->q[c]) > 0) minpos = c;
    }
    if (minpos == pos) {
      if (pos == 0) return;
      pos = (pos - 1) / 2;
    } else {
      int temp = q->q[pos];
      q->q[pos] = q->q[minpos];
      q->q[minpos] = temp;
      pos = minpos;
    }
  }
}
void qadd(struct q_s* q, int value) {
  q->q[q->qsize++] = value;
  qadjust(q, q->qsize - 1);
}
int qpeek(struct q_s* q) {
  if (q->qsize <= 0) exit(72);
  return q->q[0];
}
int qget(struct q_s* q) {
  int res;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#include <stdio.h>
#include <stdlib.h>

struct q_s {
	int qsize;
	int q[212345 * 2];
	int (*cmp)(int, int);
};

void qadjust(struct q_s* q, int pos) {
	for (;;) {
		int i;
		int minpos = pos;
		for (i = 1; i <= 2; i++) {
			int c = pos * 2 + i;
			if (c < q->qsize && q->cmp(q->q[minpos], q->q[c]) > 0) minpos = c;
		}
		if (minpos == pos) {
			if (pos == 0) return;
			pos = (pos - 1) / 2;
		} else {
			int temp = q->q[pos];
			q->q[pos] = q->q[minpos];
			q->q[minpos] = temp;
			pos = minpos;
		}
	}
}

void qadd(struct q_s* q, int value) {
	q->q[q->qsize++] = value;
	qadjust(q, q->qsize - 1);
}

int qpeek(struct q_s* q) {
	if (q->qsize <= 0) exit(72);
	return q->q[0];
}

int qget(struct q_s* q) {
	int res;
	if (q->qsize <= 0) exit(72);
	res = q->q[0];
	if (--q->qsize > 0) {
		q->q[0] = q->q[q->qsize];
		qadjust(q, 0);
	}
	return res;
}

int qsize(struct q_s* q) {
	return q->qsize;
}

int normal_cmp(int a, int b) {
	return (a > b) - (a < b);
}

int reverse_cmp(int a, int b) {
	return (a < b) - (a > b);
}

struct q_s lq = { .cmp = reverse_cmp }, gq = { .cmp = normal_cmp };

int main(void) {
	int X;
	int Q;
	int i;
	if (scanf("%d", &X) != 1) return 1;
	if (scanf("%d", &Q) != 1) return 1;
	qadd(&lq, X);
	for (i = 0; i < Q; i++) {
		int A, B;
		if (scanf("%d%d", &A, &B) != 2) return 1;
		if (qpeek(&lq) > A) qadd(&lq, A); else qadd(&gq, A);
		if (qpeek(&lq) > B) qadd(&lq, B); else qadd(&gq, B);
		while (qsize(&lq) > qsize(&gq) + 1) qadd(&gq, qget(&lq));
		while (qsize(&lq) < qsize(&gq) + 1) qadd(&lq, qget(&gq));
		printf("%d\n", qpeek(&lq));
	}
	return 0;
}

Submission Info

Judge Result