oj.uz

답안 #987897

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
987897 2024-05-23T18:55:04 Z Popi_Este_Un_Clovn Shopping Plans (CCO20_day2problem3) C++14
25 / 25
 210 ms 69156 KB 
///OWNERUL LUI ADI <3
#include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
#pragma GCC optimize("O1")
#pragma GCC optimize("O2")
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")

using namespace std;
//ifstream cin("a.in");
//ofstream cout("a.out");
long long inf=1e9+10;
struct node
{
    long long  layer,sum,bitipref,lst,rghtbord,biti;
    //  node(long long a,long long b,long long c,long long d,long long e) : layer(a),sum(b),bitipref(c),lst(d),rghtbord(e){}
};
struct  cmp
{
    bool operator()(node a,node  b)
    {
        return a.sum>b.sum;
    }
};
priority_queue<node,vector<node>,cmp>pq;
vector<long long >arr;
vector<long long >adj[200005];
long long cost[200005];
vector<long long>ord;
bool cmp2(long long a,long long b)
{
    return cost[a]<cost[b];
}
long long y[200005];
long long x[200005];
long long init[200005];
node special(node curr)
{
    long long g,g2;
    g=ord[curr.layer];
    g2=ord[curr.layer+1];
    curr.lst=0;
    curr.sum+=adj[g2][0];
    curr.layer++;
    curr.biti=1;
    curr.bitipref=0;
    curr.rghtbord=adj[g2].size()-1;
    return curr;
}
node skip(node curr)
{
    long long g,g2;
    g=ord[curr.layer];
    g2=ord[curr.layer+1];
    if(x[g]==0)
    {
       curr.sum=curr.sum-adj[g][curr.lst];
    }
    else
        curr.sum=curr.sum-adj[g][curr.lst]+adj[g][curr.lst-1];
    if(x[g2]==0)
    {
        return special(curr);
    }
    curr.layer++;
    curr.biti=x[g2];
    curr.lst=x[g2];
    curr.bitipref=x[g2]-1;
    curr.rghtbord=adj[g2].size()-1;
    curr.sum=curr.sum+adj[g2][curr.lst]-adj[g2][curr.lst-1];
    return curr;
}
node godown(node curr)
{
    long long g,g2;
    g=ord[curr.layer];
    g2=ord[curr.layer+1];
    if(x[g2]==0)
    {
        return special(curr);
    }
    curr.layer++;
    curr.biti=x[g2];
    curr.lst=x[g2];
    curr.bitipref=x[g2]-1;
    curr.rghtbord=adj[g2].size()-1;
    curr.sum=curr.sum+adj[g2][curr.lst]-adj[g2][curr.lst-1];
    return curr;
}
node shift(node curr)
{
    long long g;
    g=ord[curr.layer];
    curr.lst++;
    curr.sum=curr.sum+adj[g][curr.lst]-adj[g][curr.lst-1];
    return curr;
}
node fixborderandshift(node curr)
{
    long long g;
    g=ord[curr.layer];
    curr.rghtbord=curr.lst-1;
    curr.lst=curr.bitipref;
    curr.bitipref--;
    curr.sum=curr.sum+adj[g][curr.lst]-adj[g][curr.lst-1];
    return curr;
}
node fixborderandcreate(node curr)
{
    long long g;
    g=ord[curr.layer];
    curr.rghtbord=curr.lst-1;
    curr.lst=0;
    curr.biti++;
    curr.sum=curr.sum+init[g];
    return curr;
}
signed  main()
{
    long long  n,m,k,i,a,b;
    long long sum=0;
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cin>>n>>m>>k;
    for(i=1; i<=n; i++)
    {
        cin>>a>>b;
        adj[a].push_back(b);
    }
    long long imp=0,minim=inf,poz=m;
    for(i=1; i<=m; i++)
    {
        cin>>x[i]>>y[i];
        if(y[i]==0)
        {
            cost[i]=inf;
        }
        else
        {
            sort(adj[i].begin(),adj[i].end());
            if(adj[i].size()<x[i])
            {
                for(long long j=1; j<=k; j++)
                {
                    cout<<-1<<'\n';
                }
                return 0;
            }
            if(x[i]==0)
            {
                if(adj[i].size()==0)
                {
                    cost[i]=inf;
                }
                else
                {
                    init[i]=adj[i][0];
                    cost[i]=adj[i][0];
                }
            }
            else
            {
                long long vkuk=adj[i][0];
                init[i]=adj[i][0];
                for(long long j=0; j<adj[i].size(); j++)
                {
                    if(j+1<=x[i])
                    {
                        sum+=adj[i][j];
                    }
                    adj[i][j]-=vkuk;
                }
                if(adj[i].size()==x[i])
                {
                    cost[i]=inf;
                }
                else
                {
                    cost[i]=adj[i][x[i]]-adj[i][x[i]-1];
                }
            }
        }
        ord.push_back(i);
    }
    sort(ord.begin(),ord.end(),cmp2);
    m--;
    for(i=0; i<ord.size(); i++)
    {
        if(cost[ord[i]]==inf)
        {
            m=i-1;
            break;
        }
    }
    node curr,curr2;
    cout<<sum<<'\n';
    k--;
    if(m>=0)
    {
        long long g=ord[0];
        if(x[g]==0)
        {
            curr.layer=0;
            curr.sum=adj[g][0];
            curr.bitipref=0;
            curr.lst=0;
            curr.biti=1;
            curr.rghtbord=adj[g].size()-1;
            pq.push(curr);
        }
        else
        {
            curr.layer=0;
            curr.sum=adj[g][x[g]]-adj[g][x[g]-1];
            curr.bitipref=x[g]-1;
            curr.lst=x[g];
            curr.rghtbord=adj[g].size()-1;
            curr.biti=x[g];
            pq.push(curr);
        }
        while(pq.size() && k && imp==0)
        {
            curr=pq.top();
            pq.pop();
            k--;
            cout<<curr.sum+sum<<'\n';
            g=ord[curr.layer];
            if(x[g]==0 && curr.biti==1 && curr.layer+1<=m && curr.lst==0)
            {
                curr2=skip(curr);
                pq.push(curr2);
            }
            if(curr.lst==x[g] && curr.bitipref==x[g]-1 && curr.biti==x[g] && curr.layer+1<=m)
            {
                curr2=skip(curr);
                pq.push(curr2);
            }
            if(curr.lst+1<=curr.rghtbord)
            {
                curr2=shift(curr);
                pq.push(curr2);
            }
            if(curr.bitipref>=1 && curr.lst>=curr.bitipref+1)
            {
                curr2=fixborderandshift(curr);
                pq.push(curr2);
            }
            if(curr.bitipref==0 && curr.lst>=1 && curr.biti+1<=y[g])
            {
                curr2=fixborderandcreate(curr);
                pq.push(curr2);
            }
            if(curr.layer+1<=m)
            {
                curr2=godown(curr);
                pq.push(curr2);
            }
        }
    }
    while(k)
    {
        k--;
        cout<<-1<<'\n';
    }
    return 0;
}

Compilation message

Main.cpp: In function 'node special(node)':
Main.cpp:42:15: warning: variable 'g' set but not used [-Wunused-but-set-variable]
   42 |     long long g,g2;
      |               ^
Main.cpp: In function 'node godown(node)':
Main.cpp:78:15: warning: variable 'g' set but not used [-Wunused-but-set-variable]
   78 |     long long g,g2;
      |               ^
Main.cpp: In function 'int main()':
Main.cpp:144:29: warning: comparison of integer expressions of different signedness: 'std::vector<long long int>::size_type' {aka 'long unsigned int'} and 'long long int' [-Wsign-compare]
  144 |             if(adj[i].size()<x[i])
      |                ~~~~~~~~~~~~~^~~~~
Main.cpp:168:37: 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]
  168 |                 for(long long j=0; j<adj[i].size(); j++)
      |                                    ~^~~~~~~~~~~~~~
Main.cpp:176:33: warning: comparison of integer expressions of different signedness: 'std::vector<long long int>::size_type' {aka 'long unsigned int'} and 'long long int' [-Wsign-compare]
  176 |                 if(adj[i].size()==x[i])
      |                    ~~~~~~~~~~~~~^~~~~~
Main.cpp:190:15: 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]
  190 |     for(i=0; i<ord.size(); i++)
      |              ~^~~~~~~~~~~
Main.cpp:133:21: warning: unused variable 'minim' [-Wunused-variable]
  133 |     long long imp=0,minim=inf,poz=m;
      |                     ^~~~~
Main.cpp:133:31: warning: unused variable 'poz' [-Wunused-variable]
  133 |     long long imp=0,minim=inf,poz=m;
      |                               ^~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 11888 KB Output is correct
2 Correct 5 ms 11876 KB Output is correct
3 Correct 7 ms 11872 KB Output is correct
4 Correct 6 ms 11868 KB Output is correct
5 Correct 7 ms 11888 KB Output is correct
6 Correct 6 ms 11876 KB Output is correct
7 Correct 5 ms 11864 KB Output is correct
8 Correct 5 ms 11816 KB Output is correct
9 Correct 4 ms 11356 KB Output is correct
10 Correct 5 ms 11876 KB Output is correct
11 Correct 4 ms 11356 KB Output is correct
12 Correct 4 ms 11552 KB Output is correct
13 Correct 4 ms 11804 KB Output is correct
14 Correct 6 ms 12128 KB Output is correct
15 Correct 4 ms 11548 KB Output is correct
16 Correct 5 ms 11808 KB Output is correct
17 Correct 5 ms 11864 KB Output is correct
18 Correct 5 ms 11356 KB Output is correct
19 Correct 4 ms 11808 KB Output is correct
20 Correct 5 ms 11884 KB Output is correct
21 Correct 3 ms 11100 KB Output is correct
22 Correct 4 ms 11804 KB Output is correct
23 Correct 5 ms 11816 KB Output is correct
24 Correct 4 ms 11356 KB Output is correct
25 Correct 4 ms 11508 KB Output is correct
26 Correct 5 ms 11876 KB Output is correct
27 Correct 5 ms 11864 KB Output is correct
28 Correct 4 ms 11816 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 75 ms 37828 KB Output is correct
2 Correct 72 ms 38336 KB Output is correct
3 Correct 71 ms 38336 KB Output is correct
4 Correct 68 ms 38580 KB Output is correct
5 Correct 61 ms 25300 KB Output is correct
6 Correct 61 ms 25024 KB Output is correct
7 Correct 74 ms 37556 KB Output is correct
8 Correct 71 ms 37596 KB Output is correct
9 Correct 13 ms 11868 KB Output is correct
10 Correct 77 ms 38552 KB Output is correct
11 Correct 13 ms 11868 KB Output is correct
12 Correct 33 ms 13396 KB Output is correct
13 Correct 72 ms 37956 KB Output is correct
14 Correct 70 ms 38728 KB Output is correct
15 Correct 13 ms 11864 KB Output is correct
16 Correct 71 ms 38072 KB Output is correct
17 Correct 69 ms 38884 KB Output is correct
18 Correct 23 ms 12496 KB Output is correct
19 Correct 76 ms 37556 KB Output is correct
20 Correct 67 ms 39256 KB Output is correct
21 Correct 17 ms 12124 KB Output is correct
22 Correct 64 ms 23996 KB Output is correct
23 Correct 64 ms 37612 KB Output is correct
24 Correct 14 ms 11868 KB Output is correct
25 Correct 12 ms 11868 KB Output is correct
26 Correct 58 ms 25288 KB Output is correct
27 Correct 59 ms 24788 KB Output is correct

Subtask #3
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 11888 KB Output is correct
2 Correct 5 ms 11876 KB Output is correct
3 Correct 7 ms 11872 KB Output is correct
4 Correct 6 ms 11868 KB Output is correct
5 Correct 7 ms 11888 KB Output is correct
6 Correct 6 ms 11876 KB Output is correct
7 Correct 5 ms 11864 KB Output is correct
8 Correct 5 ms 11816 KB Output is correct
9 Correct 4 ms 11356 KB Output is correct
10 Correct 5 ms 11876 KB Output is correct
11 Correct 4 ms 11356 KB Output is correct
12 Correct 4 ms 11552 KB Output is correct
13 Correct 4 ms 11804 KB Output is correct
14 Correct 6 ms 12128 KB Output is correct
15 Correct 4 ms 11548 KB Output is correct
16 Correct 5 ms 11808 KB Output is correct
17 Correct 5 ms 11864 KB Output is correct
18 Correct 5 ms 11356 KB Output is correct
19 Correct 4 ms 11808 KB Output is correct
20 Correct 5 ms 11884 KB Output is correct
21 Correct 3 ms 11100 KB Output is correct
22 Correct 4 ms 11804 KB Output is correct
23 Correct 5 ms 11816 KB Output is correct
24 Correct 4 ms 11356 KB Output is correct
25 Correct 4 ms 11508 KB Output is correct
26 Correct 5 ms 11876 KB Output is correct
27 Correct 5 ms 11864 KB Output is correct
28 Correct 4 ms 11816 KB Output is correct
29 Correct 75 ms 37828 KB Output is correct
30 Correct 72 ms 38336 KB Output is correct
31 Correct 71 ms 38336 KB Output is correct
32 Correct 68 ms 38580 KB Output is correct
33 Correct 61 ms 25300 KB Output is correct
34 Correct 61 ms 25024 KB Output is correct
35 Correct 74 ms 37556 KB Output is correct
36 Correct 71 ms 37596 KB Output is correct
37 Correct 13 ms 11868 KB Output is correct
38 Correct 77 ms 38552 KB Output is correct
39 Correct 13 ms 11868 KB Output is correct
40 Correct 33 ms 13396 KB Output is correct
41 Correct 72 ms 37956 KB Output is correct
42 Correct 70 ms 38728 KB Output is correct
43 Correct 13 ms 11864 KB Output is correct
44 Correct 71 ms 38072 KB Output is correct
45 Correct 69 ms 38884 KB Output is correct
46 Correct 23 ms 12496 KB Output is correct
47 Correct 76 ms 37556 KB Output is correct
48 Correct 67 ms 39256 KB Output is correct
49 Correct 17 ms 12124 KB Output is correct
50 Correct 64 ms 23996 KB Output is correct
51 Correct 64 ms 37612 KB Output is correct
52 Correct 14 ms 11868 KB Output is correct
53 Correct 12 ms 11868 KB Output is correct
54 Correct 58 ms 25288 KB Output is correct
55 Correct 59 ms 24788 KB Output is correct
56 Correct 164 ms 46148 KB Output is correct
57 Correct 152 ms 44868 KB Output is correct
58 Correct 148 ms 44972 KB Output is correct
59 Correct 142 ms 42800 KB Output is correct
60 Correct 147 ms 33460 KB Output is correct
61 Correct 146 ms 43928 KB Output is correct
62 Correct 140 ms 41004 KB Output is correct
63 Correct 122 ms 40440 KB Output is correct
64 Correct 56 ms 14836 KB Output is correct
65 Correct 144 ms 43176 KB Output is correct
66 Correct 59 ms 15124 KB Output is correct
67 Correct 59 ms 16320 KB Output is correct
68 Correct 89 ms 38572 KB Output is correct
69 Correct 153 ms 43688 KB Output is correct
70 Correct 14 ms 12064 KB Output is correct
71 Correct 90 ms 39148 KB Output is correct
72 Correct 140 ms 42400 KB Output is correct
73 Correct 13 ms 11872 KB Output is correct
74 Correct 75 ms 26296 KB Output is correct
75 Correct 158 ms 46508 KB Output is correct
76 Correct 12 ms 11868 KB Output is correct
77 Correct 70 ms 26304 KB Output is correct
78 Correct 146 ms 40068 KB Output is correct

Subtask #4
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 44 ms 14800 KB Output is correct
2 Correct 38 ms 13016 KB Output is correct
3 Correct 14 ms 11864 KB Output is correct
4 Correct 14 ms 12060 KB Output is correct
5 Correct 166 ms 45460 KB Output is correct
6 Correct 161 ms 44756 KB Output is correct
7 Correct 194 ms 45580 KB Output is correct
8 Correct 159 ms 44044 KB Output is correct
9 Correct 185 ms 45232 KB Output is correct
10 Correct 166 ms 44712 KB Output is correct
11 Correct 161 ms 42296 KB Output is correct
12 Correct 130 ms 42572 KB Output is correct
13 Correct 104 ms 18104 KB Output is correct
14 Correct 166 ms 45188 KB Output is correct
15 Correct 183 ms 44936 KB Output is correct
16 Correct 79 ms 25536 KB Output is correct
17 Correct 93 ms 37920 KB Output is correct
18 Correct 185 ms 43920 KB Output is correct
19 Correct 85 ms 38828 KB Output is correct
20 Correct 86 ms 37664 KB Output is correct
21 Correct 152 ms 43416 KB Output is correct
22 Correct 71 ms 26552 KB Output is correct
23 Correct 87 ms 39344 KB Output is correct
24 Correct 169 ms 44720 KB Output is correct
25 Correct 70 ms 39340 KB Output is correct
26 Correct 67 ms 38316 KB Output is correct
27 Correct 141 ms 43200 KB Output is correct

Subtask #5
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 11888 KB Output is correct
2 Correct 5 ms 11876 KB Output is correct
3 Correct 7 ms 11872 KB Output is correct
4 Correct 6 ms 11868 KB Output is correct
5 Correct 7 ms 11888 KB Output is correct
6 Correct 6 ms 11876 KB Output is correct
7 Correct 5 ms 11864 KB Output is correct
8 Correct 5 ms 11816 KB Output is correct
9 Correct 4 ms 11356 KB Output is correct
10 Correct 5 ms 11876 KB Output is correct
11 Correct 4 ms 11356 KB Output is correct
12 Correct 4 ms 11552 KB Output is correct
13 Correct 4 ms 11804 KB Output is correct
14 Correct 6 ms 12128 KB Output is correct
15 Correct 4 ms 11548 KB Output is correct
16 Correct 5 ms 11808 KB Output is correct
17 Correct 5 ms 11864 KB Output is correct
18 Correct 5 ms 11356 KB Output is correct
19 Correct 4 ms 11808 KB Output is correct
20 Correct 5 ms 11884 KB Output is correct
21 Correct 3 ms 11100 KB Output is correct
22 Correct 4 ms 11804 KB Output is correct
23 Correct 5 ms 11816 KB Output is correct
24 Correct 4 ms 11356 KB Output is correct
25 Correct 4 ms 11508 KB Output is correct
26 Correct 5 ms 11876 KB Output is correct
27 Correct 5 ms 11864 KB Output is correct
28 Correct 4 ms 11816 KB Output is correct
29 Correct 75 ms 37828 KB Output is correct
30 Correct 72 ms 38336 KB Output is correct
31 Correct 71 ms 38336 KB Output is correct
32 Correct 68 ms 38580 KB Output is correct
33 Correct 61 ms 25300 KB Output is correct
34 Correct 61 ms 25024 KB Output is correct
35 Correct 74 ms 37556 KB Output is correct
36 Correct 71 ms 37596 KB Output is correct
37 Correct 13 ms 11868 KB Output is correct
38 Correct 77 ms 38552 KB Output is correct
39 Correct 13 ms 11868 KB Output is correct
40 Correct 33 ms 13396 KB Output is correct
41 Correct 72 ms 37956 KB Output is correct
42 Correct 70 ms 38728 KB Output is correct
43 Correct 13 ms 11864 KB Output is correct
44 Correct 71 ms 38072 KB Output is correct
45 Correct 69 ms 38884 KB Output is correct
46 Correct 23 ms 12496 KB Output is correct
47 Correct 76 ms 37556 KB Output is correct
48 Correct 67 ms 39256 KB Output is correct
49 Correct 17 ms 12124 KB Output is correct
50 Correct 64 ms 23996 KB Output is correct
51 Correct 64 ms 37612 KB Output is correct
52 Correct 14 ms 11868 KB Output is correct
53 Correct 12 ms 11868 KB Output is correct
54 Correct 58 ms 25288 KB Output is correct
55 Correct 59 ms 24788 KB Output is correct
56 Correct 164 ms 46148 KB Output is correct
57 Correct 152 ms 44868 KB Output is correct
58 Correct 148 ms 44972 KB Output is correct
59 Correct 142 ms 42800 KB Output is correct
60 Correct 147 ms 33460 KB Output is correct
61 Correct 146 ms 43928 KB Output is correct
62 Correct 140 ms 41004 KB Output is correct
63 Correct 122 ms 40440 KB Output is correct
64 Correct 56 ms 14836 KB Output is correct
65 Correct 144 ms 43176 KB Output is correct
66 Correct 59 ms 15124 KB Output is correct
67 Correct 59 ms 16320 KB Output is correct
68 Correct 89 ms 38572 KB Output is correct
69 Correct 153 ms 43688 KB Output is correct
70 Correct 14 ms 12064 KB Output is correct
71 Correct 90 ms 39148 KB Output is correct
72 Correct 140 ms 42400 KB Output is correct
73 Correct 13 ms 11872 KB Output is correct
74 Correct 75 ms 26296 KB Output is correct
75 Correct 158 ms 46508 KB Output is correct
76 Correct 12 ms 11868 KB Output is correct
77 Correct 70 ms 26304 KB Output is correct
78 Correct 146 ms 40068 KB Output is correct
79 Correct 44 ms 14800 KB Output is correct
80 Correct 38 ms 13016 KB Output is correct
81 Correct 14 ms 11864 KB Output is correct
82 Correct 14 ms 12060 KB Output is correct
83 Correct 166 ms 45460 KB Output is correct
84 Correct 161 ms 44756 KB Output is correct
85 Correct 194 ms 45580 KB Output is correct
86 Correct 159 ms 44044 KB Output is correct
87 Correct 185 ms 45232 KB Output is correct
88 Correct 166 ms 44712 KB Output is correct
89 Correct 161 ms 42296 KB Output is correct
90 Correct 130 ms 42572 KB Output is correct
91 Correct 104 ms 18104 KB Output is correct
92 Correct 166 ms 45188 KB Output is correct
93 Correct 183 ms 44936 KB Output is correct
94 Correct 79 ms 25536 KB Output is correct
95 Correct 93 ms 37920 KB Output is correct
96 Correct 185 ms 43920 KB Output is correct
97 Correct 85 ms 38828 KB Output is correct
98 Correct 86 ms 37664 KB Output is correct
99 Correct 152 ms 43416 KB Output is correct
100 Correct 71 ms 26552 KB Output is correct
101 Correct 87 ms 39344 KB Output is correct
102 Correct 169 ms 44720 KB Output is correct
103 Correct 70 ms 39340 KB Output is correct
104 Correct 67 ms 38316 KB Output is correct
105 Correct 141 ms 43200 KB Output is correct
106 Correct 39 ms 12880 KB Output is correct
107 Correct 47 ms 15044 KB Output is correct
108 Correct 39 ms 13520 KB Output is correct
109 Correct 44 ms 15572 KB Output is correct
110 Correct 175 ms 47116 KB Output is correct
111 Correct 184 ms 45236 KB Output is correct
112 Correct 180 ms 46508 KB Output is correct
113 Correct 209 ms 45236 KB Output is correct
114 Correct 187 ms 46912 KB Output is correct
115 Correct 173 ms 45740 KB Output is correct
116 Correct 195 ms 69156 KB Output is correct
117 Correct 153 ms 43644 KB Output is correct
118 Correct 113 ms 21328 KB Output is correct
119 Correct 53 ms 15188 KB Output is correct
120 Correct 192 ms 44548 KB Output is correct
121 Correct 84 ms 39084 KB Output is correct
122 Correct 99 ms 37772 KB Output is correct
123 Correct 180 ms 44720 KB Output is correct
124 Correct 75 ms 25520 KB Output is correct
125 Correct 109 ms 39328 KB Output is correct
126 Correct 162 ms 45876 KB Output is correct
127 Correct 70 ms 24768 KB Output is correct
128 Correct 96 ms 39692 KB Output is correct
129 Correct 210 ms 48092 KB Output is correct
130 Correct 82 ms 38068 KB Output is correct
131 Correct 120 ms 38568 KB Output is correct
132 Correct 159 ms 44628 KB Output is correct