— Dark mode

BOI 2026 Mirror Day 2

Sort

  • Start: 2026-04-17 10:00:00
  • End: 2026-04-17 15:00:00
Submission details
Task:Sort
Sender:jsesok
Submission time:2026-10-01 16:32:19 +0300
Language:C++ (C++23)
Status:READY
Result:53
Feedback
subtaskverdictscore
#1ACCEPTED6
#2ACCEPTED5
#3ACCEPTED7
#40
#5ACCEPTED23
#6ACCEPTED12
#70
Test results
testverdicttimesubtask
#1ACCEPTED0.00 s2, 6, 7details
#2ACCEPTED0.00 s1, 2, 3, 6, 7details
#3ACCEPTED0.00 s2, 6, 7details
#4ACCEPTED0.00 s1, 2, 3, 6, 7details
#5ACCEPTED0.00 s1, 2, 3, 6, 7details
#6ACCEPTED0.00 s1, 2, 3, 6, 7details
#7ACCEPTED0.00 s1, 2, 3, 6, 7details
#8ACCEPTED0.00 s1, 2, 3, 6, 7details
#9ACCEPTED0.00 s1, 2, 3, 6, 7details
#10ACCEPTED0.00 s1, 2, 3, 6, 7details
#11ACCEPTED0.00 s2, 6, 7details
#12ACCEPTED0.00 s2, 6, 7details
#13ACCEPTED0.00 s2, 6, 7details
#14ACCEPTED0.00 s2, 6, 7details
#15ACCEPTED0.00 s2, 6, 7details
#16ACCEPTED0.37 s3, 7details
#17ACCEPTED0.39 s3, 7details
#18ACCEPTED0.43 s3, 7details
#19ACCEPTED0.34 s3, 7details
#20ACCEPTED0.34 s3, 7details
#21ACCEPTED0.29 s3, 7details
#22ACCEPTED0.32 s3, 7details
#23ACCEPTED0.34 s3, 7details
#24--4, 7details
#25--4, 7details
#26--4, 7details
#27--4, 7details
#28ACCEPTED0.36 s4, 7details
#29ACCEPTED0.35 s4, 7details
#30ACCEPTED0.05 s5, 6, 7details
#31ACCEPTED0.06 s5, 6, 7details
#32ACCEPTED0.06 s5, 6, 7details
#33ACCEPTED0.08 s5, 6, 7details
#34ACCEPTED0.05 s5, 6, 7details
#35ACCEPTED0.01 s5, 6, 7details
#36ACCEPTED0.06 s6, 7details
#37ACCEPTED0.06 s6, 7details
#38ACCEPTED0.08 s6, 7details
#39ACCEPTED0.08 s6, 7details
#40ACCEPTED0.05 s6, 7details
#41ACCEPTED0.01 s6, 7details
#42--7details
#43--7details
#44--7details
#45--7details
#46--7details
#47--7details
#48--7details
#49--7details
#50ACCEPTED0.41 s7details
#51ACCEPTED0.38 s7details
#52ACCEPTED0.00 s1, 2, 3, 5, 6, 7details
#53ACCEPTED0.00 s1, 2, 3, 4, 5, 6, 7details
#54ACCEPTED0.00 s2, 5, 6, 7details
#55ACCEPTED0.00 s1, 2, 3, 4, 6, 7details
#56ACCEPTED0.00 s1, 2, 3, 6, 7details
#57ACCEPTED0.00 s6, 7details
#58ACCEPTED0.03 s3, 4, 7details
#59ACCEPTED0.03 s3, 7details
#60ACCEPTED0.00 s2, 6, 7details
#61ACCEPTED0.00 s2, 6, 7details
#62ACCEPTED0.00 s2, 6, 7details
#63ACCEPTED0.00 s2, 6, 7details
#64ACCEPTED0.00 s2, 6, 7details

Compiler report

input/code.cpp: In function 'int main()':
input/code.cpp:55:15: warning: unused variable 'm' [-Wunused-variable]
   55 |     int n, q, m, p, s, l=-1, sum, ba, bb, bam, bbm, d, can, sq, left, right, si, per, ud;
      |               ^
input/code.cpp:55:56: warning: unused variable 'can' [-Wunused-variable]
   55 |     int n, q, m, p, s, l=-1, sum, ba, bb, bam, bbm, d, can, sq, left, right, si, per, ud;
      |                                                        ^~~

Code

#include <iostream>
#include <numeric>
#include <iomanip>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <algorithm>
#include <queue>
#include <random>
#include <cassert>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
template<typename T>
using ordered_set = tree<
    T,
    null_type,
    less<T>,
    rb_tree_tag,
    tree_order_statistics_node_update
>;
int cal(int ba, int bb, int bam, int bbm, int d)
{
    bb-=bbm;
    ba-=d;
    if (max(ba, bb)<=0)
    {
        return 2;
    }
    ba=(ba+d-1)/d;
    bb=(bb+d-1)/d;
    if (bb<=ba)
    {
        return 2+ba*2;
    }
    else if (bb==ba+1)
    {
        return 2+2*bb-1;
    }
    else
    {
        return 2+bb*2;
    }
}
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int n, q, m, p, s, l=-1, sum, ba, bb, bam, bbm, d, can, sq, left, right, si, per, ud;
    cin>>n>>q;
    sq=sqrt(n);
    vector<int> ma(n), mi(n), a(n), r(n+1), kop, sor, ans(q), kiek, kiek2(n);
    ordered_set<int> num;
    vector<pair<int, int>> v;
    vector<tuple<int, int, int, int>> mo;
    for (int i=0; i<n; ++i)
    {
        cin>>a[i];
        v.push_back({a[i], i});
    }
    sort(v.begin(), v.end());
    for (int i=0; i<n; ++i)
    {
        a[v[i].second]=i+1;
    }
    for (int i=0; i<n; ++i)
    {
        num.insert(a[i]);
        kiek.push_back(i-num.order_of_key(i+2)+1);
    }
    num={};
    for (int i=n-1; i>=0; --i)
    {
        num.insert(a[i]);
        kiek2[i]=num.order_of_key(i+1);
    }
    kop=a;
    sor=a;
    sort(sor.begin(), sor.end());
    ma[0]=a[0];
    for (int i=1; i<n; ++i)
        ma[i]=max(a[i], ma[i-1]);
    mi[n-1]=a[n-1];
    for (int i=n-2; i>=0; --i)
    {
        mi[i]=min(a[i], mi[i+1]);
    }
    for (int i=0; i<n; ++i)
    {
        if (l>=i)
        {
            r[i]=l;
        }
        else
        {
            l=i;
            for (int j=i+1; j<n; ++j)
            {
                if (a[j-1]>a[j])
                    break;
                l=j;
            }
            r[i]=l;
        }
    }
    r[n]=n-1;
    for (int j=0; j<q; ++j)
    {
        cin>>p>>s;
        if (p+s<=n)
        {
            sum=0;
            if (ma[p-1]>mi[p] || r[p]<n-s-1 || mi[n-s]<ma[n-s-1])
            {
                ans[j]=-1;
                continue;
            }
            if (r[0]<p-1)
                sum+=1;
            if (r[n-s]!=n-1)
                sum+=1;
            ans[j]=sum;
        }
        else
        {
            mo.push_back({(n-s)/sq, p, s, j});
        }
    }
    sort(mo.begin(), mo.end());
    num={};
    si=(int) mo.size();
    for (int i=0; i<si; ++i)
    {
        p=get<1>(mo[i]);
        s=get<2>(mo[i]);
        if (i!=0)
        {
            per=max(0, min(right, p)-max(left, n-s));
            ud=max(0, n-s-left)+max(0, right-p);
        }
        if (i==0)
        {
            left=n-s;
            right=p;
            for (int j=n-s; j<p; ++j)
            {
                num.insert(a[j]);
            }
        }
        else if (p<=left || n-s>=right || ud>per)
        {
            num={};
            left=n-s;
            right=p;
            for (int j=n-s; j<p; ++j)
            {
                num.insert(a[j]);
            }
        }
        else
        {
            if (left>n-s)
            {
                for (int j=n-s; j<left; ++j)
                {
                    num.insert(a[j]);
                }
            }
            else
            {
                for (int j=left; j<n-s; ++j)
                {
                    num.erase(a[j]);
                }
            }
            if (right>p)
            {
                for (int j=p; j<right; ++j)
                {
                    num.erase(a[j]);
                }
            }
            else
            {
                for (int j=right; j<p; ++j)
                {
                    num.insert(a[j]);
                }
            }
            left=n-s;
            right=p;
        }
        if (r[0]==n-1)
        {
            ans[get<3>(mo[i])]=0;
            continue;
        }
        if (p==n || s==n)
        {
            ans[get<3>(mo[i])]=1;
            continue;
        }
        if ((kiek[n-s-1]==0 && r[0]>=n-s-1) || (kiek2[p]==0 && r[p]==n-1))
        {
            ans[get<3>(mo[i])]=1;
            continue;
        }
        d=s+p-n;
        ba=kiek[p-1];
        bb=kiek2[n-s];
        bam=d-num.order_of_key(p+1);
        bbm=num.order_of_key(n-s+1);
        ans[get<3>(mo[i])]=min(cal(ba, bb, bam, bbm, d), cal(bb, ba, bbm, bam, d));
    }
    for (int i=0; i<q; ++i)
    {
        cout<<ans[i]<<"\n";
    }
    return 0;
}

Test details

Test 1

Subtask: 2, 6, 7

Verdict: ACCEPTED

input
6 3
3 1 4 1 5 9
4 1
3 3
2 5
view save

correct output
1
-1
2
view save

user output
1
-1
2
view save

Test 2

Subtask: 1, 2, 3, 6, 7

Verdict: ACCEPTED

input
2 1
548813503 548813503
1 1
view save

correct output
0
view save

user output
0
view save

Test 3

Subtask: 2, 6, 7

Verdict: ACCEPTED

input
1 1
417021999
1 1
view save

correct output
0
view save

user output
0
view save

Test 4

Subtask: 1, 2, 3, 6, 7

Verdict: ACCEPTED

input
10 10
20751947 20751947 20751947 494...
view save

correct output
-1
-1
1
1
-1
...
view save

user output
-1
-1
1
1
-1
...
view save

Test 5

Subtask: 1, 2, 3, 6, 7

Verdict: ACCEPTED

input
10 10
12780811 19475241 19475241 683...
view save

correct output
0
0
0
0
0
...
view save

user output
0
0
0
0
0
...
view save

Test 6

Subtask: 1, 2, 3, 6, 7

Verdict: ACCEPTED

input
10 10
14574963 14574963 14574963 864...
view save

correct output
0
0
0
0
0
...
view save

user output
0
0
0
0
0
...
view save

Test 7

Subtask: 1, 2, 3, 6, 7

Verdict: ACCEPTED

input
10 10
237541216 237541216 35036522 6...
view save

correct output
-1
-1
-1
2
-1
...
view save

user output
-1
-1
-1
2
-1
...
view save

Test 8

Subtask: 1, 2, 3, 6, 7

Verdict: ACCEPTED

input
10 10
319425549 513116712 539199939 ...
view save

correct output
-1
-1
-1
-1
-1
...
view save

user output
-1
-1
-1
-1
-1
...
view save

Test 9

Subtask: 1, 2, 3, 6, 7

Verdict: ACCEPTED

input
10 10
54363219 54363219 110986323 11...
view save

correct output
0
0
0
0
0
...
view save

user output
0
0
0
0
0
...
view save

Test 10

Subtask: 1, 2, 3, 6, 7

Verdict: ACCEPTED

input
10 5
55687086 550701455 326656159 5...
view save

correct output
-1
-1
-1
-1
-1
view save

user output
-1
-1
-1
-1
-1
view save

Test 11

Subtask: 2, 6, 7

Verdict: ACCEPTED

input
10 10
35889584 588130796 815837475 8...
view save

correct output
-1
-1
1
1
1
...
view save

user output
-1
-1
1
1
1
...
view save

Test 12

Subtask: 2, 6, 7

Verdict: ACCEPTED

input
10 10
679842175 48724877 720966351 6...
view save

correct output
2
3
2
1
1
...
view save

user output
2
3
2
1
1
...
view save

Test 13

Subtask: 2, 6, 7

Verdict: ACCEPTED

input
10 10
893310183 811950921 338863962 ...
view save

correct output
2
1
1
2
5
...
view save

user output
2
1
1
2
5
...
view save

Test 14

Subtask: 2, 6, 7

Verdict: ACCEPTED

input
10 10
221045363 282395847 441913686 ...
view save

correct output
0
0
0
0
0
...
view save

user output
0
0
0
0
0
...
view save

Test 15

Subtask: 2, 6, 7

Verdict: ACCEPTED

input
10 10
509019662 983949268 960017302 ...
view save

correct output
3
-1
3
3
3
...
view save

user output
3
-1
3
3
3
...
view save

Test 16

Subtask: 3, 7

Verdict: ACCEPTED

input
200000 200000
2277053 2277053 2277053 227705...
view save

correct output
-1
-1
-1
-1
-1
...
view save

user output
-1
-1
-1
-1
-1
...
view save

Test 17

Subtask: 3, 7

Verdict: ACCEPTED

input
200000 200000
6767 16596 16596 27202 37272 4...
view save

correct output
-1
-1
-1
-1
-1
...
view save

user output
-1
-1
-1
-1
-1
...
view save

Test 18

Subtask: 3, 7

Verdict: ACCEPTED

input
200000 200000
5393 5910 9099 15755 15755 164...
view save

correct output
-1
-1
-1
-1
-1
...
view save

user output
-1
-1
-1
-1
-1
...
view save

Test 19

Subtask: 3, 7

Verdict: ACCEPTED

input
200000 200000
3779 4629 8999 10468 22605 227...
view save

correct output
-1
1
2
-1
-1
...
view save

user output
-1
1
2
-1
-1
...
view save

Test 20

Subtask: 3, 7

Verdict: ACCEPTED

input
200000 200000
878 2791 10849 11861 13405 239...
view save

correct output
-1
-1
-1
-1
-1
...
view save

user output
-1
-1
-1
-1
-1
...
view save

Test 21

Subtask: 3, 7

Verdict: ACCEPTED

input
200000 200000
430 1479 1992 2829 7152 14093 ...
view save

correct output
-1
-1
-1
-1
-1
...
view save

user output
-1
-1
-1
-1
-1
...
view save

Test 22

Subtask: 3, 7

Verdict: ACCEPTED

input
199997 200000
2733 10526 13882 14035 14689 3...
view save

correct output
-1
-1
-1
-1
-1
...
view save

user output
-1
-1
-1
-1
-1
...
view save

Test 23

Subtask: 3, 7

Verdict: ACCEPTED

input
200000 200000
12345 13538 15407 18490 18984 ...
view save

correct output
0
0
0
0
0
...
view save

user output
0
0
0
0
0
...
view save

Test 24

Subtask: 4, 7

Verdict:

input
200000 200000
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...
view save

correct output
-1
1
-1
-1
-1
...
view save

user output
(empty)

Test 25

Subtask: 4, 7

Verdict:

input
200000 200000
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...
view save

correct output
1
-1
1
-1
1
...
view save

user output
(empty)

Test 26

Subtask: 4, 7

Verdict:

input
200000 200000
2 2 1 1 2 1 2 1 2 2 2 1 1 1 2 ...
view save

correct output
4
3
2
2
6
...
view save

user output
(empty)

Test 27

Subtask: 4, 7

Verdict:

input
200000 200000
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...
view save

correct output
0
0
0
0
0
...
view save

user output
(empty)

Test 28

Subtask: 4, 7

Verdict: ACCEPTED

input
200000 200000
2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 ...
view save

correct output
8513
1099
35939
9299
19597
...
view save

user output
8513
1099
35939
9299
19597
...
view save

Test 29

Subtask: 4, 7

Verdict: ACCEPTED

input
200000 200000
2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 ...
view save

correct output
178345
169257
62115
96143
64796
...
view save

user output
178345
169257
62115
96143
64796
...
view save

Test 30

Subtask: 5, 6, 7

Verdict: ACCEPTED

input
5000 5000
1 2 3 4 5 6 7 8 9 10 11 12 13 ...
view save

correct output
1
1
-1
1
-1
...
view save

user output
1
1
-1
1
-1
...
view save

Test 31

Subtask: 5, 6, 7

Verdict: ACCEPTED

input
5000 5000
1 2 3 4 5 6 7 8 9 72 145 47 19...
view save

correct output
-1
2
-1
2
-1
...
view save

user output
-1
2
-1
2
-1
...
view save

Test 32

Subtask: 5, 6, 7

Verdict: ACCEPTED

input
4999 5000
1 2 3 4 5 6 7 8 9 10 11 12 13 ...
view save

correct output
-1
2
-1
-1
-1
...
view save

user output
-1
2
-1
-1
-1
...
view save

Test 33

Subtask: 5, 6, 7

Verdict: ACCEPTED

input
5000 5000
4033 4368 3086 3208 4313 388 8...
view save

correct output
3
3
3
3
11
...
view save

user output
3
3
3
3
11
...
view save

Test 34

Subtask: 5, 6, 7

Verdict: ACCEPTED

input
5000 5000
1 2 3 4 5 6 7 8 9 10 11 12 13 ...
view save

correct output
0
0
0
0
0
...
view save

user output
0
0
0
0
0
...
view save

Test 35

Subtask: 5, 6, 7

Verdict: ACCEPTED

input
5000 5000
5000 4999 4998 4997 4996 4995 ...
view save

correct output
2039
1910
-1
687
673
...
view save

user output
2039
1910
-1
687
673
...
view save

Test 36

Subtask: 6, 7

Verdict: ACCEPTED

input
5000 5000
202010 457852 826471 926337 10...
view save

correct output
-1
-1
2
-1
-1
...
view save

user output
-1
-1
2
-1
-1
...
view save

Test 37

Subtask: 6, 7

Verdict: ACCEPTED

input
5000 5000
190583 326486 431922 462939 72...
view save

correct output
-1
-1
-1
-1
2
...
view save

user output
-1
-1
-1
-1
2
...
view save

Test 38

Subtask: 6, 7

Verdict: ACCEPTED

input
5000 5000
821998255 400550008 71790232 5...
view save

correct output
5
3
3
2
5
...
view save

user output
5
3
3
2
5
...
view save

Test 39

Subtask: 6, 7

Verdict: ACCEPTED

input
5000 5000
266174928 446601941 191252234 ...
view save

correct output
3
3
414
4
3
...
view save

user output
3
3
414
4
3
...
view save

Test 40

Subtask: 6, 7

Verdict: ACCEPTED

input
5000 5000
11621 243915 243915 949123 137...
view save

correct output
0
0
0
0
0
...
view save

user output
0
0
0
0
0
...
view save

Test 41

Subtask: 6, 7

Verdict: ACCEPTED

input
5000 5000
999767052 998555066 997822810 ...
view save

correct output
919
459
505
833
809
...
view save

user output
919
459
505
833
809
...
view save

Test 42

Subtask: 7

Verdict:

input
200000 200000
478025 478025 478025 478025 47...
view save

correct output
-1
-1
2
2
2
...
view save

user output
(empty)

Test 43

Subtask: 7

Verdict:

input
200000 200000
1810 2088 3022 3097 7459 7943 ...
view save

correct output
2
-1
-1
2
-1
...
view save

user output
(empty)

Test 44

Subtask: 7

Verdict:

input
199531 200000
11328 26391 30353 37063 44412 ...
view save

correct output
-1
2
-1
2
2
...
view save

user output
(empty)

Test 45

Subtask: 7

Verdict:

input
200000 200000
106738201 369187074 412614650 ...
view save

correct output
2
12
3
19
3
...
view save

user output
(empty)

Test 46

Subtask: 7

Verdict:

input
200000 200000
670611290 43427363 8475380 309...
view save

correct output
3
5
3
3
3
...
view save

user output
(empty)

Test 47

Subtask: 7

Verdict:

input
200000 200000
907542569 504758282 948727805 ...
view save

correct output
3
33
3
3
3
...
view save

user output
(empty)

Test 48

Subtask: 7

Verdict:

input
200000 200000
487056731 460461648 142698485 ...
view save

correct output
3
3
3
3
3
...
view save

user output
(empty)

Test 49

Subtask: 7

Verdict:

input
200000 200000
12772 23236 23236 23236 41149 ...
view save

correct output
0
0
0
0
0
...
view save

user output
(empty)

Test 50

Subtask: 7

Verdict: ACCEPTED

input
200000 200000
999993539 999993361 999993361 ...
view save

correct output
125375
16687
-1
84781
46147
...
view save

user output
125375
16687
-1
84781
46147
...
view save

Test 51

Subtask: 7

Verdict: ACCEPTED

input
200000 200000
999993539 999993361 999993361 ...
view save

correct output
94788
177608
95881
56377
179957
...
view save

user output
94788
177608
95881
56377
179957
...
view save

Test 52

Subtask: 1, 2, 3, 5, 6, 7

Verdict: ACCEPTED

input
5 1
2 1 3 5 4
2 2
view save

correct output
2
view save

user output
2
view save

Test 53

Subtask: 1, 2, 3, 4, 5, 6, 7

Verdict: ACCEPTED

input
2 1
1 2
1 1
view save

correct output
0
view save

user output
0
view save

Test 54

Subtask: 2, 5, 6, 7

Verdict: ACCEPTED

input
4 1
2 1 4 3
3 2
view save

correct output
2
view save

user output
2
view save

Test 55

Subtask: 1, 2, 3, 4, 6, 7

Verdict: ACCEPTED

input
10 10
1 1 1 1 2 2 1 1 2 2
7 1
2 6
4 5
...
view save

correct output
-1
1
-1
-1
-1
...
view save

user output
-1
1
-1
-1
-1
...
view save

Test 56

Subtask: 1, 2, 3, 6, 7

Verdict: ACCEPTED

input
10 10
181777772 181777772 181777772 ...
view save

correct output
-1
-1
-1
-1
-1
...
view save

user output
-1
-1
-1
-1
-1
...
view save

Test 57

Subtask: 6, 7

Verdict: ACCEPTED

input
100 10
92800811 524548163 939127795 9...
view save

correct output
-1
-1
3
-1
3
...
view save

user output
-1
-1
3
-1
3
...
view save

Test 58

Subtask: 3, 4, 7

Verdict: ACCEPTED

input
100 100000
2 2 2 1 2 2 2 2 1 2 1 1 1 2 2 ...
view save

correct output
-1
-1
-1
-1
-1
...
view save

user output
-1
-1
-1
-1
-1
...
view save

Test 59

Subtask: 3, 7

Verdict: ACCEPTED

input
100 100000
172695325 172695325 172695325 ...
view save

correct output
-1
-1
-1
-1
-1
...
view save

user output
-1
-1
-1
-1
-1
...
view save

Test 60

Subtask: 2, 6, 7

Verdict: ACCEPTED

input
4 10
869194539 239439572 968540665 ...
view save

correct output
-1
2
-1
-1
-1
...
view save

user output
-1
2
-1
-1
-1
...
view save

Test 61

Subtask: 2, 6, 7

Verdict: ACCEPTED

input
10 10
55366041 112170735 112170735 5...
view save

correct output
-1
-1
2
1
1
...
view save

user output
-1
-1
2
1
1
...
view save

Test 62

Subtask: 2, 6, 7

Verdict: ACCEPTED

input
10 10
156018639 156018639 445832758 ...
view save

correct output
-1
1
-1
-1
2
...
view save

user output
-1
1
-1
-1
2
...
view save

Test 63

Subtask: 2, 6, 7

Verdict: ACCEPTED

input
10 10
702507512 702507512 892090406 ...
view save

correct output
-1
2
-1
2
2
...
view save

user output
-1
2
-1
2
2
...
view save

Test 64

Subtask: 2, 6, 7

Verdict: ACCEPTED

input
10 10
720324490 720324490 720324490 ...
view save

correct output
-1
2
2
1
-1
...
view save

user output
-1
2
2
1
-1
...
view save

Tasks

A Distances-B Hamilton-C Sort-

Submissions (jsesok)

2026-10-02 18:22:46 1002026-10-02 18:20:30 132026-10-01 20:30:02 1002026-10-01 20:28:42 182026-10-01 19:44:09 182026-10-01 19:39:51 462026-10-01 19:33:04 532026-10-01 19:21:41 132026-10-01 19:08:01 132026-10-01 19:06:51 132026-10-01 18:05:35 132026-10-01 16:32:19 532026-10-01 16:13:49 532026-10-01 16:08:12 532026-10-01 16:06:20 132026-10-01 15:24:12 462026-10-01 15:21:57 62026-10-01 15:13:33 62026-10-01 15:09:49 62026-10-01 14:14:44 62026-10-01 14:13:12 62026-10-01 14:11:37 62026-10-01 13:32:45 62026-10-01 13:12:11 62026-09-30 17:21:33 532026-09-30 17:09:55 362026-09-30 16:43:51 132026-09-30 14:28:07 232026-09-30 14:14:33 02026-09-30 14:13:47 02026-09-30 14:09:57 02026-09-30 14:07:50 02026-09-30 14:03:26 132026-09-30 13:12:38 132026-09-30 12:57:17 132026-09-29 22:09:36 132026-09-29 18:02:57 132026-09-29 17:28:37 132026-09-23 16:40:09 132026-09-23 16:36:45 02026-04-17 10:38:55 112026-04-17 10:35:02 02026-04-17 10:33:57 02026-04-17 10:33:57 02026-04-17 10:22:01 6