oj.uz

Submission #1094214

# Submission time Handle Problem Language Result Execution time Memory
1094214 2024-09-29T03:05:00 Z 8pete8 Two Dishes (JOI19_dishes) C++17
100 / 100
 3535 ms 184192 KB 
#include<iostream>
#include<stack>
#include<map>
#include<vector>
#include<string>
#include<cassert>
#include<unordered_map>
#include <queue>
#include <cstdint>
#include<cstring>
#include<limits.h>
#include<cmath>
#include<set>
#include<algorithm>
#include <iomanip>
#include<numeric>
#include<bitset>
using namespace std;
#define ll long long
#define f first
#define s second
#define pii pair<int,int>
#define ppii pair<int,pii>
#define vi vector<int>
#define pb push_back
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define F(n) for(int i=0;i<n;i++)
#define lb lower_bound
#define ub upper_bound
#define fastio ios::sync_with_stdio(false);cin.tie(NULL);
#pragma GCC optimize ("03,unroll-lopps")
#define int long long
#define double long double
using namespace std;
const int mod=998244353,mxn=1e6+5,inf=1e16,minf=-1e16,lg=30;
//#undef int
int n,k,m,q;
void setIO(string name){
	ios_base::sync_with_stdio(0); cin.tie(0);		
	freopen((name+".in").c_str(),"r",stdin);		
	freopen((name+".out").c_str(),"w",stdout);	
}
pair<int,pii> v1[mxn+10],v2[mxn+10];
//time,before,point
struct seg{
    int v[4*mxn+10],lazy1[4*mxn+10],lazy2[4*mxn+10];
    void build(int l,int r,int pos){
        int mid=l+(r-l)/2;
        lazy2[pos]=minf;
        if(l==r)return;
        build(l,mid,pos*2);
        build(mid+1,r,pos*2+1);
    }
    void push(int l,int r,int pos){
        v[pos]=max(v[pos]+lazy1[pos],lazy2[pos]);
        if(l!=r){
            if(lazy2[pos*2]!=minf)lazy2[pos*2]+=lazy1[pos];
            if(lazy2[pos*2+1]!=minf)lazy2[pos*2+1]+=lazy1[pos];
            lazy1[pos*2+1]+=lazy1[pos];
            lazy1[pos*2]+=lazy1[pos];
            lazy2[pos*2]=max(lazy2[pos*2],lazy2[pos]);
            lazy2[pos*2+1]=max(lazy2[pos*2+1],lazy2[pos]);
        }
        
        lazy2[pos]=minf;
        lazy1[pos]=0;
    }
    void updateadd(int l,int r,int ql,int qr,int val,int pos){
        push(l,r,pos);
        if(l>qr||r<ql)return;
        if(l>=ql&&r<=qr){
            lazy1[pos]+=val;
            push(l,r,pos);
            return;
        }
        int mid=l+(r-l)/2;
        updateadd(l,mid,ql,qr,val,pos*2);
        updateadd(mid+1,r,ql,qr,val,pos*2+1);
        v[pos]=max(v[pos*2],v[pos*2+1]);
    }
    void updateset(int l,int r,int ql,int qr,int val,int pos){
        push(l,r,pos);
        if(l>qr||r<ql)return;
        if(l>=ql&&r<=qr){
            lazy2[pos]=max(lazy2[pos],val);
            push(l,r,pos);
            return;
        }
        int mid=l+(r-l)/2;
        updateset(l,mid,ql,qr,val,pos*2);
        updateset(mid+1,r,ql,qr,val,pos*2+1);
        v[pos]=max(v[pos*2],v[pos*2+1]);
    }
    int qry(int l,int r,int qpos,int pos){
        push(l,r,pos);
        if(l==r)return v[pos];
        int mid=l+(r-l)/2;
        if(qpos<=mid)return qry(l,mid,qpos,pos*2);
        return qry(mid+1,r,qpos,pos*2+1);
    }
}t;
int getbound(int x,int add){
	int l=0,r=n,pos=-1;
	while(l<=r){
		int mid=l+(r-l)/2;
		if(v1[mid].f+add<=x)l=mid+1,pos=max(pos,mid);
		else r=mid-1;
	}
	return pos;
}
int32_t main(){
    fastio
    //n^2 can use lazy seg to op
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		cin>>v1[i].f>>v1[i].s.f>>v1[i].s.s;
		v1[i].f+=v1[i-1].f;
	}
	for(int i=1;i<=m;i++){
		cin>>v2[i].f>>v2[i].s.f>>v2[i].s.s;
		v2[i].f+=v2[i-1].f;
	}
	int ans1=0;
	vector<pii>gap;
	for(int i=1;i<=n;i++){
		if(v1[i].f<=v1[i].s.f){
			gap.pb({v1[i].s.f-v1[i].f,i});
			ans1+=v1[i].s.s;
		}
	}
    t.build(0,n,1);
	sort(all(gap));
	int cur=0,bruh,where,x;
    vector<int32_t>cut;//
	for(int j=1;j<=m;j++){
		while(cur<gap.size()&&gap[cur].f<v2[j].f){
            t.updateadd(0,n,0,gap[cur].s-1,-v1[gap[cur].s].s.s,1);
            if(v1[gap[cur].s].s.s<0)cut.pb(gap[cur].s-1);
			cur++;
		}
        x=getbound(v2[j].s.f,v2[j].f);
        if(x!=-1){
            cut.pb(x);
            t.updateadd(0,n,0,x,v2[j].s.s,1);
            if(v2[j].s.s>0)cut.pb(x);
        }
        for(auto i:cut){
            bruh=t.qry(0,n,i,1);
            t.updateset(0,n,i+1,n,bruh,1);
        }
        cut.clear();
	}
    t.push(0,n,1);
    cout<<ans1+t.v[1]<<'\n';
}
/*
 
*/

Compilation message

dishes.cpp:32:40: warning: bad option '-funroll-lopps' to pragma 'optimize' [-Wpragmas]
   32 | #pragma GCC optimize ("03,unroll-lopps")
      |                                        ^
dishes.cpp:39:23: warning: bad option '-funroll-lopps' to attribute 'optimize' [-Wattributes]
   39 | void setIO(string name){
      |                       ^
dishes.cpp:48:35: warning: bad option '-funroll-lopps' to attribute 'optimize' [-Wattributes]
   48 |     void build(int l,int r,int pos){
      |                                   ^
dishes.cpp:55:34: warning: bad option '-funroll-lopps' to attribute 'optimize' [-Wattributes]
   55 |     void push(int l,int r,int pos){
      |                                  ^
dishes.cpp:69:61: warning: bad option '-funroll-lopps' to attribute 'optimize' [-Wattributes]
   69 |     void updateadd(int l,int r,int ql,int qr,int val,int pos){
      |                                                             ^
dishes.cpp:82:61: warning: bad option '-funroll-lopps' to attribute 'optimize' [-Wattributes]
   82 |     void updateset(int l,int r,int ql,int qr,int val,int pos){
      |                                                             ^
dishes.cpp:95:41: warning: bad option '-funroll-lopps' to attribute 'optimize' [-Wattributes]
   95 |     int qry(int l,int r,int qpos,int pos){
      |                                         ^
dishes.cpp:103:27: warning: bad option '-funroll-lopps' to attribute 'optimize' [-Wattributes]
  103 | int getbound(int x,int add){
      |                           ^
dishes.cpp:112:14: warning: bad option '-funroll-lopps' to attribute 'optimize' [-Wattributes]
  112 | int32_t main(){
      |              ^
dishes.cpp: In function 'int32_t main()':
dishes.cpp:137:12: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  137 |   while(cur<gap.size()&&gap[cur].f<v2[j].f){
      |         ~~~^~~~~~~~~~~
dishes.cpp:134:17: warning: unused variable 'where' [-Wunused-variable]
  134 |  int cur=0,bruh,where,x;
      |                 ^~~~~
dishes.cpp: In function 'void setIO(std::string)':
dishes.cpp:41:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   41 |  freopen((name+".in").c_str(),"r",stdin);
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dishes.cpp:42:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   42 |  freopen((name+".out").c_str(),"w",stdout);
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 302 ms 37856 KB Output is correct
2 Correct 301 ms 38080 KB Output is correct
3 Correct 153 ms 30668 KB Output is correct
4 Correct 232 ms 34764 KB Output is correct
5 Correct 0 ms 352 KB Output is correct
6 Correct 299 ms 36112 KB Output is correct
7 Correct 58 ms 11920 KB Output is correct
8 Correct 58 ms 19404 KB Output is correct
9 Correct 148 ms 31692 KB Output is correct
10 Correct 318 ms 32704 KB Output is correct
11 Correct 130 ms 25020 KB Output is correct

Subtask #2
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 600 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 352 KB Output is correct
9 Correct 1 ms 608 KB Output is correct
10 Correct 0 ms 352 KB Output is correct
11 Correct 1 ms 352 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 600 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 352 KB Output is correct
9 Correct 1 ms 608 KB Output is correct
10 Correct 0 ms 352 KB Output is correct
11 Correct 1 ms 352 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 2 ms 604 KB Output is correct
18 Correct 2 ms 604 KB Output is correct
19 Correct 3 ms 604 KB Output is correct
20 Correct 2 ms 604 KB Output is correct
21 Correct 3 ms 860 KB Output is correct
22 Correct 5 ms 604 KB Output is correct
23 Correct 3 ms 600 KB Output is correct

Subtask #4
39.0 / 39.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 600 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 352 KB Output is correct
9 Correct 1 ms 608 KB Output is correct
10 Correct 0 ms 352 KB Output is correct
11 Correct 1 ms 352 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 2 ms 604 KB Output is correct
18 Correct 2 ms 604 KB Output is correct
19 Correct 3 ms 604 KB Output is correct
20 Correct 2 ms 604 KB Output is correct
21 Correct 3 ms 860 KB Output is correct
22 Correct 5 ms 604 KB Output is correct
23 Correct 3 ms 600 KB Output is correct
24 Correct 209 ms 35996 KB Output is correct
25 Correct 315 ms 26312 KB Output is correct
26 Correct 181 ms 35964 KB Output is correct
27 Correct 270 ms 34540 KB Output is correct
28 Correct 229 ms 35848 KB Output is correct
29 Correct 132 ms 28516 KB Output is correct
30 Correct 516 ms 36020 KB Output is correct
31 Correct 46 ms 10216 KB Output is correct
32 Correct 118 ms 25800 KB Output is correct
33 Correct 308 ms 33996 KB Output is correct
34 Correct 429 ms 35780 KB Output is correct
35 Correct 487 ms 29436 KB Output is correct
36 Correct 523 ms 29620 KB Output is correct

Subtask #5
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 600 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 352 KB Output is correct
9 Correct 1 ms 608 KB Output is correct
10 Correct 0 ms 352 KB Output is correct
11 Correct 1 ms 352 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 2 ms 604 KB Output is correct
18 Correct 2 ms 604 KB Output is correct
19 Correct 3 ms 604 KB Output is correct
20 Correct 2 ms 604 KB Output is correct
21 Correct 3 ms 860 KB Output is correct
22 Correct 5 ms 604 KB Output is correct
23 Correct 3 ms 600 KB Output is correct
24 Correct 209 ms 35996 KB Output is correct
25 Correct 315 ms 26312 KB Output is correct
26 Correct 181 ms 35964 KB Output is correct
27 Correct 270 ms 34540 KB Output is correct
28 Correct 229 ms 35848 KB Output is correct
29 Correct 132 ms 28516 KB Output is correct
30 Correct 516 ms 36020 KB Output is correct
31 Correct 46 ms 10216 KB Output is correct
32 Correct 118 ms 25800 KB Output is correct
33 Correct 308 ms 33996 KB Output is correct
34 Correct 429 ms 35780 KB Output is correct
35 Correct 487 ms 29436 KB Output is correct
36 Correct 523 ms 29620 KB Output is correct
37 Correct 175 ms 38852 KB Output is correct
38 Correct 296 ms 37324 KB Output is correct
39 Correct 322 ms 36268 KB Output is correct
40 Correct 350 ms 36372 KB Output is correct
41 Correct 0 ms 348 KB Output is correct
42 Correct 545 ms 39092 KB Output is correct
43 Correct 311 ms 37080 KB Output is correct
44 Correct 437 ms 38564 KB Output is correct
45 Correct 478 ms 32528 KB Output is correct

Subtask #6
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 600 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 352 KB Output is correct
9 Correct 1 ms 608 KB Output is correct
10 Correct 0 ms 352 KB Output is correct
11 Correct 1 ms 352 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 2 ms 604 KB Output is correct
18 Correct 2 ms 604 KB Output is correct
19 Correct 3 ms 604 KB Output is correct
20 Correct 2 ms 604 KB Output is correct
21 Correct 3 ms 860 KB Output is correct
22 Correct 5 ms 604 KB Output is correct
23 Correct 3 ms 600 KB Output is correct
24 Correct 209 ms 35996 KB Output is correct
25 Correct 315 ms 26312 KB Output is correct
26 Correct 181 ms 35964 KB Output is correct
27 Correct 270 ms 34540 KB Output is correct
28 Correct 229 ms 35848 KB Output is correct
29 Correct 132 ms 28516 KB Output is correct
30 Correct 516 ms 36020 KB Output is correct
31 Correct 46 ms 10216 KB Output is correct
32 Correct 118 ms 25800 KB Output is correct
33 Correct 308 ms 33996 KB Output is correct
34 Correct 429 ms 35780 KB Output is correct
35 Correct 487 ms 29436 KB Output is correct
36 Correct 523 ms 29620 KB Output is correct
37 Correct 175 ms 38852 KB Output is correct
38 Correct 296 ms 37324 KB Output is correct
39 Correct 322 ms 36268 KB Output is correct
40 Correct 350 ms 36372 KB Output is correct
41 Correct 0 ms 348 KB Output is correct
42 Correct 545 ms 39092 KB Output is correct
43 Correct 311 ms 37080 KB Output is correct
44 Correct 437 ms 38564 KB Output is correct
45 Correct 478 ms 32528 KB Output is correct
46 Correct 907 ms 182176 KB Output is correct
47 Correct 1604 ms 174336 KB Output is correct
48 Correct 1861 ms 168604 KB Output is correct
49 Correct 1852 ms 168596 KB Output is correct
50 Correct 3535 ms 182092 KB Output is correct
51 Correct 1972 ms 169396 KB Output is correct
52 Correct 2536 ms 175500 KB Output is correct
53 Correct 3248 ms 150644 KB Output is correct

Subtask #7
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 302 ms 37856 KB Output is correct
2 Correct 301 ms 38080 KB Output is correct
3 Correct 153 ms 30668 KB Output is correct
4 Correct 232 ms 34764 KB Output is correct
5 Correct 0 ms 352 KB Output is correct
6 Correct 299 ms 36112 KB Output is correct
7 Correct 58 ms 11920 KB Output is correct
8 Correct 58 ms 19404 KB Output is correct
9 Correct 148 ms 31692 KB Output is correct
10 Correct 318 ms 32704 KB Output is correct
11 Correct 130 ms 25020 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 600 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 352 KB Output is correct
20 Correct 1 ms 608 KB Output is correct
21 Correct 0 ms 352 KB Output is correct
22 Correct 1 ms 352 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 2 ms 604 KB Output is correct
29 Correct 2 ms 604 KB Output is correct
30 Correct 3 ms 604 KB Output is correct
31 Correct 2 ms 604 KB Output is correct
32 Correct 3 ms 860 KB Output is correct
33 Correct 5 ms 604 KB Output is correct
34 Correct 3 ms 600 KB Output is correct
35 Correct 209 ms 35996 KB Output is correct
36 Correct 315 ms 26312 KB Output is correct
37 Correct 181 ms 35964 KB Output is correct
38 Correct 270 ms 34540 KB Output is correct
39 Correct 229 ms 35848 KB Output is correct
40 Correct 132 ms 28516 KB Output is correct
41 Correct 516 ms 36020 KB Output is correct
42 Correct 46 ms 10216 KB Output is correct
43 Correct 118 ms 25800 KB Output is correct
44 Correct 308 ms 33996 KB Output is correct
45 Correct 429 ms 35780 KB Output is correct
46 Correct 487 ms 29436 KB Output is correct
47 Correct 523 ms 29620 KB Output is correct
48 Correct 175 ms 38852 KB Output is correct
49 Correct 296 ms 37324 KB Output is correct
50 Correct 322 ms 36268 KB Output is correct
51 Correct 350 ms 36372 KB Output is correct
52 Correct 0 ms 348 KB Output is correct
53 Correct 545 ms 39092 KB Output is correct
54 Correct 311 ms 37080 KB Output is correct
55 Correct 437 ms 38564 KB Output is correct
56 Correct 478 ms 32528 KB Output is correct
57 Correct 272 ms 39544 KB Output is correct
58 Correct 238 ms 37916 KB Output is correct
59 Correct 288 ms 37444 KB Output is correct
60 Correct 390 ms 37236 KB Output is correct
61 Correct 438 ms 36164 KB Output is correct
62 Correct 0 ms 344 KB Output is correct
63 Correct 523 ms 39244 KB Output is correct
64 Correct 310 ms 37068 KB Output is correct
65 Correct 425 ms 38592 KB Output is correct
66 Correct 476 ms 32708 KB Output is correct

Subtask #8
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 302 ms 37856 KB Output is correct
2 Correct 301 ms 38080 KB Output is correct
3 Correct 153 ms 30668 KB Output is correct
4 Correct 232 ms 34764 KB Output is correct
5 Correct 0 ms 352 KB Output is correct
6 Correct 299 ms 36112 KB Output is correct
7 Correct 58 ms 11920 KB Output is correct
8 Correct 58 ms 19404 KB Output is correct
9 Correct 148 ms 31692 KB Output is correct
10 Correct 318 ms 32704 KB Output is correct
11 Correct 130 ms 25020 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 600 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 352 KB Output is correct
20 Correct 1 ms 608 KB Output is correct
21 Correct 0 ms 352 KB Output is correct
22 Correct 1 ms 352 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 2 ms 604 KB Output is correct
29 Correct 2 ms 604 KB Output is correct
30 Correct 3 ms 604 KB Output is correct
31 Correct 2 ms 604 KB Output is correct
32 Correct 3 ms 860 KB Output is correct
33 Correct 5 ms 604 KB Output is correct
34 Correct 3 ms 600 KB Output is correct
35 Correct 209 ms 35996 KB Output is correct
36 Correct 315 ms 26312 KB Output is correct
37 Correct 181 ms 35964 KB Output is correct
38 Correct 270 ms 34540 KB Output is correct
39 Correct 229 ms 35848 KB Output is correct
40 Correct 132 ms 28516 KB Output is correct
41 Correct 516 ms 36020 KB Output is correct
42 Correct 46 ms 10216 KB Output is correct
43 Correct 118 ms 25800 KB Output is correct
44 Correct 308 ms 33996 KB Output is correct
45 Correct 429 ms 35780 KB Output is correct
46 Correct 487 ms 29436 KB Output is correct
47 Correct 523 ms 29620 KB Output is correct
48 Correct 175 ms 38852 KB Output is correct
49 Correct 296 ms 37324 KB Output is correct
50 Correct 322 ms 36268 KB Output is correct
51 Correct 350 ms 36372 KB Output is correct
52 Correct 0 ms 348 KB Output is correct
53 Correct 545 ms 39092 KB Output is correct
54 Correct 311 ms 37080 KB Output is correct
55 Correct 437 ms 38564 KB Output is correct
56 Correct 478 ms 32528 KB Output is correct
57 Correct 907 ms 182176 KB Output is correct
58 Correct 1604 ms 174336 KB Output is correct
59 Correct 1861 ms 168604 KB Output is correct
60 Correct 1852 ms 168596 KB Output is correct
61 Correct 3535 ms 182092 KB Output is correct
62 Correct 1972 ms 169396 KB Output is correct
63 Correct 2536 ms 175500 KB Output is correct
64 Correct 3248 ms 150644 KB Output is correct
65 Correct 272 ms 39544 KB Output is correct
66 Correct 238 ms 37916 KB Output is correct
67 Correct 288 ms 37444 KB Output is correct
68 Correct 390 ms 37236 KB Output is correct
69 Correct 438 ms 36164 KB Output is correct
70 Correct 0 ms 344 KB Output is correct
71 Correct 523 ms 39244 KB Output is correct
72 Correct 310 ms 37068 KB Output is correct
73 Correct 425 ms 38592 KB Output is correct
74 Correct 476 ms 32708 KB Output is correct
75 Correct 1257 ms 184192 KB Output is correct
76 Correct 1272 ms 176224 KB Output is correct
77 Correct 1430 ms 171084 KB Output is correct
78 Correct 2176 ms 171116 KB Output is correct
79 Correct 3396 ms 182992 KB Output is correct
80 Correct 2001 ms 170700 KB Output is correct
81 Correct 2660 ms 175264 KB Output is correct
82 Correct 3167 ms 150428 KB Output is correct
83 Correct 3382 ms 170388 KB Output is correct