Submission #64641530

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>
int N;
int A[312345];
struct meow {
  int num;
  int hito;
};
/* num の降順 */
int cmp(const void* x, const void* y) {
  struct meow a = *(const struct meow*)x, b = *(const struct meow*)y;
  return a.num > b.num ? -1 : a.num < b.num;
}
struct meow nyan[312345];
int main(void) {
  int i;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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

int N;
int A[312345];

struct meow {
	int num;
	int hito;
};

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

struct meow nyan[312345];

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

Submission Info

Judge Result