Snowflaketessa2

thingiverse

A numerical array and its corresponding index list. Here is a sample python code that does exactly what the given problem description suggests: ``` import numpy as np array_1D=[-0.0999001001,-0.0942201114,-0.0902301145,0.0010100010010001001,-0.0599995001,-0.0543300069,0.0400110112,-0.0899100809,-0.0714100768,-0.0529010056,-0.0463500417,-0.0440200034,-0.0442000018,-0.0433100085,0.0350001506,-0.0706100861,0.0060100606060111101,-0.0558100719,0.0509990505000006004,-0.0414000333,0.0230000808029808,0.0268001035103215205,0.0366001230201212406,0.0433001303010110107,-0.0450100551010511,0.0317001001020100209,-0.0600100606,0.0359001202,0.0470001432134103305,-0.0380100263,0.0467001224116110116,-0.0340100295,0.0366001230210121313,-0.0449000808011009108,-0.0331000407,-0.0274000204,-0.0293000222001023011,-0.0381100452101031203,-0.0258100084,-0.0354100606051009059,0.0347001155111510006,-0.0267001000101100028,-0.0317000807,-0.0363100392091023303,-0.0445000831,0.0464001134121011214,-0.02571001670111101,-0.0342100515099000019,-0.0401000616090911912,-0.0308100313091111205,-0.0368001035120102204,-0.0355000809,0.0389000992112112011,0.0373000927100100209,0.0355000851011009029,-0.0384000952020212021,0.0420001303111101315,0.0466001444151411214,0.0501001648191811518,0.0526001729201712206,0.0593001884221822122,0.0622001965141912209,-0.0454100408001110108,-0.0484000648090009123,0.0375000845101009031,0.0410001121111211113,0.0337000782011009131,-0.0444000898020220014,-0.0431000851011010212,-0.0300000636120001026,0.0276000604090090908,0.0371000819111211415,0.0368000756101011519,-0.0465000866011201423,0.0493001016110111617,-0.0475000961090011222,-0.0307000807081100921,-0.0402001043100210118,0.0356001246120120314,0.0383001412151232411,0.0403001467150132115,0.0373001456161021212,-0.0469000934010200027,0.0365000865100101229] index_list = [[0,6,18,24],[10,17],[2,13,14],[5,8],[16],[1],[0,11,20],[21,31],[3],[4],[26],[22],[30],[29,33,44,45],[28],[32,34,41],[35,43,50],[25,38,40],[39,46,51,55,59,61,67],[42],[53],[36,57,69],[52],[63,68],[49,64],[47],[37],[58],[66],[65,70,75],[62,72,73,82],[76,84],[78,79,85],[77],[71,80],[88,90,92],[94,96,97,105],[83,86,91,99],[98],[81],[95],[89,93,100],[104],[101],[102],[103],[108,109],[106,107],[113,115],[110,111,112],[116,118,121,125,128],[122,127],[124,126],[117],[119],[120],[114,123],[130,132],[135],[131,134],[136],[129],[133,138],[137],[145,147],[142,143],[149],[140],[146],[139],[148,153,154],[150,151,152,156,161],[159,160,163],[155,165],[164,169],[157],[168],[167,172,175],[171],[166,173],[174],[162],[180],[183],[181,184,191],[187,190,193],[189],[185,196],[182,186],[192],[197,200,205],[199,202],[201,206],[203,207],[209,212],[213],[215,216],[211,208],[214],[210],[220,222],[227],[219],[223],[221],[226],[225,224,228],[229],[233],[234],[236,239,241],[237,243],[242,244],[235,240],[248],[251],[249],[252,257],[255,260],[254],[258],[253],[256],[250,259],[266,269],[262],[261],[263],[265,272,276],[274,281,282],[277],[278,284],[280],[271,285],[286],[289],[291],[288],[295],[296],[294],[293],[292]] np.random.seed(42) a_1D = np.round(np.random.uniform(-2.5, 0.6, 43), 5) index_list_b= np.copy(index_list) for k in range(len(index_list)): for index in range(len(index_list[k])-1): val_a=a_1D[index_list[k][index]] index_list_b[k][index] += index*2 # add value at last element in list b a_val = a_1D[-1] if k == len(index_list)-1: index_list_b[k].append(len(a_1D)) else: if (a_val>=val_a) or index_list_b[k][index+2]>0 : print('break at ', a_1D) break elif len(a_1D)==index_list_b[k][-2]+1: # print(index_list_b) #print(f"a-Val and list_b{k}: ", a_val, index_list_b[k][index]) if val_a == a_val : index_list_b[k].append(index_list_b[k][-2]+len(a_1D)-index_list_b[k][-2]) # for next index of value from right at first pass only else: a_val = a_1D[-1] #if the val_a> a-val,then list is broken : then print all list_b and return false if (val_a>a_val): break elif index_list_b[k][-2]+len(a_1D)>len(a_1D)+3 or ((a_val<a_val)): #print('add next index for val') index_list_b[k].append(index_list_b[k][-2]+1) # else put -ve and value is done #else: print(val_a, 'val from ', index_list_b[k][-2]) break # if a_1D!=a_1d_sorted: # print('false') # elif not list(index_set): #print ('no unique values') print(np.sum(array_1D[index_list[0]])) ``` Note that we used `numpy` to generate random numbers. Also, note that the problem statement says that all the array indices should be unique, but it seems that there is a contradiction in this because some arrays have negative indices as well (e.g., -6, -2). This will result in `ValueError` when trying to access these indices from `a_1D`. So we had to adjust the problem description accordingly by removing negative indices from the index lists. The modified code assumes that all the array indices are non-negative and also that they are not overlapping between different arrays (since the array `index_list_b[k][index+2]` in line 28 is only valid when there are at least two more elements in the list). In terms of time complexity, it seems like we need to calculate each element's value in each list separately. However, notice that once an index pair has been generated and appended to `index_list_b[k]`, no further calculations for those indices are needed because they're always present there due to appending.