oj.uz

Submission #1094025

# Submission time Handle Problem Language Result Execution time Memory
1094025 2024-09-28T10:43:44 Z 8pete8 Two Dishes (JOI19_dishes) C++17
74 / 100
 3934 ms 197168 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=1e18,minf=-1e18,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<=4*(n+1);i++)lazy2[i]=inf;}
    void push(int l,int r,int pos){
        if(lazy2[pos]!=inf)v[pos]=lazy2[pos];
        v[pos]+=lazy1[pos];
        if(l!=r){
            if(lazy2[pos]!=inf)lazy1[pos*2+1]=0,lazy1[pos*2]=0;
            lazy1[pos*2+1]+=lazy1[pos];
            lazy1[pos*2]+=lazy1[pos];
            if(lazy2[pos]!=inf){
                lazy2[pos*2+1]=lazy2[pos];
                lazy2[pos*2]=lazy2[pos];
            }
        }
        lazy2[pos]=inf;
        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]=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;
}
int getpos(int x,int st){
    int l=st,r=n,pos=-1;
    while(l<=r){
        int mid=l+(r-l)/2;
        if(t.qry(0,n,mid,1)<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,ans2=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();
	sort(all(gap));
	int cur=0,bruh,where;
	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){
                bruh=t.qry(0,n,gap[cur].s-1,1);
                where=t.search(0,n,gap[cur].s,n,bruh,1);
                if(where!=-1)t.updateset(0,n,gap[cur].s,where,bruh,1);
            }
			cur++;
		}
		int x=getbound(v2[j].s.f,v2[j].f);
        if(x!=-1)t.updateadd(0,n,0,x,v2[j].s.s,1);
        t.push(0,n,1);
        ans2=max(ans2,t.v[1]);
        if(x!=-1){
            bruh=t.qry(0,n,x,1);
            where=t.search(0,n,x+1,n,bruh,1);
            if(where!=-1)t.updateset(0,n,x+1,where,bruh,1);
        }
	}
    cout<<ans1+ans2<<'\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<=4*(n+1);i++)lazy2[i]=inf;}
      |               ^
dishes.cpp:50:34: warning: bad option '-funroll-lopps' to attribute 'optimize' [-Wattributes]
   50 |     void push(int l,int r,int pos){
      |                                  ^
dishes.cpp:65:61: warning: bad option '-funroll-lopps' to attribute 'optimize' [-Wattributes]
   65 |     void updateadd(int l,int r,int ql,int qr,int val,int pos){
      |                                                             ^
dishes.cpp:78:61: warning: bad option '-funroll-lopps' to attribute 'optimize' [-Wattributes]
   78 |     void updateset(int l,int r,int ql,int qr,int val,int pos){
      |                                                             ^
dishes.cpp:91:41: warning: bad option '-funroll-lopps' to attribute 'optimize' [-Wattributes]
   91 |     int qry(int l,int r,int qpos,int pos){
      |                                         ^
dishes.cpp:98:57: warning: bad option '-funroll-lopps' to attribute 'optimize' [-Wattributes]
   98 |     int search(int l,int r,int ql,int qr,int val,int pos){
      |                                                         ^
dishes.cpp:119:27: warning: bad option '-funroll-lopps' to attribute 'optimize' [-Wattributes]
  119 | int getbound(int x,int add){
      |                           ^
dishes.cpp:128:24: warning: bad option '-funroll-lopps' to attribute 'optimize' [-Wattributes]
  128 | int getpos(int x,int st){
      |                        ^
dishes.cpp:137:14: warning: bad option '-funroll-lopps' to attribute 'optimize' [-Wattributes]
  137 | int32_t main(){
      |              ^
dishes.cpp: In function 'int32_t main()':
dishes.cpp:161: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]
  161 |   while(cur<gap.size()&&gap[cur].f<v2[j].f){
      |         ~~~^~~~~~~~~~~
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 236 ms 40004 KB Output is correct
2 Correct 298 ms 40124 KB Output is correct
3 Correct 123 ms 32600 KB Output is correct
4 Correct 220 ms 36804 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 280 ms 38080 KB Output is correct
7 Correct 57 ms 11856 KB Output is correct
8 Correct 54 ms 21776 KB Output is correct
9 Correct 130 ms 33812 KB Output is correct
10 Correct 322 ms 34852 KB Output is correct
11 Correct 103 ms 27104 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 348 KB Output is correct
3 Correct 0 ms 464 KB Output is correct
4 Correct 0 ms 464 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 460 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 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 460 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 348 KB Output is correct
3 Correct 0 ms 464 KB Output is correct
4 Correct 0 ms 464 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 460 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 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 460 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 2 ms 860 KB Output is correct
18 Correct 3 ms 604 KB Output is correct
19 Correct 3 ms 884 KB Output is correct
20 Correct 3 ms 604 KB Output is correct
21 Correct 4 ms 860 KB Output is correct
22 Correct 3 ms 604 KB Output is correct
23 Correct 3 ms 804 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 348 KB Output is correct
3 Correct 0 ms 464 KB Output is correct
4 Correct 0 ms 464 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 460 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 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 460 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 2 ms 860 KB Output is correct
18 Correct 3 ms 604 KB Output is correct
19 Correct 3 ms 884 KB Output is correct
20 Correct 3 ms 604 KB Output is correct
21 Correct 4 ms 860 KB Output is correct
22 Correct 3 ms 604 KB Output is correct
23 Correct 3 ms 804 KB Output is correct
24 Correct 182 ms 38088 KB Output is correct
25 Correct 237 ms 28364 KB Output is correct
26 Correct 151 ms 38192 KB Output is correct
27 Correct 204 ms 36552 KB Output is correct
28 Correct 232 ms 37828 KB Output is correct
29 Correct 113 ms 30576 KB Output is correct
30 Correct 496 ms 38080 KB Output is correct
31 Correct 44 ms 10332 KB Output is correct
32 Correct 87 ms 28000 KB Output is correct
33 Correct 312 ms 36080 KB Output is correct
34 Correct 385 ms 37824 KB Output is correct
35 Correct 521 ms 31820 KB Output is correct
36 Correct 469 ms 31676 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 348 KB Output is correct
3 Correct 0 ms 464 KB Output is correct
4 Correct 0 ms 464 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 460 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 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 460 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 2 ms 860 KB Output is correct
18 Correct 3 ms 604 KB Output is correct
19 Correct 3 ms 884 KB Output is correct
20 Correct 3 ms 604 KB Output is correct
21 Correct 4 ms 860 KB Output is correct
22 Correct 3 ms 604 KB Output is correct
23 Correct 3 ms 804 KB Output is correct
24 Correct 182 ms 38088 KB Output is correct
25 Correct 237 ms 28364 KB Output is correct
26 Correct 151 ms 38192 KB Output is correct
27 Correct 204 ms 36552 KB Output is correct
28 Correct 232 ms 37828 KB Output is correct
29 Correct 113 ms 30576 KB Output is correct
30 Correct 496 ms 38080 KB Output is correct
31 Correct 44 ms 10332 KB Output is correct
32 Correct 87 ms 28000 KB Output is correct
33 Correct 312 ms 36080 KB Output is correct
34 Correct 385 ms 37824 KB Output is correct
35 Correct 521 ms 31820 KB Output is correct
36 Correct 469 ms 31676 KB Output is correct
37 Correct 159 ms 41152 KB Output is correct
38 Correct 243 ms 39632 KB Output is correct
39 Correct 320 ms 38568 KB Output is correct
40 Correct 330 ms 38596 KB Output is correct
41 Correct 0 ms 348 KB Output is correct
42 Correct 549 ms 41152 KB Output is correct
43 Correct 330 ms 38936 KB Output is correct
44 Correct 372 ms 40892 KB Output is correct
45 Correct 504 ms 34780 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 348 KB Output is correct
3 Correct 0 ms 464 KB Output is correct
4 Correct 0 ms 464 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 460 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 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 460 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 2 ms 860 KB Output is correct
18 Correct 3 ms 604 KB Output is correct
19 Correct 3 ms 884 KB Output is correct
20 Correct 3 ms 604 KB Output is correct
21 Correct 4 ms 860 KB Output is correct
22 Correct 3 ms 604 KB Output is correct
23 Correct 3 ms 804 KB Output is correct
24 Correct 182 ms 38088 KB Output is correct
25 Correct 237 ms 28364 KB Output is correct
26 Correct 151 ms 38192 KB Output is correct
27 Correct 204 ms 36552 KB Output is correct
28 Correct 232 ms 37828 KB Output is correct
29 Correct 113 ms 30576 KB Output is correct
30 Correct 496 ms 38080 KB Output is correct
31 Correct 44 ms 10332 KB Output is correct
32 Correct 87 ms 28000 KB Output is correct
33 Correct 312 ms 36080 KB Output is correct
34 Correct 385 ms 37824 KB Output is correct
35 Correct 521 ms 31820 KB Output is correct
36 Correct 469 ms 31676 KB Output is correct
37 Correct 159 ms 41152 KB Output is correct
38 Correct 243 ms 39632 KB Output is correct
39 Correct 320 ms 38568 KB Output is correct
40 Correct 330 ms 38596 KB Output is correct
41 Correct 0 ms 348 KB Output is correct
42 Correct 549 ms 41152 KB Output is correct
43 Correct 330 ms 38936 KB Output is correct
44 Correct 372 ms 40892 KB Output is correct
45 Correct 504 ms 34780 KB Output is correct
46 Correct 812 ms 197168 KB Output is correct
47 Correct 1291 ms 189312 KB Output is correct
48 Correct 1765 ms 183468 KB Output is correct
49 Correct 1908 ms 183560 KB Output is correct
50 Correct 3934 ms 196824 KB Output is correct
51 Correct 2087 ms 182452 KB Output is correct
52 Correct 2264 ms 190444 KB Output is correct
53 Correct 3317 ms 165432 KB Output is correct

Subtask #7
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 236 ms 40004 KB Output is correct
2 Correct 298 ms 40124 KB Output is correct
3 Correct 123 ms 32600 KB Output is correct
4 Correct 220 ms 36804 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 280 ms 38080 KB Output is correct
7 Correct 57 ms 11856 KB Output is correct
8 Correct 54 ms 21776 KB Output is correct
9 Correct 130 ms 33812 KB Output is correct
10 Correct 322 ms 34852 KB Output is correct
11 Correct 103 ms 27104 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 464 KB Output is correct
15 Correct 0 ms 464 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 344 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 460 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 0 ms 348 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 460 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 2 ms 860 KB Output is correct
29 Correct 3 ms 604 KB Output is correct
30 Correct 3 ms 884 KB Output is correct
31 Correct 3 ms 604 KB Output is correct
32 Correct 4 ms 860 KB Output is correct
33 Correct 3 ms 604 KB Output is correct
34 Correct 3 ms 804 KB Output is correct
35 Correct 182 ms 38088 KB Output is correct
36 Correct 237 ms 28364 KB Output is correct
37 Correct 151 ms 38192 KB Output is correct
38 Correct 204 ms 36552 KB Output is correct
39 Correct 232 ms 37828 KB Output is correct
40 Correct 113 ms 30576 KB Output is correct
41 Correct 496 ms 38080 KB Output is correct
42 Correct 44 ms 10332 KB Output is correct
43 Correct 87 ms 28000 KB Output is correct
44 Correct 312 ms 36080 KB Output is correct
45 Correct 385 ms 37824 KB Output is correct
46 Correct 521 ms 31820 KB Output is correct
47 Correct 469 ms 31676 KB Output is correct
48 Correct 159 ms 41152 KB Output is correct
49 Correct 243 ms 39632 KB Output is correct
50 Correct 320 ms 38568 KB Output is correct
51 Correct 330 ms 38596 KB Output is correct
52 Correct 0 ms 348 KB Output is correct
53 Correct 549 ms 41152 KB Output is correct
54 Correct 330 ms 38936 KB Output is correct
55 Correct 372 ms 40892 KB Output is correct
56 Correct 504 ms 34780 KB Output is correct
57 Incorrect 240 ms 41664 KB Output isn't correct
58 Halted 0 ms 0 KB -

Subtask #8
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 236 ms 40004 KB Output is correct
2 Correct 298 ms 40124 KB Output is correct
3 Correct 123 ms 32600 KB Output is correct
4 Correct 220 ms 36804 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 280 ms 38080 KB Output is correct
7 Correct 57 ms 11856 KB Output is correct
8 Correct 54 ms 21776 KB Output is correct
9 Correct 130 ms 33812 KB Output is correct
10 Correct 322 ms 34852 KB Output is correct
11 Correct 103 ms 27104 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 464 KB Output is correct
15 Correct 0 ms 464 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 344 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 460 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 0 ms 348 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 460 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 2 ms 860 KB Output is correct
29 Correct 3 ms 604 KB Output is correct
30 Correct 3 ms 884 KB Output is correct
31 Correct 3 ms 604 KB Output is correct
32 Correct 4 ms 860 KB Output is correct
33 Correct 3 ms 604 KB Output is correct
34 Correct 3 ms 804 KB Output is correct
35 Correct 182 ms 38088 KB Output is correct
36 Correct 237 ms 28364 KB Output is correct
37 Correct 151 ms 38192 KB Output is correct
38 Correct 204 ms 36552 KB Output is correct
39 Correct 232 ms 37828 KB Output is correct
40 Correct 113 ms 30576 KB Output is correct
41 Correct 496 ms 38080 KB Output is correct
42 Correct 44 ms 10332 KB Output is correct
43 Correct 87 ms 28000 KB Output is correct
44 Correct 312 ms 36080 KB Output is correct
45 Correct 385 ms 37824 KB Output is correct
46 Correct 521 ms 31820 KB Output is correct
47 Correct 469 ms 31676 KB Output is correct
48 Correct 159 ms 41152 KB Output is correct
49 Correct 243 ms 39632 KB Output is correct
50 Correct 320 ms 38568 KB Output is correct
51 Correct 330 ms 38596 KB Output is correct
52 Correct 0 ms 348 KB Output is correct
53 Correct 549 ms 41152 KB Output is correct
54 Correct 330 ms 38936 KB Output is correct
55 Correct 372 ms 40892 KB Output is correct
56 Correct 504 ms 34780 KB Output is correct
57 Correct 812 ms 197168 KB Output is correct
58 Correct 1291 ms 189312 KB Output is correct
59 Correct 1765 ms 183468 KB Output is correct
60 Correct 1908 ms 183560 KB Output is correct
61 Correct 3934 ms 196824 KB Output is correct
62 Correct 2087 ms 182452 KB Output is correct
63 Correct 2264 ms 190444 KB Output is correct
64 Correct 3317 ms 165432 KB Output is correct
65 Incorrect 240 ms 41664 KB Output isn't correct
66 Halted 0 ms 0 KB -