oj.uz

Submission #1094210

# Submission time Handle Problem Language Result Execution time Memory
1094210 2024-09-29T02:50:27 Z 8pete8 Two Dishes (JOI19_dishes) C++17
82 / 100
 986 ms 219840 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
int gap[mxn+10],dp[mxn+10],suf[mxn+10];
struct seg{
    int v[4*mxn+10],lazy1[4*mxn+10],lazy2[4*mxn+10];
    void init(){for(int i=0;i<=5*(n+1);i++)lazy2[i]=minf,v[i]=minf;}
    void build(int l,int r,int pos){
        int mid=l+(r-l)/2;
        v[pos]=0;
        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]);
        }
        //22 oct 17.50
        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);
    }
    int search(int l,int r,int ql,int qr,int val,int pos){
        //search pos where i<x
        push(l,r,pos);
        int mid=l+(r-l)/2;
        if(l>qr||r<ql)return -1;
        if(l>=ql&&r<=qr){
            if(l==r){
                if(v[pos]<val)return r;
                return -1;
            }
            if(v[pos]<val)return r;
            else{
                push(l,mid,pos*2);
                push(mid+1,r,pos*2+1);
                if(v[pos*2]<val)return max(mid,search(mid+1,r,ql,qr,val,pos*2+1));
                else return search(l,mid,ql,qr,val,pos*2);
            }
        }
        return max(search(l,mid,ql,qr,val,pos*2),search(mid+1,r,ql,qr,val,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.init();
    t.build(0,n,1);
	sort(all(gap));
	int cur=0,bruh,where;
    vector<int>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++;
		}
		int 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:49:15: warning: bad option '-funroll-lopps' to attribute 'optimize' [-Wattributes]
   49 |     void init(){for(int i=0;i<=5*(n+1);i++)lazy2[i]=minf,v[i]=minf;}
      |               ^
dishes.cpp:50:35: warning: bad option '-funroll-lopps' to attribute 'optimize' [-Wattributes]
   50 |     void build(int l,int r,int pos){
      |                                   ^
dishes.cpp:57:34: warning: bad option '-funroll-lopps' to attribute 'optimize' [-Wattributes]
   57 |     void push(int l,int r,int pos){
      |                                  ^
dishes.cpp:71:61: warning: bad option '-funroll-lopps' to attribute 'optimize' [-Wattributes]
   71 |     void updateadd(int l,int r,int ql,int qr,int val,int pos){
      |                                                             ^
dishes.cpp:84:61: warning: bad option '-funroll-lopps' to attribute 'optimize' [-Wattributes]
   84 |     void updateset(int l,int r,int ql,int qr,int val,int pos){
      |                                                             ^
dishes.cpp:97:41: warning: bad option '-funroll-lopps' to attribute 'optimize' [-Wattributes]
   97 |     int qry(int l,int r,int qpos,int pos){
      |                                         ^
dishes.cpp:104:57: warning: bad option '-funroll-lopps' to attribute 'optimize' [-Wattributes]
  104 |     int search(int l,int r,int ql,int qr,int val,int pos){
      |                                                         ^
dishes.cpp:125:27: warning: bad option '-funroll-lopps' to attribute 'optimize' [-Wattributes]
  125 | int getbound(int x,int add){
      |                           ^
dishes.cpp:134:14: warning: bad option '-funroll-lopps' to attribute 'optimize' [-Wattributes]
  134 | int32_t main(){
      |              ^
dishes.cpp: In function 'int32_t main()':
dishes.cpp:160: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]
  160 |   while(cur<gap.size()&&gap[cur].f<v2[j].f){
      |         ~~~^~~~~~~~~~~
dishes.cpp:157:17: warning: unused variable 'where' [-Wunused-variable]
  157 |  int cur=0,bruh,where;
      |                 ^~~~~
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 312 ms 47044 KB Output is correct
2 Correct 317 ms 47012 KB Output is correct
3 Correct 145 ms 43660 KB Output is correct
4 Correct 254 ms 44872 KB Output is correct
5 Correct 1 ms 6496 KB Output is correct
6 Correct 276 ms 45772 KB Output is correct
7 Correct 53 ms 14144 KB Output is correct
8 Correct 59 ms 32468 KB Output is correct
9 Correct 156 ms 44488 KB Output is correct
10 Correct 323 ms 41668 KB Output is correct
11 Correct 128 ms 37924 KB Output is correct

Subtask #2
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6488 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 6604 KB Output is correct
4 Correct 1 ms 6492 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 1 ms 6500 KB Output is correct
8 Correct 1 ms 6500 KB Output is correct
9 Correct 1 ms 6500 KB Output is correct
10 Correct 1 ms 6492 KB Output is correct
11 Correct 1 ms 6492 KB Output is correct
12 Correct 1 ms 6500 KB Output is correct
13 Correct 1 ms 6488 KB Output is correct
14 Correct 1 ms 6492 KB Output is correct
15 Correct 1 ms 6492 KB Output is correct
16 Correct 1 ms 6492 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6488 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 6604 KB Output is correct
4 Correct 1 ms 6492 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 1 ms 6500 KB Output is correct
8 Correct 1 ms 6500 KB Output is correct
9 Correct 1 ms 6500 KB Output is correct
10 Correct 1 ms 6492 KB Output is correct
11 Correct 1 ms 6492 KB Output is correct
12 Correct 1 ms 6500 KB Output is correct
13 Correct 1 ms 6488 KB Output is correct
14 Correct 1 ms 6492 KB Output is correct
15 Correct 1 ms 6492 KB Output is correct
16 Correct 1 ms 6492 KB Output is correct
17 Correct 2 ms 6748 KB Output is correct
18 Correct 3 ms 6848 KB Output is correct
19 Correct 4 ms 6708 KB Output is correct
20 Correct 3 ms 6748 KB Output is correct
21 Correct 3 ms 6748 KB Output is correct
22 Correct 3 ms 6648 KB Output is correct
23 Correct 3 ms 6748 KB Output is correct

Subtask #4
39.0 / 39.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6488 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 6604 KB Output is correct
4 Correct 1 ms 6492 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 1 ms 6500 KB Output is correct
8 Correct 1 ms 6500 KB Output is correct
9 Correct 1 ms 6500 KB Output is correct
10 Correct 1 ms 6492 KB Output is correct
11 Correct 1 ms 6492 KB Output is correct
12 Correct 1 ms 6500 KB Output is correct
13 Correct 1 ms 6488 KB Output is correct
14 Correct 1 ms 6492 KB Output is correct
15 Correct 1 ms 6492 KB Output is correct
16 Correct 1 ms 6492 KB Output is correct
17 Correct 2 ms 6748 KB Output is correct
18 Correct 3 ms 6848 KB Output is correct
19 Correct 4 ms 6708 KB Output is correct
20 Correct 3 ms 6748 KB Output is correct
21 Correct 3 ms 6748 KB Output is correct
22 Correct 3 ms 6648 KB Output is correct
23 Correct 3 ms 6748 KB Output is correct
24 Correct 196 ms 44744 KB Output is correct
25 Correct 306 ms 39116 KB Output is correct
26 Correct 159 ms 44860 KB Output is correct
27 Correct 288 ms 43460 KB Output is correct
28 Correct 228 ms 44740 KB Output is correct
29 Correct 139 ms 41408 KB Output is correct
30 Correct 489 ms 44732 KB Output is correct
31 Correct 52 ms 12620 KB Output is correct
32 Correct 102 ms 34872 KB Output is correct
33 Correct 298 ms 42544 KB Output is correct
34 Correct 424 ms 44712 KB Output is correct
35 Correct 481 ms 38344 KB Output is correct
36 Correct 452 ms 38336 KB Output is correct

Subtask #5
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6488 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 6604 KB Output is correct
4 Correct 1 ms 6492 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 1 ms 6500 KB Output is correct
8 Correct 1 ms 6500 KB Output is correct
9 Correct 1 ms 6500 KB Output is correct
10 Correct 1 ms 6492 KB Output is correct
11 Correct 1 ms 6492 KB Output is correct
12 Correct 1 ms 6500 KB Output is correct
13 Correct 1 ms 6488 KB Output is correct
14 Correct 1 ms 6492 KB Output is correct
15 Correct 1 ms 6492 KB Output is correct
16 Correct 1 ms 6492 KB Output is correct
17 Correct 2 ms 6748 KB Output is correct
18 Correct 3 ms 6848 KB Output is correct
19 Correct 4 ms 6708 KB Output is correct
20 Correct 3 ms 6748 KB Output is correct
21 Correct 3 ms 6748 KB Output is correct
22 Correct 3 ms 6648 KB Output is correct
23 Correct 3 ms 6748 KB Output is correct
24 Correct 196 ms 44744 KB Output is correct
25 Correct 306 ms 39116 KB Output is correct
26 Correct 159 ms 44860 KB Output is correct
27 Correct 288 ms 43460 KB Output is correct
28 Correct 228 ms 44740 KB Output is correct
29 Correct 139 ms 41408 KB Output is correct
30 Correct 489 ms 44732 KB Output is correct
31 Correct 52 ms 12620 KB Output is correct
32 Correct 102 ms 34872 KB Output is correct
33 Correct 298 ms 42544 KB Output is correct
34 Correct 424 ms 44712 KB Output is correct
35 Correct 481 ms 38344 KB Output is correct
36 Correct 452 ms 38336 KB Output is correct
37 Correct 179 ms 47812 KB Output is correct
38 Correct 304 ms 46244 KB Output is correct
39 Correct 314 ms 45252 KB Output is correct
40 Correct 323 ms 45248 KB Output is correct
41 Correct 1 ms 6492 KB Output is correct
42 Correct 510 ms 48040 KB Output is correct
43 Correct 328 ms 45516 KB Output is correct
44 Correct 418 ms 47388 KB Output is correct
45 Correct 487 ms 41648 KB Output is correct

Subtask #6
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6488 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 6604 KB Output is correct
4 Correct 1 ms 6492 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 1 ms 6500 KB Output is correct
8 Correct 1 ms 6500 KB Output is correct
9 Correct 1 ms 6500 KB Output is correct
10 Correct 1 ms 6492 KB Output is correct
11 Correct 1 ms 6492 KB Output is correct
12 Correct 1 ms 6500 KB Output is correct
13 Correct 1 ms 6488 KB Output is correct
14 Correct 1 ms 6492 KB Output is correct
15 Correct 1 ms 6492 KB Output is correct
16 Correct 1 ms 6492 KB Output is correct
17 Correct 2 ms 6748 KB Output is correct
18 Correct 3 ms 6848 KB Output is correct
19 Correct 4 ms 6708 KB Output is correct
20 Correct 3 ms 6748 KB Output is correct
21 Correct 3 ms 6748 KB Output is correct
22 Correct 3 ms 6648 KB Output is correct
23 Correct 3 ms 6748 KB Output is correct
24 Correct 196 ms 44744 KB Output is correct
25 Correct 306 ms 39116 KB Output is correct
26 Correct 159 ms 44860 KB Output is correct
27 Correct 288 ms 43460 KB Output is correct
28 Correct 228 ms 44740 KB Output is correct
29 Correct 139 ms 41408 KB Output is correct
30 Correct 489 ms 44732 KB Output is correct
31 Correct 52 ms 12620 KB Output is correct
32 Correct 102 ms 34872 KB Output is correct
33 Correct 298 ms 42544 KB Output is correct
34 Correct 424 ms 44712 KB Output is correct
35 Correct 481 ms 38344 KB Output is correct
36 Correct 452 ms 38336 KB Output is correct
37 Correct 179 ms 47812 KB Output is correct
38 Correct 304 ms 46244 KB Output is correct
39 Correct 314 ms 45252 KB Output is correct
40 Correct 323 ms 45248 KB Output is correct
41 Correct 1 ms 6492 KB Output is correct
42 Correct 510 ms 48040 KB Output is correct
43 Correct 328 ms 45516 KB Output is correct
44 Correct 418 ms 47388 KB Output is correct
45 Correct 487 ms 41648 KB Output is correct
46 Incorrect 986 ms 219840 KB Output isn't correct
47 Halted 0 ms 0 KB -

Subtask #7
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 312 ms 47044 KB Output is correct
2 Correct 317 ms 47012 KB Output is correct
3 Correct 145 ms 43660 KB Output is correct
4 Correct 254 ms 44872 KB Output is correct
5 Correct 1 ms 6496 KB Output is correct
6 Correct 276 ms 45772 KB Output is correct
7 Correct 53 ms 14144 KB Output is correct
8 Correct 59 ms 32468 KB Output is correct
9 Correct 156 ms 44488 KB Output is correct
10 Correct 323 ms 41668 KB Output is correct
11 Correct 128 ms 37924 KB Output is correct
12 Correct 1 ms 6488 KB Output is correct
13 Correct 1 ms 6492 KB Output is correct
14 Correct 1 ms 6604 KB Output is correct
15 Correct 1 ms 6492 KB Output is correct
16 Correct 1 ms 6492 KB Output is correct
17 Correct 1 ms 6492 KB Output is correct
18 Correct 1 ms 6500 KB Output is correct
19 Correct 1 ms 6500 KB Output is correct
20 Correct 1 ms 6500 KB Output is correct
21 Correct 1 ms 6492 KB Output is correct
22 Correct 1 ms 6492 KB Output is correct
23 Correct 1 ms 6500 KB Output is correct
24 Correct 1 ms 6488 KB Output is correct
25 Correct 1 ms 6492 KB Output is correct
26 Correct 1 ms 6492 KB Output is correct
27 Correct 1 ms 6492 KB Output is correct
28 Correct 2 ms 6748 KB Output is correct
29 Correct 3 ms 6848 KB Output is correct
30 Correct 4 ms 6708 KB Output is correct
31 Correct 3 ms 6748 KB Output is correct
32 Correct 3 ms 6748 KB Output is correct
33 Correct 3 ms 6648 KB Output is correct
34 Correct 3 ms 6748 KB Output is correct
35 Correct 196 ms 44744 KB Output is correct
36 Correct 306 ms 39116 KB Output is correct
37 Correct 159 ms 44860 KB Output is correct
38 Correct 288 ms 43460 KB Output is correct
39 Correct 228 ms 44740 KB Output is correct
40 Correct 139 ms 41408 KB Output is correct
41 Correct 489 ms 44732 KB Output is correct
42 Correct 52 ms 12620 KB Output is correct
43 Correct 102 ms 34872 KB Output is correct
44 Correct 298 ms 42544 KB Output is correct
45 Correct 424 ms 44712 KB Output is correct
46 Correct 481 ms 38344 KB Output is correct
47 Correct 452 ms 38336 KB Output is correct
48 Correct 179 ms 47812 KB Output is correct
49 Correct 304 ms 46244 KB Output is correct
50 Correct 314 ms 45252 KB Output is correct
51 Correct 323 ms 45248 KB Output is correct
52 Correct 1 ms 6492 KB Output is correct
53 Correct 510 ms 48040 KB Output is correct
54 Correct 328 ms 45516 KB Output is correct
55 Correct 418 ms 47388 KB Output is correct
56 Correct 487 ms 41648 KB Output is correct
57 Correct 236 ms 48316 KB Output is correct
58 Correct 231 ms 46792 KB Output is correct
59 Correct 269 ms 46272 KB Output is correct
60 Correct 396 ms 46296 KB Output is correct
61 Correct 428 ms 44848 KB Output is correct
62 Correct 1 ms 6492 KB Output is correct
63 Correct 531 ms 48176 KB Output is correct
64 Correct 311 ms 45888 KB Output is correct
65 Correct 435 ms 47036 KB Output is correct
66 Correct 493 ms 41672 KB Output is correct

Subtask #8
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 312 ms 47044 KB Output is correct
2 Correct 317 ms 47012 KB Output is correct
3 Correct 145 ms 43660 KB Output is correct
4 Correct 254 ms 44872 KB Output is correct
5 Correct 1 ms 6496 KB Output is correct
6 Correct 276 ms 45772 KB Output is correct
7 Correct 53 ms 14144 KB Output is correct
8 Correct 59 ms 32468 KB Output is correct
9 Correct 156 ms 44488 KB Output is correct
10 Correct 323 ms 41668 KB Output is correct
11 Correct 128 ms 37924 KB Output is correct
12 Correct 1 ms 6488 KB Output is correct
13 Correct 1 ms 6492 KB Output is correct
14 Correct 1 ms 6604 KB Output is correct
15 Correct 1 ms 6492 KB Output is correct
16 Correct 1 ms 6492 KB Output is correct
17 Correct 1 ms 6492 KB Output is correct
18 Correct 1 ms 6500 KB Output is correct
19 Correct 1 ms 6500 KB Output is correct
20 Correct 1 ms 6500 KB Output is correct
21 Correct 1 ms 6492 KB Output is correct
22 Correct 1 ms 6492 KB Output is correct
23 Correct 1 ms 6500 KB Output is correct
24 Correct 1 ms 6488 KB Output is correct
25 Correct 1 ms 6492 KB Output is correct
26 Correct 1 ms 6492 KB Output is correct
27 Correct 1 ms 6492 KB Output is correct
28 Correct 2 ms 6748 KB Output is correct
29 Correct 3 ms 6848 KB Output is correct
30 Correct 4 ms 6708 KB Output is correct
31 Correct 3 ms 6748 KB Output is correct
32 Correct 3 ms 6748 KB Output is correct
33 Correct 3 ms 6648 KB Output is correct
34 Correct 3 ms 6748 KB Output is correct
35 Correct 196 ms 44744 KB Output is correct
36 Correct 306 ms 39116 KB Output is correct
37 Correct 159 ms 44860 KB Output is correct
38 Correct 288 ms 43460 KB Output is correct
39 Correct 228 ms 44740 KB Output is correct
40 Correct 139 ms 41408 KB Output is correct
41 Correct 489 ms 44732 KB Output is correct
42 Correct 52 ms 12620 KB Output is correct
43 Correct 102 ms 34872 KB Output is correct
44 Correct 298 ms 42544 KB Output is correct
45 Correct 424 ms 44712 KB Output is correct
46 Correct 481 ms 38344 KB Output is correct
47 Correct 452 ms 38336 KB Output is correct
48 Correct 179 ms 47812 KB Output is correct
49 Correct 304 ms 46244 KB Output is correct
50 Correct 314 ms 45252 KB Output is correct
51 Correct 323 ms 45248 KB Output is correct
52 Correct 1 ms 6492 KB Output is correct
53 Correct 510 ms 48040 KB Output is correct
54 Correct 328 ms 45516 KB Output is correct
55 Correct 418 ms 47388 KB Output is correct
56 Correct 487 ms 41648 KB Output is correct
57 Incorrect 986 ms 219840 KB Output isn't correct
58 Halted 0 ms 0 KB -