Submission #1629967
Source Code Expand
#include <stdio.h>
#include <stdlib.h>
#define int long long
#define keytype int
#define datatype int
//static int malloc_cont;
//static int free_cont;
typedef struct node_sub{
keytype key; //添え字
datatype val; //値
int ele_num; //木に含まれる要素数
int height; //木の高さ
struct node_sub *left; //左の子へのポインタ
struct node_sub *right; //右の子へのポインタ
}node;
typedef struct {
node *root;
}AVL_tree;
int max(int a, int b){
if(a > b){
return a;
}
else{
return b;
}
}
//比較関数
//a < b なら負の値
//a = b なら0
//a > b なら正の値
int compare(keytype a, keytype b){
return a - b;
}
int ele_num(node *r){
if(r == NULL){
return 0;
}
else{
return r->ele_num;
}
}
int height(node *r){
if(r == NULL){
return 0;
}
else{
return r->height;
}
}
//tの指すノードを開放する
//datatypeなどがポインタ型の時はそれもfreeする
void release(node *r){
free(r);
// free_cont++;
}
node *build_node(keytype key, datatype val, node *left, node *right){
node *newr;
int left_h = height(left);
int right_h = height(right);
if(left_h > right_h + 1){
node *ll = left->left;
node *lr = left->right;
if(height(ll) < height(lr)){
newr = build_node(lr->key, lr->val, build_node(left->key, left->val, ll, lr->left), build_node(key, val, lr->right, right));
release(lr);
}
else{
newr = build_node(left->key, left->val, ll, build_node(key, val, lr, right));
}
release(left);
}
else if(right_h > left_h + 1){
node *rr = right->right;
node *rl = right->left;
if(height(rr) < height(rl)){
newr = build_node(rl->key, rl->val, build_node(key, val, left, rl->left), build_node(right->key, right->val, rl->right, rr));
release(rl);
}
else{
newr = build_node(right->key, right->val, build_node(key, val, left, rl), rr);
}
release(right);
}
else{
// malloc_cont++;
newr = (node *)malloc(sizeof(node));
newr->key = key;
newr->val = val;
newr->ele_num = ele_num(left) + ele_num(right) + 1;
newr->height = max(left_h, right_h) + 1;
newr->left = left;
newr->right = right;
}
return newr;
}
node *find_sub(keytype key, node *r){
if(r == NULL){
return NULL;
}
int comp = compare(key, r->key);
if(comp == 0){
return r;
}
else if(comp < 0){
return find_sub(key, r->left);
}
else{
return find_sub(key, r->right);
}
}
node *kth_smallest_sub(int k, node *r){
if(r == NULL || k < 1){
printf("In function 'kth_smallest_sub':\nargument 'k' is out of range\n");
return NULL;
}
else if(r->ele_num < k){
printf("In function 'kth_smallest_sub':\nargument 'k' is out of range\n");
return NULL;
}
else if(ele_num(r->left) == k - 1){
return r;
}
else if(ele_num(r->left) > k - 1){
return kth_smallest_sub(k, r->left);
}
else{
return kth_smallest_sub(k - ele_num(r->left) - 1, r->right);
}
}
int num_less_than_sub(keytype key, node *r){
if(r == NULL){
return 0;
}
else if(compare(key, r->key) < 0){
return num_less_than_sub(key, r->left);
}
else{
return ele_num(r->left) + num_less_than_sub(key, r->right) + 1;
}
}
node *next_largest_sub(keytype key, node *r){
if(r == NULL){
return NULL;
}
else if(compare(key, r->key) <= 0){
return next_largest_sub(key, r->left);
}
else{
node *candidate = next_largest_sub(key, r->right);
if(candidate == NULL){
return r;
}
else{
return candidate;
}
}
}
node *next_smallest_sub(keytype key, node *r){
if(r == NULL){
return NULL;
}
else if(compare(key, r->key) >= 0){
return next_smallest_sub(key, r->right);
}
else{
node *candidate = next_smallest_sub(key, r->left);
if(candidate == NULL){
return r;
}
else{
return candidate;
}
}
}
node *insert_sub(keytype key, datatype val, node *r){
node *newr;
if(r == NULL){
newr = build_node(key, val, NULL, NULL);
}
else{
int comp = compare(key, r->key);
if(comp == 0){
printf("In function 'insert_sub':\nkey '%d' already exists\n", key);
newr = build_node(r->key, val, r->left, r->right);
}
else if(comp < 0){
newr = build_node(r->key, r->val, insert_sub(key, val, r->left), r->right);
}
else{
newr = build_node(r->key, r->val, r->left, insert_sub(key, val, r->right));
}
release(r);
}
return newr;
}
node *erase_sub(keytype key, node *r){
node *newr;
if(r == NULL){
printf("In function 'erase_sub':\nkey '%d' doesn't exist\n", key);
newr = NULL;
}
else{
int comp = compare(key, r->key);
if(comp == 0){
if(r->left == NULL && r->right == NULL){
newr = NULL;
}
else if(r->right == NULL){
newr = r->left;
}
else if(r->left == NULL){
newr = r->right;
}
else{
node *next_larger = kth_smallest_sub(1, r->right);
newr = build_node(next_larger->key, next_larger->val, r->left, erase_sub(next_larger->key, r->right));
}
}
else if(comp < 0){
newr = build_node(r->key, r->val, erase_sub(key, r->left), r->right);
}
else{
newr = build_node(r->key, r->val, r->left, erase_sub(key, r->right));
}
release(r);
}
return newr;
}
void storeall_sub(keytype *array, int k, node *r){
if(r != NULL){
storeall_sub(array, k, r->left);
array[k + ele_num(r->left)] = r->key;
storeall_sub(array, k + ele_num(r->left) + 1, r->right);
}
}
void outall_sub(node *r){
if(r != NULL){
outall_sub(r->left);
printf("(key, val, ele_num, height) = (%d, %d, %d, %d)\n", r->key, r->val, r->ele_num, r->height);
outall_sub(r->right);
}
}
//AVL_treeを生成する
AVL_tree *make_AVL_tree(){
AVL_tree *t = (AVL_tree *)malloc(sizeof(AVL_tree));
t->root = NULL;
return t;
}
//tに含まれるノードの数を返す
int element_num(AVL_tree *t){
return ele_num(t->root);
}
//添え字がkeyのノードへのポインタを返す
//なければNULLを返す
node *find(keytype key, AVL_tree *t){
return find_sub(key, t->root);
}
//小さい順にk番目のkeyのノードへのポインタを返す
//1 ≦ k ≦ ele_num(t->root) を満たさない場合はNULLを返す(メッセージが出る)
node *kth_smallest(int k, AVL_tree *t){
return kth_smallest_sub(k, t->root);
}
//添え字がkey以下のノードの数を返す
int num_less_than(keytype key, AVL_tree *t){
return num_less_than_sub(key, t->root);
}
//keyよりも小さい中で最大の添え字のノードへのポインタを返す
//なければNULLを返す
node *next_largest(keytype key, AVL_tree *t){
return next_largest_sub(key, t->root);
}
//keyよりも大きい中で最小の添え字のノードへのポインタを返す
//なければNULLを返す
node *next_smallest(keytype key, AVL_tree *t){
return next_smallest_sub(key, t->root);
}
//添え字key, 値valのノードを挿入する
//既に存在する場合は値が上書きされる(メッセージが出る)
void insert(keytype key, datatype val, AVL_tree *t){
t->root = insert_sub(key, val, t->root);
}
//添え字keyのノードを削除する
//存在しない場合は何もしない(メッセージが出る)
void erase(keytype key, AVL_tree *t){
t->root = erase_sub(key, t->root);
}
//全ノードのkeyを小さい順に格納した配列を返す
keytype *storeall(AVL_tree *t){
keytype *array = (keytype *)malloc(sizeof(keytype) * element_num(t));
storeall_sub(array, 0, t->root);
return array;
}
//全ノードの中身をkeyの小さい順に出力する
void outall(AVL_tree *t){
outall_sub(t->root);
}
int gcd(int a, int b){
if(a == 0){
return b;
}
else if(b == 0){
return a;
}
else{
return gcd(b, a % b);
}
}
signed main(){
int N, M, i;
scanf("%lld%lld", &N, &M);
int *a = (int *)malloc(sizeof(int) * N);
AVL_tree **ts = (AVL_tree **)malloc(sizeof(AVL_tree *) * N);
AVL_tree *ans_t = make_AVL_tree();
int g;
node *r1, *r2, *r3;
for(i = 0; i < N; i++){
scanf("%lld", &a[i]);
ts[i] = make_AVL_tree();
insert(a[i], 1, ts[i]);
r1 = find(a[i], ans_t);
if(r1 == NULL){
insert(a[i], 1, ans_t);
}
else{
r1->val++;
}
}
int *x = (int *)malloc(sizeof(int) * M);
for(i = 0; i < M; i++){
scanf("%lld", &x[i]);
}
for(i = 1; i < N; i++){
while(element_num(ts[i - 1]) > 0){
r1 = kth_smallest(1, ts[i - 1]);
g = gcd(r1->key, a[i]);
r2 = find(g, ts[i]);
if(r2 == NULL){
insert(g, r1->val, ts[i]);
}
else{
r2->val += r1->val;
}
r3 = find(g, ans_t);
if(r3 == NULL){
insert(g, r1->val, ans_t);
}
else{
r3->val += r1->val;
}
erase(r1->key, ts[i - 1]);
}
}
for(i = 0; i < M; i++){
r1 = find(x[i], ans_t);
if(r1 == NULL){
printf("0\n");
}
else{
printf("%lld\n", r1->val);
}
}
return 0;
}
Submission Info
Submission Time
2017-09-27 02:06:35+0900
Task
D - GCD区間
User
abc050
Language
C (GCC 5.4.1)
Score
100
Code Size
8981 Byte
Status
AC
Exec Time
233 ms
Memory
18304 KB
Compile Error
./Main.c: In function ‘insert_sub’:
./Main.c:198:11: warning: format ‘%d’ expects argument of type ‘int’, but argument 2 has type ‘long long int’ [-Wformat=]
printf("In function 'insert_sub':\nkey '%d' already exists\n", key);
^
./Main.c: In function ‘erase_sub’:
./Main.c:215:10: warning: format ‘%d’ expects argument of type ‘int’, but argument 2 has type ‘long long int’ [-Wformat=]
printf("In function 'erase_sub':\nkey '%d' doesn't exist\n", key);
^
./Main.c: In function ‘outall_sub’:
./Main.c:257:10: warning: format ‘%d’ expects argument of type ‘int’, but argument 2 has type ‘long long int’ [-Wformat=]
printf("(key, val, ele_num, height) = (%d, %d, %d, %d)\n", r->key, r->val, r->ele_num, r->height);
^
./Main.c:257:10: warning: format ‘%d’ expects argument of type ‘int’, but argument 3 has type ‘long long int’ [-Wformat=]
./Main.c:257:10: warning: format ‘%d’ expects argument of type ‘int’, but argument 4 has type ‘long long int’ [-Wformat=]
./Main.c:257:10: warni...
Judge Result
Set Name
Sample
All
Score / Max Score
0 / 0
100 / 100
Status
Set Name
Test Cases
Sample
subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt
All
subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask1_20.txt, subtask1_21.txt, subtask1_22.txt, subtask1_23.txt, subtask1_24.txt, subtask1_25.txt, subtask1_26.txt, subtask1_27.txt
Case Name
Status
Exec Time
Memory
subtask0_sample_01.txt
AC
1 ms
128 KB
subtask0_sample_02.txt
AC
1 ms
128 KB
subtask0_sample_03.txt
AC
1 ms
128 KB
subtask1_01.txt
AC
2 ms
384 KB
subtask1_02.txt
AC
2 ms
384 KB
subtask1_03.txt
AC
2 ms
384 KB
subtask1_04.txt
AC
233 ms
18304 KB
subtask1_05.txt
AC
232 ms
18304 KB
subtask1_06.txt
AC
24 ms
11136 KB
subtask1_07.txt
AC
21 ms
11136 KB
subtask1_08.txt
AC
21 ms
11136 KB
subtask1_09.txt
AC
98 ms
11136 KB
subtask1_10.txt
AC
98 ms
11136 KB
subtask1_11.txt
AC
165 ms
18304 KB
subtask1_12.txt
AC
32 ms
11136 KB
subtask1_13.txt
AC
94 ms
11136 KB
subtask1_14.txt
AC
38 ms
11136 KB
subtask1_15.txt
AC
77 ms
11136 KB
subtask1_16.txt
AC
104 ms
11136 KB
subtask1_17.txt
AC
123 ms
13184 KB
subtask1_18.txt
AC
39 ms
11136 KB
subtask1_19.txt
AC
41 ms
11136 KB
subtask1_20.txt
AC
37 ms
11136 KB
subtask1_21.txt
AC
24 ms
11136 KB
subtask1_22.txt
AC
35 ms
11136 KB
subtask1_23.txt
AC
51 ms
11136 KB
subtask1_24.txt
AC
30 ms
11136 KB
subtask1_25.txt
AC
33 ms
11136 KB
subtask1_26.txt
AC
12 ms
1152 KB
subtask1_27.txt
AC
38 ms
12032 KB