REST

1import { BrowserRouter, Navigate, Route, Routes } from 'react-router-dom';
2
3<BrowserRouter>
4  <Routes>
5    <Route path="/" element={<Home />} />
6    <Route path="/lab" element={<Lab />} />
7    <Route render={() => <Navigate to="/" />} />
8  </Routes>
9</BrowserRouter>
10import { BrowserRouter, Navigate, Route, Routes } from 'react-router-dom';
11
12<BrowserRouter>
13  <Routes>
14    <Route path="/" element={<Home />} />
15    <Route path="/lab" element={<Lab />} />
16    <Route
17        path="*"
18        element={<Navigate to="/" replace />}
19    />
20  </Routes>
21</BrowserRouter>
22

1struct Base {};
2struct Derived : Base {};
3struct MostDerived : Derived {};
4void foo() {
5    int i = 0; // complete object, but not most-derived (not class type)
6}
7
8class A {
9   int i = 0; // non complete object, not most-derived
10}
11
12void bar() {
13    A a; // complete object, but not derived, so can't be "most derived"
14}
15
16class B : A { }
17
18void biz() {
19   B b; // complete object, derived object, and most-derived object
20}
21

1struct Base {};
2struct Derived : Base {};
3struct MostDerived : Derived {};
4void foo() {
5    int i = 0; // complete object, but not most-derived (not class type)
6}
7
8class A {
9   int i = 0; // non complete object, not most-derived
10}
11
12void bar() {
13    A a; // complete object, but not derived, so can't be "most derived"
14}
15
16class B : A { }
17
18void biz() {
19   B b; // complete object, derived object, and most-derived object
20}
21MostDerived md;
22

1p = [4,9,10,4,20,13,29,3,39]
2p = [20,13,29,3,39]
3[x for x in p if x>18] 
4from itertools import dropwhile
5
6p = [4,9,10,4,20,13,29,3,39]
7
8p = dropwhile(lambda x: x <= 18, p)
9print(*p) # 20 13 29 3 39
10

1p = [4,9,10,4,20,13,29,3,39]
2p = [20,13,29,3,39]
3[x for x in p if x>18] 
4from itertools import dropwhile
5
6p = [4,9,10,4,20,13,29,3,39]
7
8p = dropwhile(lambda x: x <= 18, p)
9print(*p) # 20 13 29 3 39
10exceeded = False
11p = [x for x in p if (exceeded := exceeded or x > 18)]
12print(p) # [20, 13, 29, 3, 39]
13

1p = [4,9,10,4,20,13,29,3,39]
2p = [20,13,29,3,39]
3[x for x in p if x>18] 
4from itertools import dropwhile
5
6p = [4,9,10,4,20,13,29,3,39]
7
8p = dropwhile(lambda x: x <= 18, p)
9print(*p) # 20 13 29 3 39
10exceeded = False
11p = [x for x in p if (exceeded := exceeded or x > 18)]
12print(p) # [20, 13, 29, 3, 39]
13for i, x in enumerate(p):
14    if x > 18:
15        output = p[i:]
16        break
17else:
18    output = [] # alternatively just put output = [] before for
19

1data = [{
2          "id"     : "matchme-foo",
3          "message": "hallo this is a message",
4      },{
5          "id"     : "matchme-bar",
6          "message": "goodbye",
7      },{
8          "id"     : "anotherid",
9          "message": "completely diffrent event"
10      }, ...]
11for event in data:
12    match event:
13        case {'id':'matchme-*'}: # Match all 'matchme-' no matter what comes next
14            log.INFO(event['message'])
15        case {'id':'anotherid'}:
16            log.ERROR(event['message'])
17for event in data:
18    match event:
19        case {'id': x} if x.startswith("matchme"): # guard
20            print(event["message"])
21        case {'id':'anotherid'}:
22            print(event["message"])
23

1data = [{
2          "id"     : "matchme-foo",
3          "message": "hallo this is a message",
4      },{
5          "id"     : "matchme-bar",
6          "message": "goodbye",
7      },{
8          "id"     : "anotherid",
9          "message": "completely diffrent event"
10      }, ...]
11for event in data:
12    match event:
13        case {'id':'matchme-*'}: # Match all 'matchme-' no matter what comes next
14            log.INFO(event['message'])
15        case {'id':'anotherid'}:
16            log.ERROR(event['message'])
17for event in data:
18    match event:
19        case {'id': x} if x.startswith("matchme"): # guard
20            print(event["message"])
21        case {'id':'anotherid'}:
22            print(event["message"])
23match point:
24     case Point(x, y) if x == y:
25         print(f"The point is located on the diagonal Y=X at {x}.")
26     case Point(x, y):
27         print(f"Point is not on the diagonal.")
28

1const PrivateRoute = ({ isLoggedIn, component: Component, ...rest }) => {
2  return (
3    <Route
4      {...rest}
5      render={(props) =>
6        isLoggedIn? (
7          <Component {...props} />
8        ) : (
9          <Redirect
10            to={{ pathname: `/login/${props.location.search}`, state: { from: props.location } }}
11          />
12        )
13      }
14    />
15  );
16};
17
18
19<PrivateRoute exact isLoggedIn={isLoggedIn} path="/settings" component={Settings} />
20
21const CustomRoute = ({ isLoggedIn, ...props }) => {
22  const location = useLocation();
23  return isLoggedIn? (
24    <Route {...props} />
25  ) : (
26    <Redirect
27      to={{
28        pathname: `/login/${location.search}`,
29        state: { location },
30      }}
31    />
32  );
33};
34

1const PrivateRoute = ({ isLoggedIn, component: Component, ...rest }) => {
2  return (
3    <Route
4      {...rest}
5      render={(props) =>
6        isLoggedIn? (
7          <Component {...props} />
8        ) : (
9          <Redirect
10            to={{ pathname: `/login/${props.location.search}`, state: { from: props.location } }}
11          />
12        )
13      }
14    />
15  );
16};
17
18
19<PrivateRoute exact isLoggedIn={isLoggedIn} path="/settings" component={Settings} />
20
21const CustomRoute = ({ isLoggedIn, ...props }) => {
22  const location = useLocation();
23  return isLoggedIn? (
24    <Route {...props} />
25  ) : (
26    <Redirect
27      to={{
28        pathname: `/login/${location.search}`,
29        state: { location },
30      }}
31    />
32  );
33};
34<PrivateRoute
35  exact
36  isLoggedIn={isLoggedIn}
37  path="/settings"
38  component={Settings}
39/>
40

1const PrivateRoute = ({ isLoggedIn, component: Component, ...rest }) => {
2  return (
3    <Route
4      {...rest}
5      render={(props) =>
6        isLoggedIn? (
7          <Component {...props} />
8        ) : (
9          <Redirect
10            to={{ pathname: `/login/${props.location.search}`, state: { from: props.location } }}
11          />
12        )
13      }
14    />
15  );
16};
17
18
19<PrivateRoute exact isLoggedIn={isLoggedIn} path="/settings" component={Settings} />
20
21const CustomRoute = ({ isLoggedIn, ...props }) => {
22  const location = useLocation();
23  return isLoggedIn? (
24    <Route {...props} />
25  ) : (
26    <Redirect
27      to={{
28        pathname: `/login/${location.search}`,
29        state: { location },
30      }}
31    />
32  );
33};
34<PrivateRoute
35  exact
36  isLoggedIn={isLoggedIn}
37  path="/settings"
38  component={Settings}
39/>
40const CustomWrapper = ({ isLoggedIn, ...props }) => {
41  const location = useLocation();
42  return isLoggedIn? (
43    <Outlet />
44  ) : (
45    <Navigate
46      to={`/login/${location.search}`}
47      replace
48      state={{ location }}
49    />
50  )
51};
52

1const PrivateRoute = ({ isLoggedIn, component: Component, ...rest }) => {
2  return (
3    <Route
4      {...rest}
5      render={(props) =>
6        isLoggedIn? (
7          <Component {...props} />
8        ) : (
9          <Redirect
10            to={{ pathname: `/login/${props.location.search}`, state: { from: props.location } }}
11          />
12        )
13      }
14    />
15  );
16};
17
18
19<PrivateRoute exact isLoggedIn={isLoggedIn} path="/settings" component={Settings} />
20
21const CustomRoute = ({ isLoggedIn, ...props }) => {
22  const location = useLocation();
23  return isLoggedIn? (
24    <Route {...props} />
25  ) : (
26    <Redirect
27      to={{
28        pathname: `/login/${location.search}`,
29        state: { location },
30      }}
31    />
32  );
33};
34<PrivateRoute
35  exact
36  isLoggedIn={isLoggedIn}
37  path="/settings"
38  component={Settings}
39/>
40const CustomWrapper = ({ isLoggedIn, ...props }) => {
41  const location = useLocation();
42  return isLoggedIn? (
43    <Outlet />
44  ) : (
45    <Navigate
46      to={`/login/${location.search}`}
47      replace
48      state={{ location }}
49    />
50  )
51};
52<Route path="settings" element={<CustomWrapper isLoggedIn={isLoggedIn} />} >
53  <Route path="settings" element={<Settings />} />
54</Route>
55

1class FutureVehicleURLTest(APILiveServerTestCase):
2    def setUp(self):
3        # Setup users and some vehicle data we can query against
4        management.call_command("create_users_and_vehicle_data", verbosity=0)
5        self.user = UserFactory()
6        self.admin_user = User.objects.get(username="adminuser")
7        self.future_vehicle = f.FutureVehicleFactory(
8            user=self.user,
9            last_updated_by=self.user,
10        )
11        self.vehicle = f.VehicleFactory(
12            user=self.user,
13            created_by=self.user,
14            modified_by=self.user,
15        )
16        self.url = reverse("FutureVehicles-list")
17        self.full_url = self.live_server_url + self.url
18        time = str(datetime.now())
19        self.form_data = {
20            "signature": "TT",
21            "purchasing": True,
22            "confirmed_at": time,
23        }
24    def test_patch_request_updates_object(self):
25        data_dict = {
26            "signature": "TT",
27            "purchasing": "true",
28            "confirmed_at": datetime.now().strftime("%m/%d/%Y, %H:%M:%S"),
29        }
30        url = self.full_url + str(self.future_vehicle.id) + "/"
31        client = requests.Session()
32        client.auth = HTTPBasicAuth(self.admin_user.username, "test")
33        client.headers.update({"x-test": "true"})
34        response = client.get(self.live_server_url + "/admin/")
35        csrftoken = response.cookies["csrftoken"]
36        # interact with the api
37        response = client.patch(
38            url,
39            data=json.dumps(data_dict),
40            cookies=response.cookies,
41            headers={
42                "X-Requested-With": "XMLHttpRequest",
43                "X-CSRFTOKEN": csrftoken,
44            },
45        )
46        # RESPONSE GIVES 403 PERMISSION DENIED
47        fte_future_vehicle = FutureVehicle.objects.filter(
48            id=self.future_vehicle.id
49        ).first()
50        # THIS ERRORS WITH '' not equal to 'TT'
51        self.assertEqual(fte_future_vehicle.signature, "TT")
52    def test_patch_request_updates_object(self):
53        data_dict = {
54            "signature": "TT",
55            "purchasing": "true",
56            "confirmed_at": datetime.now().strftime("%m/%d/%Y, %H:%M:%S"),
57        }
58        url = self.full_url + str(self.future_vehicle.id) + "/"
59        api_req_factory = APIRequestFactory()
60        view = FutureVehicleViewSet.as_view({"patch": "partial_update"})
61        api_request = api_req_factory.patch(
62            url, json.dumps(data_dict), content_type="application/json"
63        )
64        force_authenticate(api_request, self.admin_user)
65        response = view(api_request, pk=self.future_assignment.id)
66        fte_future_assignment = FutureVehicle.objects.filter(
67            id=self.future_assignment.id
68        ).first()
69        self.assertEqual(fte_future_assignment.signature, "TT")
70class FutureVehicleViewSet(ModelViewSet):
71    serializer_class = FutureVehicleSerializer
72
73    def get_queryset(self):
74        queryset = FutureVehicle.exclude_denied.all()
75        user_id = self.request.query_params.get("user_id", None)
76        if user_id:
77            queryset = queryset.filter(user_id=user_id)
78        return queryset
79REST_FRAMEWORK = {
80    "DEFAULT_PAGINATION_CLASS": "rest_framework.pagination.LimitOffsetPagination",
81    "DATETIME_FORMAT": "%m/%d/%Y - %I:%M:%S %p",
82    "DATE_INPUT_FORMATS": ["%Y-%m-%d"],
83    "DEFAULT_AUTHENTICATION_CLASSES": [
84        # Enabling this it will require Django Session (Including CSRF)
85        "rest_framework.authentication.SessionAuthentication"
86    ],
87    "DEFAULT_PERMISSION_CLASSES": [
88        # Globally only allow IsAuthenticated users access to API Endpoints
89        "rest_framework.permissions.IsAuthenticated"
90    ],
91}
92from django.test import TestCase, Client
93
94
95def TestCase():
96   client.login(username=self.username, password=self.password)
97

1class FutureVehicleURLTest(APILiveServerTestCase):
2    def setUp(self):
3        # Setup users and some vehicle data we can query against
4        management.call_command("create_users_and_vehicle_data", verbosity=0)
5        self.user = UserFactory()
6        self.admin_user = User.objects.get(username="adminuser")
7        self.future_vehicle = f.FutureVehicleFactory(
8            user=self.user,
9            last_updated_by=self.user,
10        )
11        self.vehicle = f.VehicleFactory(
12            user=self.user,
13            created_by=self.user,
14            modified_by=self.user,
15        )
16        self.url = reverse("FutureVehicles-list")
17        self.full_url = self.live_server_url + self.url
18        time = str(datetime.now())
19        self.form_data = {
20            "signature": "TT",
21            "purchasing": True,
22            "confirmed_at": time,
23        }
24    def test_patch_request_updates_object(self):
25        data_dict = {
26            "signature": "TT",
27            "purchasing": "true",
28            "confirmed_at": datetime.now().strftime("%m/%d/%Y, %H:%M:%S"),
29        }
30        url = self.full_url + str(self.future_vehicle.id) + "/"
31        client = requests.Session()
32        client.auth = HTTPBasicAuth(self.admin_user.username, "test")
33        client.headers.update({"x-test": "true"})
34        response = client.get(self.live_server_url + "/admin/")
35        csrftoken = response.cookies["csrftoken"]
36        # interact with the api
37        response = client.patch(
38            url,
39            data=json.dumps(data_dict),
40            cookies=response.cookies,
41            headers={
42                "X-Requested-With": "XMLHttpRequest",
43                "X-CSRFTOKEN": csrftoken,
44            },
45        )
46        # RESPONSE GIVES 403 PERMISSION DENIED
47        fte_future_vehicle = FutureVehicle.objects.filter(
48            id=self.future_vehicle.id
49        ).first()
50        # THIS ERRORS WITH '' not equal to 'TT'
51        self.assertEqual(fte_future_vehicle.signature, "TT")
52    def test_patch_request_updates_object(self):
53        data_dict = {
54            "signature": "TT",
55            "purchasing": "true",
56            "confirmed_at": datetime.now().strftime("%m/%d/%Y, %H:%M:%S"),
57        }
58        url = self.full_url + str(self.future_vehicle.id) + "/"
59        api_req_factory = APIRequestFactory()
60        view = FutureVehicleViewSet.as_view({"patch": "partial_update"})
61        api_request = api_req_factory.patch(
62            url, json.dumps(data_dict), content_type="application/json"
63        )
64        force_authenticate(api_request, self.admin_user)
65        response = view(api_request, pk=self.future_assignment.id)
66        fte_future_assignment = FutureVehicle.objects.filter(
67            id=self.future_assignment.id
68        ).first()
69        self.assertEqual(fte_future_assignment.signature, "TT")
70class FutureVehicleViewSet(ModelViewSet):
71    serializer_class = FutureVehicleSerializer
72
73    def get_queryset(self):
74        queryset = FutureVehicle.exclude_denied.all()
75        user_id = self.request.query_params.get("user_id", None)
76        if user_id:
77            queryset = queryset.filter(user_id=user_id)
78        return queryset
79REST_FRAMEWORK = {
80    "DEFAULT_PAGINATION_CLASS": "rest_framework.pagination.LimitOffsetPagination",
81    "DATETIME_FORMAT": "%m/%d/%Y - %I:%M:%S %p",
82    "DATE_INPUT_FORMATS": ["%Y-%m-%d"],
83    "DEFAULT_AUTHENTICATION_CLASSES": [
84        # Enabling this it will require Django Session (Including CSRF)
85        "rest_framework.authentication.SessionAuthentication"
86    ],
87    "DEFAULT_PERMISSION_CLASSES": [
88        # Globally only allow IsAuthenticated users access to API Endpoints
89        "rest_framework.permissions.IsAuthenticated"
90    ],
91}
92from django.test import TestCase, Client
93
94
95def TestCase():
96   client.login(username=self.username, password=self.password)
97    def login(self, **credentials):
98        """
99        Set the Factory to appear as if it has successfully logged into a site.
100        Return True if login is possible or False if the provided credentials
101        are incorrect.
102        """
103        from django.contrib.auth import authenticate
104        user = authenticate(**credentials)
105        if user:
106            self._login(user)
107            return True
108        return False
109
110    def force_login(self, user, backend=None):
111        def get_backend():
112            from django.contrib.auth import load_backend
113            for backend_path in settings.AUTHENTICATION_BACKENDS:
114                backend = load_backend(backend_path)
115                if hasattr(backend, 'get_user'):
116                    return backend_path
117
118        if backend is None:
119            backend = get_backend()
120        user.backend = backend
121        self._login(user, backend)
122
123    def _login(self, user, backend=None):
124        from django.contrib.auth import login
125
126        # Create a fake request to store login details.
127        request = HttpRequest()
128        if self.session:
129            request.session = self.session
130        else:
131            engine = import_module(settings.SESSION_ENGINE)
132            request.session = engine.SessionStore()
133        login(request, user, backend)
134        # Save the session values.
135        request.session.save()
136        # Set the cookie to represent the session.
137        session_cookie = settings.SESSION_COOKIE_NAME
138        self.cookies[session_cookie] = request.session.session_key
139        cookie_data = {
140            'max-age': None,
141            'path': '/',
142            'domain': settings.SESSION_COOKIE_DOMAIN,
143            'secure': settings.SESSION_COOKIE_SECURE or None,
144            'expires': None,
145        }
146        self.cookies[session_cookie].update(cookie_data)
147

1{-# OPTIONS_GHC -O2 #-}
2module CF1606D where
3import qualified Data.Text as T
4import qualified Data.Text.IO as TI
5import qualified Data.Text.Read as TR
6import Control.Monad
7import qualified Data.List as DL
8import qualified Data.IntSet as DS
9import Control.Monad.ST
10import Data.Array.ST.Safe
11import Data.Int (Int32)
12import Data.Array.Unboxed
13
14solve :: IO ()
15solve =  do
16  ~[n,m] <- readv      
17  -- 2D list
18  input <- {-# SCC input #-} replicateM (fromIntegral n) readv     
19  let
20      ints = [1..]
21      sorted = DL.sortOn (head.fst) (zip input ints)
22      (rows,indices) = {-# SCC rows_inds #-} unzip sorted    
23      -- 2D list converted into matrix:
24      matrix = mat (fromIntegral n) (fromIntegral m) rows           
25      infinite = 10^7
26      asc x y = [x,x+1..y]
27      desc x y = [y,y-1..x]    
28      -- Four prefix-matrices:
29      tlMax = runSTUArray $ prefixMat max 0 asc asc (subtract 1) (subtract 1) =<< matrix
30      blMin = runSTUArray $ prefixMat min infinite desc asc (+1) (subtract 1) =<< matrix
31      trMin = runSTUArray $ prefixMat min infinite asc desc (subtract 1) (+1) =<< matrix
32      brMax = runSTUArray $ prefixMat max 0 desc desc (+1) (+1) =<< matrix    
33      good _ (i,j)
34        | tlMax!(i,j) < blMin!(i+1,j) && brMax!(i+1,j+1) < trMin!(i,j+1) = Left (i,j)
35        | otherwise = Right ()
36      {-# INLINABLE good #-}
37      nearAns = foldM good () [(i,j)|i<-[1..n-1],j<-[1..m-1]]
38      ans = either (\(i,j)-> "YES\n" ++ color n (take i indices) ++ " " ++ show j) (const "NO") nearAns
39  putStrLn ans
40
41type I = Int32
42type S s = (STUArray s (Int, Int) I)
43type R = Int -> Int -> [Int]
44type F = Int -> Int
45
46mat :: Int -> Int -> [[I]] -> ST s (S s)
47mat n m rows = newListArray ((1,1),(n,m)) $ concat rows
48
49prefixMat :: (I->I->I) -> I -> R -> R -> F -> F -> S s -> ST s (S s)
50prefixMat opt worst ordi ordj previ prevj mat = do
51  ((ilo,jlo),(ihi,jhi)) <- getBounds mat
52  pre <- newArray ((ilo-1,jlo-1),(ihi+1,jhi+1)) worst
53  forM_ (ordi ilo ihi) $ \i-> do
54    forM_ (ordj jlo jhi) $ \j -> do
55      matij <- readArray mat (i,j)
56      prei <- readArray pre (previ i,j)
57      prej <- readArray pre (i, prevj j)
58      writeArray pre (i,j) (opt (opt prei prej) matij)
59  return pre
60
61color :: Int -> [Int] -> String
62color n inds = let
63  temp = DS.fromList inds
64  colors = [if DS.member i temp then 'B' else 'R' | i<-[1..n]]
65  in colors
66
67readv :: Integral t => IO [t]
68readv = map readInt . T.words <$> TI.getLine where
69  readInt = fromIntegral . either (const 0) fst . TR.signed TR.decimal
70{-# INLINABLE readv #-}
71
72main :: IO ()
73main = do
74  ~[n] <- readv
75  replicateM_ n solve
76> stack ghc -- -main-is CF1606D.main -with-rtsopts="-s -h -p -P" -rtsopts -prof -fprof-auto CF1606D
77> gtime -v ./CF1606D < inp3.txt > outp
78    ...
79    ...
80    MUT     time    2.990s  (  3.744s elapsed)    #    RTS -s output
81    GC      time    4.525s  (  6.231s elapsed)    #    RTS -s output
82    ...
83    ...
84    Maximum resident set size (kbytes): 408532    #    >256 MB (gtime output)
85
86> stack exec -- hp2ps -t0.1 -e8in -c CF1606D.hp && open CF1606D.ps
87   1,483,547,096 bytes allocated in the heap
88         566,448 bytes copied during GC
89      18,703,640 bytes maximum residency (3 sample(s))
90       1,223,400 bytes maximum slop
91              32 MiB total memory in use (0 MB lost due to fragmentation)
92
93                                     Tot time (elapsed)  Avg pause  Max pause
94  Gen  0      1399 colls,     0 par    0.009s   0.009s     0.0000s    0.0011s
95  Gen  1         3 colls,     0 par    0.002s   0.002s     0.0006s    0.0016s
96
97  TASKS: 4 (1 bound, 3 peak workers (3 total), using -N1)
98
99  SPARKS: 0 (0 converted, 0 overflowed, 0 dud, 0 GC'd, 0 fizzled)
100
101  INIT    time    0.001s  (  0.001s elapsed)
102  MUT     time    0.484s  (  0.517s elapsed)
103  GC      time    0.011s  (  0.011s elapsed)
104  EXIT    time    0.001s  (  0.002s elapsed)
105  Total   time    0.496s  (  0.530s elapsed)
106

1{-# OPTIONS_GHC -O2 #-}
2module CF1606D where
3import qualified Data.Text as T
4import qualified Data.Text.IO as TI
5import qualified Data.Text.Read as TR
6import Control.Monad
7import qualified Data.List as DL
8import qualified Data.IntSet as DS
9import Control.Monad.ST
10import Data.Array.ST.Safe
11import Data.Int (Int32)
12import Data.Array.Unboxed
13
14solve :: IO ()
15solve =  do
16  ~[n,m] <- readv      
17  -- 2D list
18  input <- {-# SCC input #-} replicateM (fromIntegral n) readv     
19  let
20      ints = [1..]
21      sorted = DL.sortOn (head.fst) (zip input ints)
22      (rows,indices) = {-# SCC rows_inds #-} unzip sorted    
23      -- 2D list converted into matrix:
24      matrix = mat (fromIntegral n) (fromIntegral m) rows           
25      infinite = 10^7
26      asc x y = [x,x+1..y]
27      desc x y = [y,y-1..x]    
28      -- Four prefix-matrices:
29      tlMax = runSTUArray $ prefixMat max 0 asc asc (subtract 1) (subtract 1) =<< matrix
30      blMin = runSTUArray $ prefixMat min infinite desc asc (+1) (subtract 1) =<< matrix
31      trMin = runSTUArray $ prefixMat min infinite asc desc (subtract 1) (+1) =<< matrix
32      brMax = runSTUArray $ prefixMat max 0 desc desc (+1) (+1) =<< matrix    
33      good _ (i,j)
34        | tlMax!(i,j) < blMin!(i+1,j) && brMax!(i+1,j+1) < trMin!(i,j+1) = Left (i,j)
35        | otherwise = Right ()
36      {-# INLINABLE good #-}
37      nearAns = foldM good () [(i,j)|i<-[1..n-1],j<-[1..m-1]]
38      ans = either (\(i,j)-> "YES\n" ++ color n (take i indices) ++ " " ++ show j) (const "NO") nearAns
39  putStrLn ans
40
41type I = Int32
42type S s = (STUArray s (Int, Int) I)
43type R = Int -> Int -> [Int]
44type F = Int -> Int
45
46mat :: Int -> Int -> [[I]] -> ST s (S s)
47mat n m rows = newListArray ((1,1),(n,m)) $ concat rows
48
49prefixMat :: (I->I->I) -> I -> R -> R -> F -> F -> S s -> ST s (S s)
50prefixMat opt worst ordi ordj previ prevj mat = do
51  ((ilo,jlo),(ihi,jhi)) <- getBounds mat
52  pre <- newArray ((ilo-1,jlo-1),(ihi+1,jhi+1)) worst
53  forM_ (ordi ilo ihi) $ \i-> do
54    forM_ (ordj jlo jhi) $ \j -> do
55      matij <- readArray mat (i,j)
56      prei <- readArray pre (previ i,j)
57      prej <- readArray pre (i, prevj j)
58      writeArray pre (i,j) (opt (opt prei prej) matij)
59  return pre
60
61color :: Int -> [Int] -> String
62color n inds = let
63  temp = DS.fromList inds
64  colors = [if DS.member i temp then 'B' else 'R' | i<-[1..n]]
65  in colors
66
67readv :: Integral t => IO [t]
68readv = map readInt . T.words <$> TI.getLine where
69  readInt = fromIntegral . either (const 0) fst . TR.signed TR.decimal
70{-# INLINABLE readv #-}
71
72main :: IO ()
73main = do
74  ~[n] <- readv
75  replicateM_ n solve
76> stack ghc -- -main-is CF1606D.main -with-rtsopts="-s -h -p -P" -rtsopts -prof -fprof-auto CF1606D
77> gtime -v ./CF1606D < inp3.txt > outp
78    ...
79    ...
80    MUT     time    2.990s  (  3.744s elapsed)    #    RTS -s output
81    GC      time    4.525s  (  6.231s elapsed)    #    RTS -s output
82    ...
83    ...
84    Maximum resident set size (kbytes): 408532    #    >256 MB (gtime output)
85
86> stack exec -- hp2ps -t0.1 -e8in -c CF1606D.hp && open CF1606D.ps
87   1,483,547,096 bytes allocated in the heap
88         566,448 bytes copied during GC
89      18,703,640 bytes maximum residency (3 sample(s))
90       1,223,400 bytes maximum slop
91              32 MiB total memory in use (0 MB lost due to fragmentation)
92
93                                     Tot time (elapsed)  Avg pause  Max pause
94  Gen  0      1399 colls,     0 par    0.009s   0.009s     0.0000s    0.0011s
95  Gen  1         3 colls,     0 par    0.002s   0.002s     0.0006s    0.0016s
96
97  TASKS: 4 (1 bound, 3 peak workers (3 total), using -N1)
98
99  SPARKS: 0 (0 converted, 0 overflowed, 0 dud, 0 GC'd, 0 fizzled)
100
101  INIT    time    0.001s  (  0.001s elapsed)
102  MUT     time    0.484s  (  0.517s elapsed)
103  GC      time    0.011s  (  0.011s elapsed)
104  EXIT    time    0.001s  (  0.002s elapsed)
105  Total   time    0.496s  (  0.530s elapsed)
106import Control.Monad.ST
107import Control.Monad
108import qualified Data.ByteString as BS
109import Data.Massiv.Array as A hiding (B)
110import Data.Massiv.Array.Mutable.Algorithms (quicksortByM_)
111import Control.Scheduler (trivialScheduler_)
112
113main :: IO ()
114main = do
115  t <- Prelude.read <$> getLine
116  when (t < 1 || t > 1000) $ error $ "Invalid t: " ++ show t
117  replicateM_ t $ do
118    dimsStr <- getLine
119    case Prelude.map Prelude.read (words dimsStr) of
120      -- Test file fails this check: && n * m <= 10 ^ (6 :: Int) -> do
121      [n, m] | n >= 2 && m > 0 && m <= 5 * 10 ^ (5 :: Int) -> do
122        mat <- readMatrix n m
123        case solve mat of
124          Nothing -> putStrLn "NO"
125          Just (ix, cs) -> do
126            putStrLn "YES"
127            putStr $ foldMap show cs
128            putStr " "
129            print ix
130      _ -> putStrLn $ "Unexpected dimensions: " ++ show dimsStr
131

1{-# OPTIONS_GHC -O2 #-}
2module CF1606D where
3import qualified Data.Text as T
4import qualified Data.Text.IO as TI
5import qualified Data.Text.Read as TR
6import Control.Monad
7import qualified Data.List as DL
8import qualified Data.IntSet as DS
9import Control.Monad.ST
10import Data.Array.ST.Safe
11import Data.Int (Int32)
12import Data.Array.Unboxed
13
14solve :: IO ()
15solve =  do
16  ~[n,m] <- readv      
17  -- 2D list
18  input <- {-# SCC input #-} replicateM (fromIntegral n) readv     
19  let
20      ints = [1..]
21      sorted = DL.sortOn (head.fst) (zip input ints)
22      (rows,indices) = {-# SCC rows_inds #-} unzip sorted    
23      -- 2D list converted into matrix:
24      matrix = mat (fromIntegral n) (fromIntegral m) rows           
25      infinite = 10^7
26      asc x y = [x,x+1..y]
27      desc x y = [y,y-1..x]    
28      -- Four prefix-matrices:
29      tlMax = runSTUArray $ prefixMat max 0 asc asc (subtract 1) (subtract 1) =<< matrix
30      blMin = runSTUArray $ prefixMat min infinite desc asc (+1) (subtract 1) =<< matrix
31      trMin = runSTUArray $ prefixMat min infinite asc desc (subtract 1) (+1) =<< matrix
32      brMax = runSTUArray $ prefixMat max 0 desc desc (+1) (+1) =<< matrix    
33      good _ (i,j)
34        | tlMax!(i,j) < blMin!(i+1,j) && brMax!(i+1,j+1) < trMin!(i,j+1) = Left (i,j)
35        | otherwise = Right ()
36      {-# INLINABLE good #-}
37      nearAns = foldM good () [(i,j)|i<-[1..n-1],j<-[1..m-1]]
38      ans = either (\(i,j)-> "YES\n" ++ color n (take i indices) ++ " " ++ show j) (const "NO") nearAns
39  putStrLn ans
40
41type I = Int32
42type S s = (STUArray s (Int, Int) I)
43type R = Int -> Int -> [Int]
44type F = Int -> Int
45
46mat :: Int -> Int -> [[I]] -> ST s (S s)
47mat n m rows = newListArray ((1,1),(n,m)) $ concat rows
48
49prefixMat :: (I->I->I) -> I -> R -> R -> F -> F -> S s -> ST s (S s)
50prefixMat opt worst ordi ordj previ prevj mat = do
51  ((ilo,jlo),(ihi,jhi)) <- getBounds mat
52  pre <- newArray ((ilo-1,jlo-1),(ihi+1,jhi+1)) worst
53  forM_ (ordi ilo ihi) $ \i-> do
54    forM_ (ordj jlo jhi) $ \j -> do
55      matij <- readArray mat (i,j)
56      prei <- readArray pre (previ i,j)
57      prej <- readArray pre (i, prevj j)
58      writeArray pre (i,j) (opt (opt prei prej) matij)
59  return pre
60
61color :: Int -> [Int] -> String
62color n inds = let
63  temp = DS.fromList inds
64  colors = [if DS.member i temp then 'B' else 'R' | i<-[1..n]]
65  in colors
66
67readv :: Integral t => IO [t]
68readv = map readInt . T.words <$> TI.getLine where
69  readInt = fromIntegral . either (const 0) fst . TR.signed TR.decimal
70{-# INLINABLE readv #-}
71
72main :: IO ()
73main = do
74  ~[n] <- readv
75  replicateM_ n solve
76> stack ghc -- -main-is CF1606D.main -with-rtsopts="-s -h -p -P" -rtsopts -prof -fprof-auto CF1606D
77> gtime -v ./CF1606D < inp3.txt > outp
78    ...
79    ...
80    MUT     time    2.990s  (  3.744s elapsed)    #    RTS -s output
81    GC      time    4.525s  (  6.231s elapsed)    #    RTS -s output
82    ...
83    ...
84    Maximum resident set size (kbytes): 408532    #    >256 MB (gtime output)
85
86> stack exec -- hp2ps -t0.1 -e8in -c CF1606D.hp && open CF1606D.ps
87   1,483,547,096 bytes allocated in the heap
88         566,448 bytes copied during GC
89      18,703,640 bytes maximum residency (3 sample(s))
90       1,223,400 bytes maximum slop
91              32 MiB total memory in use (0 MB lost due to fragmentation)
92
93                                     Tot time (elapsed)  Avg pause  Max pause
94  Gen  0      1399 colls,     0 par    0.009s   0.009s     0.0000s    0.0011s
95  Gen  1         3 colls,     0 par    0.002s   0.002s     0.0006s    0.0016s
96
97  TASKS: 4 (1 bound, 3 peak workers (3 total), using -N1)
98
99  SPARKS: 0 (0 converted, 0 overflowed, 0 dud, 0 GC'd, 0 fizzled)
100
101  INIT    time    0.001s  (  0.001s elapsed)
102  MUT     time    0.484s  (  0.517s elapsed)
103  GC      time    0.011s  (  0.011s elapsed)
104  EXIT    time    0.001s  (  0.002s elapsed)
105  Total   time    0.496s  (  0.530s elapsed)
106import Control.Monad.ST
107import Control.Monad
108import qualified Data.ByteString as BS
109import Data.Massiv.Array as A hiding (B)
110import Data.Massiv.Array.Mutable.Algorithms (quicksortByM_)
111import Control.Scheduler (trivialScheduler_)
112
113main :: IO ()
114main = do
115  t <- Prelude.read <$> getLine
116  when (t < 1 || t > 1000) $ error $ "Invalid t: " ++ show t
117  replicateM_ t $ do
118    dimsStr <- getLine
119    case Prelude.map Prelude.read (words dimsStr) of
120      -- Test file fails this check: && n * m <= 10 ^ (6 :: Int) -> do
121      [n, m] | n >= 2 && m > 0 && m <= 5 * 10 ^ (5 :: Int) -> do
122        mat <- readMatrix n m
123        case solve mat of
124          Nothing -> putStrLn "NO"
125          Just (ix, cs) -> do
126            putStrLn "YES"
127            putStr $ foldMap show cs
128            putStr " "
129            print ix
130      _ -> putStrLn $ "Unexpected dimensions: " ++ show dimsStr
131type Val = Word
132
133readMatrix :: Int -> Int -> IO (Matrix P Val)
134readMatrix n m = createArrayS_ (Sz2 n m) readMMatrix
135
136readMMatrix :: MMatrix RealWorld P Val -> IO ()
137readMMatrix mat =
138  loopM_ 0 (< n) (+ 1) $ \i -> do
139    line <- BS.getLine
140    --- ^ reads at most 10Mb because it is known that input will be at most
141    -- 5*10^5 Words: 19 digits max per Word and one for space: 5*10^5 * 20bytes
142    loopM 0 (< m) (+ 1) line $ \j bs ->
143      let (word, bs') = parseWord bs
144       in bs' <$ write_ mat (i :. j) word
145  where
146    Sz2 n m = sizeOfMArray mat
147    isSpace = (== 32)
148    isDigit w8 = w8 >= 48 && w8 <= 57
149    parseWord bs =
150      case BS.uncons bs of
151        Just (w8, bs')
152          | isDigit w8 -> parseWordLoop (fromIntegral (w8 - 48)) bs'
153          | otherwise -> error $ "Unexpected byte: " ++ show w8
154        Nothing -> error "Unexpected end of input"
155    parseWordLoop !acc bs =
156      case BS.uncons bs of
157        Nothing -> (acc, bs)
158        Just (w8, bs')
159          | isSpace w8 -> (acc, bs')
160          | isDigit w8 -> parseWordLoop (acc * 10 + fromIntegral (w8 - 48)) bs'
161          | otherwise -> error $ "Unexpected byte: " ++ show w8
162

1{-# OPTIONS_GHC -O2 #-}
2module CF1606D where
3import qualified Data.Text as T
4import qualified Data.Text.IO as TI
5import qualified Data.Text.Read as TR
6import Control.Monad
7import qualified Data.List as DL
8import qualified Data.IntSet as DS
9import Control.Monad.ST
10import Data.Array.ST.Safe
11import Data.Int (Int32)
12import Data.Array.Unboxed
13
14solve :: IO ()
15solve =  do
16  ~[n,m] <- readv      
17  -- 2D list
18  input <- {-# SCC input #-} replicateM (fromIntegral n) readv     
19  let
20      ints = [1..]
21      sorted = DL.sortOn (head.fst) (zip input ints)
22      (rows,indices) = {-# SCC rows_inds #-} unzip sorted    
23      -- 2D list converted into matrix:
24      matrix = mat (fromIntegral n) (fromIntegral m) rows           
25      infinite = 10^7
26      asc x y = [x,x+1..y]
27      desc x y = [y,y-1..x]    
28      -- Four prefix-matrices:
29      tlMax = runSTUArray $ prefixMat max 0 asc asc (subtract 1) (subtract 1) =<< matrix
30      blMin = runSTUArray $ prefixMat min infinite desc asc (+1) (subtract 1) =<< matrix
31      trMin = runSTUArray $ prefixMat min infinite asc desc (subtract 1) (+1) =<< matrix
32      brMax = runSTUArray $ prefixMat max 0 desc desc (+1) (+1) =<< matrix    
33      good _ (i,j)
34        | tlMax!(i,j) < blMin!(i+1,j) && brMax!(i+1,j+1) < trMin!(i,j+1) = Left (i,j)
35        | otherwise = Right ()
36      {-# INLINABLE good #-}
37      nearAns = foldM good () [(i,j)|i<-[1..n-1],j<-[1..m-1]]
38      ans = either (\(i,j)-> "YES\n" ++ color n (take i indices) ++ " " ++ show j) (const "NO") nearAns
39  putStrLn ans
40
41type I = Int32
42type S s = (STUArray s (Int, Int) I)
43type R = Int -> Int -> [Int]
44type F = Int -> Int
45
46mat :: Int -> Int -> [[I]] -> ST s (S s)
47mat n m rows = newListArray ((1,1),(n,m)) $ concat rows
48
49prefixMat :: (I->I->I) -> I -> R -> R -> F -> F -> S s -> ST s (S s)
50prefixMat opt worst ordi ordj previ prevj mat = do
51  ((ilo,jlo),(ihi,jhi)) <- getBounds mat
52  pre <- newArray ((ilo-1,jlo-1),(ihi+1,jhi+1)) worst
53  forM_ (ordi ilo ihi) $ \i-> do
54    forM_ (ordj jlo jhi) $ \j -> do
55      matij <- readArray mat (i,j)
56      prei <- readArray pre (previ i,j)
57      prej <- readArray pre (i, prevj j)
58      writeArray pre (i,j) (opt (opt prei prej) matij)
59  return pre
60
61color :: Int -> [Int] -> String
62color n inds = let
63  temp = DS.fromList inds
64  colors = [if DS.member i temp then 'B' else 'R' | i<-[1..n]]
65  in colors
66
67readv :: Integral t => IO [t]
68readv = map readInt . T.words <$> TI.getLine where
69  readInt = fromIntegral . either (const 0) fst . TR.signed TR.decimal
70{-# INLINABLE readv #-}
71
72main :: IO ()
73main = do
74  ~[n] <- readv
75  replicateM_ n solve
76> stack ghc -- -main-is CF1606D.main -with-rtsopts="-s -h -p -P" -rtsopts -prof -fprof-auto CF1606D
77> gtime -v ./CF1606D < inp3.txt > outp
78    ...
79    ...
80    MUT     time    2.990s  (  3.744s elapsed)    #    RTS -s output
81    GC      time    4.525s  (  6.231s elapsed)    #    RTS -s output
82    ...
83    ...
84    Maximum resident set size (kbytes): 408532    #    >256 MB (gtime output)
85
86> stack exec -- hp2ps -t0.1 -e8in -c CF1606D.hp && open CF1606D.ps
87   1,483,547,096 bytes allocated in the heap
88         566,448 bytes copied during GC
89      18,703,640 bytes maximum residency (3 sample(s))
90       1,223,400 bytes maximum slop
91              32 MiB total memory in use (0 MB lost due to fragmentation)
92
93                                     Tot time (elapsed)  Avg pause  Max pause
94  Gen  0      1399 colls,     0 par    0.009s   0.009s     0.0000s    0.0011s
95  Gen  1         3 colls,     0 par    0.002s   0.002s     0.0006s    0.0016s
96
97  TASKS: 4 (1 bound, 3 peak workers (3 total), using -N1)
98
99  SPARKS: 0 (0 converted, 0 overflowed, 0 dud, 0 GC'd, 0 fizzled)
100
101  INIT    time    0.001s  (  0.001s elapsed)
102  MUT     time    0.484s  (  0.517s elapsed)
103  GC      time    0.011s  (  0.011s elapsed)
104  EXIT    time    0.001s  (  0.002s elapsed)
105  Total   time    0.496s  (  0.530s elapsed)
106import Control.Monad.ST
107import Control.Monad
108import qualified Data.ByteString as BS
109import Data.Massiv.Array as A hiding (B)
110import Data.Massiv.Array.Mutable.Algorithms (quicksortByM_)
111import Control.Scheduler (trivialScheduler_)
112
113main :: IO ()
114main = do
115  t <- Prelude.read <$> getLine
116  when (t < 1 || t > 1000) $ error $ "Invalid t: " ++ show t
117  replicateM_ t $ do
118    dimsStr <- getLine
119    case Prelude.map Prelude.read (words dimsStr) of
120      -- Test file fails this check: && n * m <= 10 ^ (6 :: Int) -> do
121      [n, m] | n >= 2 && m > 0 && m <= 5 * 10 ^ (5 :: Int) -> do
122        mat <- readMatrix n m
123        case solve mat of
124          Nothing -> putStrLn "NO"
125          Just (ix, cs) -> do
126            putStrLn "YES"
127            putStr $ foldMap show cs
128            putStr " "
129            print ix
130      _ -> putStrLn $ "Unexpected dimensions: " ++ show dimsStr
131type Val = Word
132
133readMatrix :: Int -> Int -> IO (Matrix P Val)
134readMatrix n m = createArrayS_ (Sz2 n m) readMMatrix
135
136readMMatrix :: MMatrix RealWorld P Val -> IO ()
137readMMatrix mat =
138  loopM_ 0 (< n) (+ 1) $ \i -> do
139    line <- BS.getLine
140    --- ^ reads at most 10Mb because it is known that input will be at most
141    -- 5*10^5 Words: 19 digits max per Word and one for space: 5*10^5 * 20bytes
142    loopM 0 (< m) (+ 1) line $ \j bs ->
143      let (word, bs') = parseWord bs
144       in bs' <$ write_ mat (i :. j) word
145  where
146    Sz2 n m = sizeOfMArray mat
147    isSpace = (== 32)
148    isDigit w8 = w8 >= 48 && w8 <= 57
149    parseWord bs =
150      case BS.uncons bs of
151        Just (w8, bs')
152          | isDigit w8 -> parseWordLoop (fromIntegral (w8 - 48)) bs'
153          | otherwise -> error $ "Unexpected byte: " ++ show w8
154        Nothing -> error "Unexpected end of input"
155    parseWordLoop !acc bs =
156      case BS.uncons bs of
157        Nothing -> (acc, bs)
158        Just (w8, bs')
159          | isSpace w8 -> (acc, bs')
160          | isDigit w8 -> parseWordLoop (acc * 10 + fromIntegral (w8 - 48)) bs'
161          | otherwise -> error $ "Unexpected byte: " ++ show w8
162computeSortBy ::
163     (Load r Ix1 e, Manifest r' e)
164  => (e -> e -> Ordering)
165  -> Vector r e
166  -> Vector r' e
167computeSortBy f vec = 
168  withLoadMArrayST_ vec $ quicksortByM_ (\x y -> pure $ f x y) trivialScheduler_
169
170solve :: Matrix P Val -> Maybe (Int, [Color])
171solve a = runST $ do
172  let sz@(Sz2 n m) = size a
173      ord :: Vector P Int
174      ord = computeSortBy 
175              (\x y -> compare (a ! (y :. 0)) (a ! (x :. 0))) (0 ..: n)
176  mxl <- newMArray @P sz minBound
177  loopM_ (n - 1) (>= 0) (subtract 1) $ \ i ->
178    loopM_ 0 (< m) (+ 1) $ \j -> do
179      writeM mxl (i :. j) (a ! ((ord ! i) :. j))
180      when (i < n - 1) $
181        writeM mxl (i :. j) 
182          =<< max <$> readM mxl (i :. j) <*> readM mxl (i + 1 :. j)
183      when (j > 0) $
184        writeM mxl (i :. j) 
185          =<< max <$> readM mxl (i :. j) <*> readM mxl (i :. j - 1)
186  mnr <- newMArray @P sz maxBound
187  loopM_ (n - 1) (>= 0) (subtract 1) $ \ i ->
188    loopM_ (m - 1) (>= 0) (subtract 1) $ \ j -> do
189      writeM mnr (i :. j) (a ! ((ord ! i) :. j))
190      when (i < n - 1) $
191        writeM mnr (i :. j) 
192          =<< min <$> readM mnr (i :. j) <*> readM mnr (i + 1 :. j)
193      when (j < m - 1) $
194        writeM mnr (i :. j) 
195          =<< min <$> readM mnr (i :. j) <*> readM mnr (i :. j + 1)
196  mnl <- newMArray @P (Sz m) maxBound
197  mxr <- newMArray @P (Sz m) minBound
198  let goI i
199        | i < n - 1 = do
200          loopM_ 0 (< m) (+ 1) $ \j -> do
201            val <- min (a ! ((ord ! i) :. j)) <$> readM mnl j
202            writeM mnl j val
203            when (j > 0) $
204              writeM mnl j . min val =<< readM mnl (j - 1)
205          loopM_ (m - 1) (>= 0) (subtract 1) $ \j -> do
206            val <- max (a ! ((ord ! i) :. j)) <$> readM mxr j
207            writeM mxr j val
208            when (j < m - 1) $
209              writeM mxr j . max val =<< readM mxr (j + 1)
210          let goJ j
211                | j < m - 1 = do
212                    mnlVal <- readM mnl j
213                    mxlVal <- readM mxl (i + 1 :. j)
214                    mxrVal <- readM mxr (j + 1)
215                    mnrVal <- readM mnr ((i + 1) :. (j + 1))
216                    if mnlVal > mxlVal && mxrVal < mnrVal
217                      then pure $ Just (i, j)
218                      else goJ (j + 1)
219                | otherwise = pure Nothing
220          goJ 0 >>= \case
221            Nothing -> goI (i + 1)
222            Just pair -> pure $ Just pair
223        | otherwise = pure Nothing
224  mAns <- goI 0
225  Control.Monad.forM mAns $ \ (ansFirst, ansSecond) -> do
226    resVec <- createArrayS_ @BL (Sz n) $ \res ->
227        iforM_ ord $ \i ordIx -> do
228          writeM res ordIx $! if i <= ansFirst then R else B
229    pure (ansSecond + 1, A.toList resVec)
230

1interface IPerson {
2    name: string;
3    age: number;
4    contact: {
5        address: string;
6        visitDate: Date;
7    }
8}
9type TPerson = {
10    name: string;
11    age: number;
12    contact: { address: string; visitDate: Date; }
13    "contact.address": string;
14    "contact.visitDate": Date;
15}
16interface IPerson {
17    contact: {
18        address: string;
19        visitDate: Date;
20    }[]
21}
22type TPerson = {
23    [x: `contact.${number}.address`]: string;
24    [x: `contact.${number}.visitDate`]: Date;
25    contact: {
26        address: string;
27        visitDate: Date;
28    }[];
29}
30interface IPerson {
31    contact: [string, Date]
32}
33type TPerson = {
34    [x: `contact.0`]: string;
35    [x: `contact.1`]: Date;
36    contact: [string, Date];
37}
38interface IPerson {
39    readonly _id: string;
40    age: number;
41    readonly _created_date: Date;
42}
43type TPerson = {
44    age: number;
45}
46interface IPerson {
47    contact: {
48        address: string;
49        visitDate?: Date;
50    }[];        
51}
52type TPerson = {
53    [x: `contact.${number}.address`]: string;
54    [x: `contact.${number}.visitDate`]?: Date;
55    contact: {
56        address: string;
57        visitDate?: Date;
58    }[];
59}
60interface IPerson {
61    contact: { address: string; } & { visitDate: Date; }
62}
63type TPerson = {
64    [x: `contact.address`]: string;
65    [x: `contact.visitDate`]?: Date;
66    contact: { address: string; } & { visitDate: Date; }
67}
68interface IPerson {
69    birth: Date;
70}
71type TPerson = {
72    birth: Date;
73}
74type TPerson = {
75    age: Date;
76    "age.toDateString": () => string;
77    "age.toTimeString": () => string;
78    "age.toLocaleDateString": {
79    ...
80}
81type Structure = {
82    user: {
83        name: string,
84        surname: string
85    }
86}
87
88type BlackMagic<T>= T
89
90// user.name | user.surname
91type Result=BlackMagic<Structure>
92

1interface IPerson {
2    name: string;
3    age: number;
4    contact: {
5        address: string;
6        visitDate: Date;
7    }
8}
9type TPerson = {
10    name: string;
11    age: number;
12    contact: { address: string; visitDate: Date; }
13    "contact.address": string;
14    "contact.visitDate": Date;
15}
16interface IPerson {
17    contact: {
18        address: string;
19        visitDate: Date;
20    }[]
21}
22type TPerson = {
23    [x: `contact.${number}.address`]: string;
24    [x: `contact.${number}.visitDate`]: Date;
25    contact: {
26        address: string;
27        visitDate: Date;
28    }[];
29}
30interface IPerson {
31    contact: [string, Date]
32}
33type TPerson = {
34    [x: `contact.0`]: string;
35    [x: `contact.1`]: Date;
36    contact: [string, Date];
37}
38interface IPerson {
39    readonly _id: string;
40    age: number;
41    readonly _created_date: Date;
42}
43type TPerson = {
44    age: number;
45}
46interface IPerson {
47    contact: {
48        address: string;
49        visitDate?: Date;
50    }[];        
51}
52type TPerson = {
53    [x: `contact.${number}.address`]: string;
54    [x: `contact.${number}.visitDate`]?: Date;
55    contact: {
56        address: string;
57        visitDate?: Date;
58    }[];
59}
60interface IPerson {
61    contact: { address: string; } & { visitDate: Date; }
62}
63type TPerson = {
64    [x: `contact.address`]: string;
65    [x: `contact.visitDate`]?: Date;
66    contact: { address: string; } & { visitDate: Date; }
67}
68interface IPerson {
69    birth: Date;
70}
71type TPerson = {
72    birth: Date;
73}
74type TPerson = {
75    age: Date;
76    "age.toDateString": () => string;
77    "age.toTimeString": () => string;
78    "age.toLocaleDateString": {
79    ...
80}
81type Structure = {
82    user: {
83        name: string,
84        surname: string
85    }
86}
87
88type BlackMagic<T>= T
89
90// user.name | user.surname
91type Result=BlackMagic<Structure>
92type Structure = {
93    user: {
94        arr: [1, 2],
95    }
96}
97
98type BlackMagic<T> = T
99
100// "user.arr" | "user.arr.0" | "user.arr.1"
101type Result = BlackMagic<Structure>
102

1interface IPerson {
2    name: string;
3    age: number;
4    contact: {
5        address: string;
6        visitDate: Date;
7    }
8}
9type TPerson = {
10    name: string;
11    age: number;
12    contact: { address: string; visitDate: Date; }
13    "contact.address": string;
14    "contact.visitDate": Date;
15}
16interface IPerson {
17    contact: {
18        address: string;
19        visitDate: Date;
20    }[]
21}
22type TPerson = {
23    [x: `contact.${number}.address`]: string;
24    [x: `contact.${number}.visitDate`]: Date;