Submission #72461196

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
#include <stdio.h>
#include <stdlib.h>
struct meow {
  int id, score;
};
/* score の降順 */
int cmp(const void* x, const void* y) {
  struct meow a = *(const struct meow*)x, b = *(const struct meow*)y;
  return (a.score < b.score) - (a.score > b.score);
}
struct meow nyan[114514];
int ans[114514];
int main(void) {
  int n, i;
  int cur = 0;
  if (scanf("%d", &n) != 1) return 1;
  for (i = 0; i < n; i++) {
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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

struct meow {
	int id, score;
};

/* score の降順 */
int cmp(const void* x, const void* y) {
	struct meow a = *(const struct meow*)x, b = *(const struct meow*)y;
	return (a.score < b.score) - (a.score > b.score);
}

struct meow nyan[114514];
int ans[114514];

int main(void) {
	int n, i;
	int cur = 0;
	if (scanf("%d", &n) != 1) return 1;
	for (i = 0; i < n; i++) {
		if (scanf("%d", &nyan[i].score) != 1) return 1;
		nyan[i].id = i;
	}
	qsort(nyan, n, sizeof(*nyan), cmp);
	for (i = 0; i < n; i++) {
		if (i == 0 || nyan[i - 1].score != nyan[i].score) cur = i + 1;
		ans[nyan[i].id] = cur;
	}
	for (i = 0; i < n; i++) {
		printf("%d\n", ans[i]);
	}
	return 0;
}

Submission Info

Judge Result