oj.uz

Submission #1105037

# Submission time Handle Problem Language Result Execution time Memory
1105037 2024-10-25T08:23:22 Z modwwe Real Mountains (CCO23_day1problem2) C++17
25 / 25
 2567 ms 192664 KB 
#pragma GCC optimize("Ofast,unroll-loops")
//#pragma GCC optimize("conserve-stack")
#include<bits/stdc++.h>
#define int long long
#define ll long long
#define down cout<<'\n';
#define debug cout<<" cucuucucuuu",down
#define NHP     ios_base::sync_with_stdio(0);cout.tie(0);cin.tie(0);
#define modwwe  int t;cin>>t; while(t--)
#define bit(i,j) (i>>j&1)
#define sobit(a) __builtin_popcountll(a)
#define task "test"
#define fin(x) freopen(x".inp","r",stdin)
#define fou(x) freopen(x".out","w",stdout)
#define pb push_back
#define mask(i) (1<<i)
#define checktime   cerr << (double)clock() / CLOCKS_PER_SEC * 1000  << " ms";
using namespace std;
#define getchar_unlocked getchar

inline int scan()
{
    char c = getchar_unlocked();
    int x = 0;
    while (c < '0' || c > '9')
    {
        c = getchar_unlocked();
    }
    while (c >= '0' && c <= '9')
    {
        x = (x << 1) + (x << 3) + c - '0';
        c = getchar_unlocked();
    }
    return x;
};
void phongbeo();
const int inf = 1e9;
const int mod2 = 1e6+3;
const int  mod1 = 998244353;
int add(int x,int y)
{
    if(x+y>=mod2) x-=mod2;
    if(x+y<0) x+=mod2;
    return x+y;
}
struct icd
{
    long double a;
    int b;
};
struct ib
{
    int a;
    int b;
};
struct ic
{
    int a, b, c, d;
};
struct ie
{
    int a, b, c, d, e;

};

int  n, m, s1, s2, s4, s3, sf, k, s5, s6, mx, s7, s8, s9, mx2, res, dem2 = 0, dem = 0, s33, dem3, dem4, mid, l2, r2, center;
int  i, s10, s12,k1,k2,k3,s11,limit,w,l,r,last,root;
int kk,invf;
int el = 19;

main()
{
    if(fopen(task".inp","r"))
    {
        fin(task);
        fou(task);
    }
    NHP
    /// cin>>s1;
///modwwe
    phongbeo();
    // checktime
}
int c[1000002];
int b[1000002];
int bit[1000002];
int a[1000002];
vector<int> v;
vector<int> pos[1000002];
vector<int>hihi[1000002];
set<int>s;
int cost(int l,int r)
{
    if(l>r) return 0;
    return ((r+l)*(r-l+1)/2)%mod2;
}
struct IT
{
    int t[4000001];
    void build(int node,int l,int r)
    {
        if(l==r)
        {
            t[node]=a[l];
            return;
        }
        int mid=l+r>>1;
        build(node<<1,l,mid);
        build(node<<1|1,mid+1,r);
        t[node]=min(t[node<<1],t[node<<1|1]);
    }
    void upd(int node,int l,int r,int l1)
    {
        if(l==r)
        {
            t[node]=inf;
            return;
        }
        int mid=l+r>>1;
        if(l1<=mid) upd(node<<1,l,mid,l1);
        else upd(node<<1|1,mid+1,r,l1);
        t[node]=min(t[node<<1],t[node<<1|1]);
    }
    int get(int node,int l,int r,int l1,int r1)
    {
        if(l>r1||r<l1||t[node]==inf) return inf;
        if(l>=l1&&r<=r1) return v[t[node]-1];
        int mid=l+r>>1;
        return min(get(node<<1,l,mid,l1,r1),get(node<<1|1,mid+1,r,l1,r1));
    }
} st;
int min_cost(int l,int r,int x,int y)
{
    int costleft=st.get(1,1,n,1,l-1)
                 +st.get(1,1,n,l+1,n)
                 +st.get(1,1,n,r+1,n);
    int costright=st.get(1,1,n,1,r-1)+
                  st.get(1,1,n,r+1,n)+
                  st.get(1,1,n,1,l-1);
    return min(costleft,costright)*(v[x]-v[y])
           +cost(v[y]+1,v[x])*((s.size()-2)*2+1);
}
void phongbeo()
{
    cin>>n;
    for(int i=1; i<=n; i++)
        cin>>a[i],v.pb(a[i]);
    sort(v.begin(),v.end());
    v.erase(unique(v.begin(),v.end()),v.end());
    for(int i=1; i<=n; i++)
        a[i]=lower_bound(v.begin(),v.end(),a[i])-v.begin()+1,
             hihi[a[i]-1].pb(i);
    st.build(1,1,n);
    for(int i=1; i<=n; i++)
    {
        if(a[i]>=c[i-1]) c[i]=a[i],s2=i;
        else c[i]=c[i-1];
        pos[c[i]-1].pb(i);
    }
    for(int i=1; i<=s2; i++)
        s4=s4+cost(v[a[i]-1],v[c[i]-1]-1);
    for(int i=n; i>=s2+1; --i)
    {
        if(a[i]>=c[i+1]) c[i]=a[i];
        else c[i]=c[i+1];
        pos[c[i]-1].pb(i);
        s4=s4+cost(v[a[i]-1],v[c[i]-1]-1);
    }
    for(int i=0; i<v.size(); i++)
    {
        if(s.size()>1)
        {
            s2=*s.begin();
            s3=*s.rbegin();
            s4=s4+min_cost(s2,s3,i,i-1);
        }
        else  if(s.size()==1)
        {
            s2=*s.begin();
            s4+=(st.get(1,1,n,1,s2-1)+st.get(1,1,n,s2+1,n))*(v[i]-v[i-1]);
        }
        for(auto f:hihi[i])
            s.insert(f),
                     st.upd(1,1,n,f);
        for(auto f:pos[i])
            s.erase(f);
    }
    cout<<s4%mod2;
}

Compilation message

Main.cpp:71:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   71 | main()
      | ^~~~
Main.cpp: In member function 'void IT::build(long long int, long long int, long long int)':
Main.cpp:107:18: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  107 |         int mid=l+r>>1;
      |                 ~^~
Main.cpp: In member function 'void IT::upd(long long int, long long int, long long int, long long int)':
Main.cpp:119:18: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  119 |         int mid=l+r>>1;
      |                 ~^~
Main.cpp: In member function 'long long int IT::get(long long int, long long int, long long int, long long int, long long int)':
Main.cpp:128:18: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  128 |         int mid=l+r>>1;
      |                 ~^~
Main.cpp: In function 'void phongbeo()':
Main.cpp:169:19: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  169 |     for(int i=0; i<v.size(); i++)
      |                  ~^~~~~~~~~
Main.cpp: In function 'int main()':
Main.cpp:13:23: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   13 | #define fin(x) freopen(x".inp","r",stdin)
      |                ~~~~~~~^~~~~~~~~~~~~~~~~~~
Main.cpp:75:9: note: in expansion of macro 'fin'
   75 |         fin(task);
      |         ^~~
Main.cpp:14:23: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   14 | #define fou(x) freopen(x".out","w",stdout)
      |                ~~~~~~~^~~~~~~~~~~~~~~~~~~~
Main.cpp:76:9: note: in expansion of macro 'fou'
   76 |         fou(task);
      |         ^~~

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 49488 KB Output is correct
2 Correct 13 ms 49488 KB Output is correct
3 Correct 14 ms 49488 KB Output is correct
4 Correct 15 ms 50256 KB Output is correct
5 Correct 16 ms 50256 KB Output is correct
6 Correct 14 ms 50256 KB Output is correct
7 Correct 15 ms 50240 KB Output is correct
8 Correct 16 ms 50256 KB Output is correct
9 Correct 15 ms 49928 KB Output is correct
10 Correct 16 ms 50000 KB Output is correct
11 Correct 16 ms 50056 KB Output is correct
12 Correct 17 ms 50256 KB Output is correct

Subtask #2
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 49488 KB Output is correct
2 Correct 13 ms 49488 KB Output is correct
3 Correct 14 ms 49488 KB Output is correct
4 Correct 15 ms 50256 KB Output is correct
5 Correct 16 ms 50256 KB Output is correct
6 Correct 14 ms 50256 KB Output is correct
7 Correct 15 ms 50240 KB Output is correct
8 Correct 16 ms 50256 KB Output is correct
9 Correct 15 ms 49928 KB Output is correct
10 Correct 16 ms 50000 KB Output is correct
11 Correct 16 ms 50056 KB Output is correct
12 Correct 17 ms 50256 KB Output is correct
13 Correct 17 ms 50256 KB Output is correct
14 Correct 14 ms 49488 KB Output is correct
15 Correct 13 ms 49488 KB Output is correct
16 Correct 15 ms 50256 KB Output is correct
17 Correct 16 ms 50256 KB Output is correct
18 Correct 16 ms 50256 KB Output is correct
19 Correct 16 ms 50256 KB Output is correct
20 Correct 17 ms 50236 KB Output is correct
21 Correct 15 ms 50256 KB Output is correct
22 Correct 16 ms 50332 KB Output is correct
23 Correct 15 ms 50224 KB Output is correct
24 Correct 15 ms 50256 KB Output is correct
25 Correct 15 ms 50256 KB Output is correct
26 Correct 16 ms 50256 KB Output is correct
27 Correct 16 ms 50256 KB Output is correct
28 Correct 16 ms 50244 KB Output is correct
29 Correct 13 ms 49488 KB Output is correct
30 Correct 15 ms 49488 KB Output is correct
31 Correct 13 ms 49488 KB Output is correct
32 Correct 15 ms 49724 KB Output is correct
33 Correct 14 ms 49488 KB Output is correct
34 Correct 15 ms 49724 KB Output is correct

Subtask #3
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 49488 KB Output is correct
2 Correct 13 ms 49488 KB Output is correct
3 Correct 14 ms 49488 KB Output is correct
4 Correct 15 ms 50256 KB Output is correct
5 Correct 16 ms 50256 KB Output is correct
6 Correct 14 ms 50256 KB Output is correct
7 Correct 15 ms 50240 KB Output is correct
8 Correct 16 ms 50256 KB Output is correct
9 Correct 15 ms 49928 KB Output is correct
10 Correct 16 ms 50000 KB Output is correct
11 Correct 16 ms 50056 KB Output is correct
12 Correct 17 ms 50256 KB Output is correct
13 Correct 17 ms 50256 KB Output is correct
14 Correct 14 ms 49488 KB Output is correct
15 Correct 13 ms 49488 KB Output is correct
16 Correct 15 ms 50256 KB Output is correct
17 Correct 16 ms 50256 KB Output is correct
18 Correct 16 ms 50256 KB Output is correct
19 Correct 16 ms 50256 KB Output is correct
20 Correct 17 ms 50236 KB Output is correct
21 Correct 15 ms 50256 KB Output is correct
22 Correct 16 ms 50332 KB Output is correct
23 Correct 15 ms 50224 KB Output is correct
24 Correct 15 ms 50256 KB Output is correct
25 Correct 15 ms 50256 KB Output is correct
26 Correct 16 ms 50256 KB Output is correct
27 Correct 16 ms 50256 KB Output is correct
28 Correct 16 ms 50244 KB Output is correct
29 Correct 13 ms 49488 KB Output is correct
30 Correct 15 ms 49488 KB Output is correct
31 Correct 13 ms 49488 KB Output is correct
32 Correct 15 ms 49724 KB Output is correct
33 Correct 14 ms 49488 KB Output is correct
34 Correct 15 ms 49724 KB Output is correct
35 Correct 18 ms 50256 KB Output is correct
36 Correct 18 ms 50412 KB Output is correct
37 Correct 18 ms 50404 KB Output is correct
38 Correct 19 ms 50512 KB Output is correct
39 Correct 18 ms 50416 KB Output is correct
40 Correct 15 ms 50256 KB Output is correct
41 Correct 16 ms 50424 KB Output is correct
42 Correct 15 ms 50256 KB Output is correct
43 Correct 23 ms 50448 KB Output is correct
44 Correct 18 ms 50256 KB Output is correct
45 Correct 18 ms 50244 KB Output is correct
46 Correct 18 ms 50416 KB Output is correct
47 Correct 17 ms 50256 KB Output is correct
48 Correct 18 ms 50256 KB Output is correct

Subtask #4
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 49488 KB Output is correct
2 Correct 13 ms 49488 KB Output is correct
3 Correct 14 ms 49488 KB Output is correct
4 Correct 15 ms 50256 KB Output is correct
5 Correct 16 ms 50256 KB Output is correct
6 Correct 14 ms 50256 KB Output is correct
7 Correct 15 ms 50240 KB Output is correct
8 Correct 16 ms 50256 KB Output is correct
9 Correct 15 ms 49928 KB Output is correct
10 Correct 16 ms 50000 KB Output is correct
11 Correct 16 ms 50056 KB Output is correct
12 Correct 17 ms 50256 KB Output is correct
13 Correct 17 ms 50256 KB Output is correct
14 Correct 14 ms 49488 KB Output is correct
15 Correct 13 ms 49488 KB Output is correct
16 Correct 15 ms 50256 KB Output is correct
17 Correct 16 ms 50256 KB Output is correct
18 Correct 16 ms 50256 KB Output is correct
19 Correct 16 ms 50256 KB Output is correct
20 Correct 17 ms 50236 KB Output is correct
21 Correct 15 ms 50256 KB Output is correct
22 Correct 16 ms 50332 KB Output is correct
23 Correct 15 ms 50224 KB Output is correct
24 Correct 15 ms 50256 KB Output is correct
25 Correct 15 ms 50256 KB Output is correct
26 Correct 16 ms 50256 KB Output is correct
27 Correct 16 ms 50256 KB Output is correct
28 Correct 16 ms 50244 KB Output is correct
29 Correct 13 ms 49488 KB Output is correct
30 Correct 15 ms 49488 KB Output is correct
31 Correct 13 ms 49488 KB Output is correct
32 Correct 15 ms 49724 KB Output is correct
33 Correct 14 ms 49488 KB Output is correct
34 Correct 15 ms 49724 KB Output is correct
35 Correct 18 ms 50256 KB Output is correct
36 Correct 18 ms 50412 KB Output is correct
37 Correct 18 ms 50404 KB Output is correct
38 Correct 19 ms 50512 KB Output is correct
39 Correct 18 ms 50416 KB Output is correct
40 Correct 15 ms 50256 KB Output is correct
41 Correct 16 ms 50424 KB Output is correct
42 Correct 15 ms 50256 KB Output is correct
43 Correct 23 ms 50448 KB Output is correct
44 Correct 18 ms 50256 KB Output is correct
45 Correct 18 ms 50244 KB Output is correct
46 Correct 18 ms 50416 KB Output is correct
47 Correct 17 ms 50256 KB Output is correct
48 Correct 18 ms 50256 KB Output is correct
49 Correct 18 ms 50268 KB Output is correct
50 Correct 24 ms 50256 KB Output is correct
51 Correct 19 ms 50256 KB Output is correct
52 Correct 19 ms 50256 KB Output is correct
53 Correct 19 ms 50256 KB Output is correct
54 Correct 16 ms 50312 KB Output is correct
55 Correct 16 ms 50256 KB Output is correct
56 Correct 16 ms 50256 KB Output is correct
57 Correct 18 ms 50256 KB Output is correct
58 Correct 19 ms 50256 KB Output is correct
59 Correct 17 ms 50256 KB Output is correct
60 Correct 18 ms 50256 KB Output is correct
61 Correct 18 ms 50252 KB Output is correct
62 Correct 19 ms 50256 KB Output is correct

Subtask #5
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 49488 KB Output is correct
2 Correct 13 ms 49488 KB Output is correct
3 Correct 14 ms 49488 KB Output is correct
4 Correct 15 ms 50256 KB Output is correct
5 Correct 16 ms 50256 KB Output is correct
6 Correct 14 ms 50256 KB Output is correct
7 Correct 15 ms 50240 KB Output is correct
8 Correct 16 ms 50256 KB Output is correct
9 Correct 15 ms 49928 KB Output is correct
10 Correct 16 ms 50000 KB Output is correct
11 Correct 16 ms 50056 KB Output is correct
12 Correct 17 ms 50256 KB Output is correct
13 Correct 17 ms 50256 KB Output is correct
14 Correct 14 ms 49488 KB Output is correct
15 Correct 13 ms 49488 KB Output is correct
16 Correct 15 ms 50256 KB Output is correct
17 Correct 16 ms 50256 KB Output is correct
18 Correct 16 ms 50256 KB Output is correct
19 Correct 16 ms 50256 KB Output is correct
20 Correct 17 ms 50236 KB Output is correct
21 Correct 15 ms 50256 KB Output is correct
22 Correct 16 ms 50332 KB Output is correct
23 Correct 15 ms 50224 KB Output is correct
24 Correct 15 ms 50256 KB Output is correct
25 Correct 15 ms 50256 KB Output is correct
26 Correct 16 ms 50256 KB Output is correct
27 Correct 16 ms 50256 KB Output is correct
28 Correct 16 ms 50244 KB Output is correct
29 Correct 13 ms 49488 KB Output is correct
30 Correct 15 ms 49488 KB Output is correct
31 Correct 13 ms 49488 KB Output is correct
32 Correct 15 ms 49724 KB Output is correct
33 Correct 14 ms 49488 KB Output is correct
34 Correct 15 ms 49724 KB Output is correct
35 Correct 939 ms 156468 KB Output is correct
36 Correct 817 ms 156252 KB Output is correct
37 Correct 754 ms 156660 KB Output is correct
38 Correct 783 ms 156540 KB Output is correct
39 Correct 784 ms 156808 KB Output is correct
40 Correct 13 ms 49744 KB Output is correct
41 Correct 13 ms 49744 KB Output is correct
42 Correct 413 ms 154440 KB Output is correct
43 Correct 435 ms 154032 KB Output is correct
44 Correct 479 ms 161708 KB Output is correct
45 Correct 341 ms 156848 KB Output is correct
46 Correct 342 ms 156852 KB Output is correct
47 Correct 345 ms 156328 KB Output is correct
48 Correct 499 ms 156400 KB Output is correct
49 Correct 443 ms 156508 KB Output is correct
50 Correct 520 ms 156456 KB Output is correct

Subtask #6
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 49488 KB Output is correct
2 Correct 13 ms 49488 KB Output is correct
3 Correct 14 ms 49488 KB Output is correct
4 Correct 15 ms 50256 KB Output is correct
5 Correct 16 ms 50256 KB Output is correct
6 Correct 14 ms 50256 KB Output is correct
7 Correct 15 ms 50240 KB Output is correct
8 Correct 16 ms 50256 KB Output is correct
9 Correct 15 ms 49928 KB Output is correct
10 Correct 16 ms 50000 KB Output is correct
11 Correct 16 ms 50056 KB Output is correct
12 Correct 17 ms 50256 KB Output is correct
13 Correct 17 ms 50256 KB Output is correct
14 Correct 14 ms 49488 KB Output is correct
15 Correct 13 ms 49488 KB Output is correct
16 Correct 15 ms 50256 KB Output is correct
17 Correct 16 ms 50256 KB Output is correct
18 Correct 16 ms 50256 KB Output is correct
19 Correct 16 ms 50256 KB Output is correct
20 Correct 17 ms 50236 KB Output is correct
21 Correct 15 ms 50256 KB Output is correct
22 Correct 16 ms 50332 KB Output is correct
23 Correct 15 ms 50224 KB Output is correct
24 Correct 15 ms 50256 KB Output is correct
25 Correct 15 ms 50256 KB Output is correct
26 Correct 16 ms 50256 KB Output is correct
27 Correct 16 ms 50256 KB Output is correct
28 Correct 16 ms 50244 KB Output is correct
29 Correct 13 ms 49488 KB Output is correct
30 Correct 15 ms 49488 KB Output is correct
31 Correct 13 ms 49488 KB Output is correct
32 Correct 15 ms 49724 KB Output is correct
33 Correct 14 ms 49488 KB Output is correct
34 Correct 15 ms 49724 KB Output is correct
35 Correct 18 ms 50256 KB Output is correct
36 Correct 18 ms 50412 KB Output is correct
37 Correct 18 ms 50404 KB Output is correct
38 Correct 19 ms 50512 KB Output is correct
39 Correct 18 ms 50416 KB Output is correct
40 Correct 15 ms 50256 KB Output is correct
41 Correct 16 ms 50424 KB Output is correct
42 Correct 15 ms 50256 KB Output is correct
43 Correct 23 ms 50448 KB Output is correct
44 Correct 18 ms 50256 KB Output is correct
45 Correct 18 ms 50244 KB Output is correct
46 Correct 18 ms 50416 KB Output is correct
47 Correct 17 ms 50256 KB Output is correct
48 Correct 18 ms 50256 KB Output is correct
49 Correct 939 ms 156468 KB Output is correct
50 Correct 817 ms 156252 KB Output is correct
51 Correct 754 ms 156660 KB Output is correct
52 Correct 783 ms 156540 KB Output is correct
53 Correct 784 ms 156808 KB Output is correct
54 Correct 13 ms 49744 KB Output is correct
55 Correct 13 ms 49744 KB Output is correct
56 Correct 413 ms 154440 KB Output is correct
57 Correct 435 ms 154032 KB Output is correct
58 Correct 479 ms 161708 KB Output is correct
59 Correct 341 ms 156848 KB Output is correct
60 Correct 342 ms 156852 KB Output is correct
61 Correct 345 ms 156328 KB Output is correct
62 Correct 499 ms 156400 KB Output is correct
63 Correct 443 ms 156508 KB Output is correct
64 Correct 520 ms 156456 KB Output is correct
65 Correct 2178 ms 173300 KB Output is correct
66 Correct 2082 ms 172300 KB Output is correct
67 Correct 1942 ms 173440 KB Output is correct
68 Correct 2161 ms 173476 KB Output is correct
69 Correct 2130 ms 174772 KB Output is correct
70 Correct 440 ms 162480 KB Output is correct
71 Correct 421 ms 154288 KB Output is correct
72 Correct 410 ms 154376 KB Output is correct
73 Correct 833 ms 171424 KB Output is correct
74 Correct 804 ms 171308 KB Output is correct
75 Correct 876 ms 171352 KB Output is correct
76 Correct 1125 ms 175528 KB Output is correct
77 Correct 1065 ms 178084 KB Output is correct
78 Correct 1091 ms 175812 KB Output is correct

Subtask #7
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 49488 KB Output is correct
2 Correct 13 ms 49488 KB Output is correct
3 Correct 14 ms 49488 KB Output is correct
4 Correct 15 ms 50256 KB Output is correct
5 Correct 16 ms 50256 KB Output is correct
6 Correct 14 ms 50256 KB Output is correct
7 Correct 15 ms 50240 KB Output is correct
8 Correct 16 ms 50256 KB Output is correct
9 Correct 15 ms 49928 KB Output is correct
10 Correct 16 ms 50000 KB Output is correct
11 Correct 16 ms 50056 KB Output is correct
12 Correct 17 ms 50256 KB Output is correct
13 Correct 17 ms 50256 KB Output is correct
14 Correct 14 ms 49488 KB Output is correct
15 Correct 13 ms 49488 KB Output is correct
16 Correct 15 ms 50256 KB Output is correct
17 Correct 16 ms 50256 KB Output is correct
18 Correct 16 ms 50256 KB Output is correct
19 Correct 16 ms 50256 KB Output is correct
20 Correct 17 ms 50236 KB Output is correct
21 Correct 15 ms 50256 KB Output is correct
22 Correct 16 ms 50332 KB Output is correct
23 Correct 15 ms 50224 KB Output is correct
24 Correct 15 ms 50256 KB Output is correct
25 Correct 15 ms 50256 KB Output is correct
26 Correct 16 ms 50256 KB Output is correct
27 Correct 16 ms 50256 KB Output is correct
28 Correct 16 ms 50244 KB Output is correct
29 Correct 13 ms 49488 KB Output is correct
30 Correct 15 ms 49488 KB Output is correct
31 Correct 13 ms 49488 KB Output is correct
32 Correct 15 ms 49724 KB Output is correct
33 Correct 14 ms 49488 KB Output is correct
34 Correct 15 ms 49724 KB Output is correct
35 Correct 18 ms 50256 KB Output is correct
36 Correct 18 ms 50412 KB Output is correct
37 Correct 18 ms 50404 KB Output is correct
38 Correct 19 ms 50512 KB Output is correct
39 Correct 18 ms 50416 KB Output is correct
40 Correct 15 ms 50256 KB Output is correct
41 Correct 16 ms 50424 KB Output is correct
42 Correct 15 ms 50256 KB Output is correct
43 Correct 23 ms 50448 KB Output is correct
44 Correct 18 ms 50256 KB Output is correct
45 Correct 18 ms 50244 KB Output is correct
46 Correct 18 ms 50416 KB Output is correct
47 Correct 17 ms 50256 KB Output is correct
48 Correct 18 ms 50256 KB Output is correct
49 Correct 18 ms 50268 KB Output is correct
50 Correct 24 ms 50256 KB Output is correct
51 Correct 19 ms 50256 KB Output is correct
52 Correct 19 ms 50256 KB Output is correct
53 Correct 19 ms 50256 KB Output is correct
54 Correct 16 ms 50312 KB Output is correct
55 Correct 16 ms 50256 KB Output is correct
56 Correct 16 ms 50256 KB Output is correct
57 Correct 18 ms 50256 KB Output is correct
58 Correct 19 ms 50256 KB Output is correct
59 Correct 17 ms 50256 KB Output is correct
60 Correct 18 ms 50256 KB Output is correct
61 Correct 18 ms 50252 KB Output is correct
62 Correct 19 ms 50256 KB Output is correct
63 Correct 939 ms 156468 KB Output is correct
64 Correct 817 ms 156252 KB Output is correct
65 Correct 754 ms 156660 KB Output is correct
66 Correct 783 ms 156540 KB Output is correct
67 Correct 784 ms 156808 KB Output is correct
68 Correct 13 ms 49744 KB Output is correct
69 Correct 13 ms 49744 KB Output is correct
70 Correct 413 ms 154440 KB Output is correct
71 Correct 435 ms 154032 KB Output is correct
72 Correct 479 ms 161708 KB Output is correct
73 Correct 341 ms 156848 KB Output is correct
74 Correct 342 ms 156852 KB Output is correct
75 Correct 345 ms 156328 KB Output is correct
76 Correct 499 ms 156400 KB Output is correct
77 Correct 443 ms 156508 KB Output is correct
78 Correct 520 ms 156456 KB Output is correct
79 Correct 2178 ms 173300 KB Output is correct
80 Correct 2082 ms 172300 KB Output is correct
81 Correct 1942 ms 173440 KB Output is correct
82 Correct 2161 ms 173476 KB Output is correct
83 Correct 2130 ms 174772 KB Output is correct
84 Correct 440 ms 162480 KB Output is correct
85 Correct 421 ms 154288 KB Output is correct
86 Correct 410 ms 154376 KB Output is correct
87 Correct 833 ms 171424 KB Output is correct
88 Correct 804 ms 171308 KB Output is correct
89 Correct 876 ms 171352 KB Output is correct
90 Correct 1125 ms 175528 KB Output is correct
91 Correct 1065 ms 178084 KB Output is correct
92 Correct 1091 ms 175812 KB Output is correct
93 Correct 388 ms 154436 KB Output is correct
94 Correct 933 ms 192664 KB Output is correct
95 Correct 947 ms 184568 KB Output is correct
96 Correct 963 ms 184360 KB Output is correct
97 Correct 1311 ms 189596 KB Output is correct
98 Correct 1313 ms 188340 KB Output is correct
99 Correct 1352 ms 188092 KB Output is correct
100 Correct 2195 ms 188460 KB Output is correct
101 Correct 2404 ms 191040 KB Output is correct
102 Correct 2472 ms 191008 KB Output is correct
103 Correct 2567 ms 192644 KB Output is correct
104 Correct 2508 ms 192224 KB Output is correct
105 Correct 367 ms 154284 KB Output is correct
106 Correct 392 ms 162728 KB Output is correct