Submission #76900029

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
#include <stdio.h>
#include <stdlib.h>
#include <inttypes.h>
int N;
uint64_t K;
int L[212345];
int *A[212345];
int C[212345];
int main(void) {
  int i, j;
  if (scanf("%d%" SCNu64, &N, &K) != 2) return 1;
  for (i = 0; i < N; i++) {
    if (scanf("%d", &L[i]) != 1) return 1;
    A[i] = malloc(sizeof(*A[i]) * L[i]);
    if (A[i] == NULL) return 2;
    for (j = 0; j < L[i]; j++) {
      if (scanf("%d", &A[i][j]) != 1) return 1;
    }
  }
  for (i = 0; i < N; i++) {
    if (scanf("%d", &C[i]) != 1) return 1;
  }
  K--;
  for (i = 0; i < N; i++) {
    uint64_t len = (uint64_t)L[i] * C[i];
    if (K < len) {
      printf("%d\n", A[i][K % L[i]]);
      return 0;
    }
    K -= len;
  }
  puts("K too large");
  return 72;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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

int N;
uint64_t K;
int L[212345];
int *A[212345];
int C[212345];

int main(void) {
	int i, j;
	if (scanf("%d%" SCNu64, &N, &K) != 2) return 1;
	for (i = 0; i < N; i++) {
		if (scanf("%d", &L[i]) != 1) return 1;
		A[i] = malloc(sizeof(*A[i]) * L[i]);
		if (A[i] == NULL) return 2;
		for (j = 0; j < L[i]; j++) {
			if (scanf("%d", &A[i][j]) != 1) return 1;
		}
	}
	for (i = 0; i < N; i++) {
		if (scanf("%d", &C[i]) != 1) return 1;
	}
	K--;
	for (i = 0; i < N; i++) {
		uint64_t len = (uint64_t)L[i] * C[i];
		if (K < len) {
			printf("%d\n", A[i][K % L[i]]);
			return 0;
		}
		K -= len;
	}
	puts("K too large");
	return 72;
}

Submission Info

Judge Result