oj.uz

Submission #851844

# Submission time Handle Problem Language Result Execution time Memory
851844 2023-09-20T17:11:55 Z MilosMilutinovic Fish 2 (JOI22_fish2) C++17
48 / 100
 4000 ms 90448 KB 
#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for (int i=a;i<n;i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
typedef vector<int> VI;
typedef basic_string<int> B;
typedef long long ll;
typedef pair<int,int> PII;
typedef double db;
mt19937 mrand(random_device{}()); 
const ll mod=1000000007;
int rnd(int x) { return mrand() % x;}
ll powmod(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
ll gcd(ll a,ll b) { return b?gcd(b,a%b):a;}
// head

const int N=100100;
const int M=8*N;
const int inf=(int)1e9;
int n,q,a[N];

namespace sum {
	ll c[N];
	void modify(int p,int v) {
		for (;p<N;p+=p&-p) c[p]+=v;
	}
	ll get(int p) {
		ll r=0;
		for (;p>0;p-=p&-p) r+=c[p];
		return r;
	}
	ll get(int l,int r) {
		if (l>r) {
			return 0ll;
		}
		return get(r)-get(l-1);
	}
};

namespace cnt {
	PII st[M];
	int lzy[M];
	void push(int x) {
		st[x*2].fi+=lzy[x];
		st[x*2+1].fi+=lzy[x];
		lzy[x*2]+=lzy[x];
		lzy[x*2+1]+=lzy[x];
		lzy[x]=0;
	}
	PII mrg(PII a,PII b) {
		PII r;
		r.fi=min(a.fi,b.fi);
		r.se=(a.fi==r.fi?a.se:0)+(b.fi==r.fi?b.se:0);
		return r;
	}
	void pull(int x) {
		st[x]=mrg(st[x*2],st[x*2+1]);
	}
	void build(int x,int l,int r) {
		if (l==r) {
			st[x].fi=0;
			st[x].se=1;
			return;
		}
		int mid=l+r>>1;
		build(x*2,l,mid);
		build(x*2+1,mid+1,r);
		pull(x);
	}
	void add(int x,int l,int r,int ql,int qr,int v) {
		if (l>r||l>qr||r<ql||ql>qr) {
			return;
		}
		if (ql<=l&&r<=qr) {
			st[x].fi+=v;
			lzy[x]+=v;
			push(x);
			return;
		}
		push(x);
		int mid=l+r>>1;
		add(x*2,l,mid,ql,qr,v);
		add(x*2+1,mid+1,r,ql,qr,v);
		pull(x);
	}
	PII query(int x,int l,int r,int ql,int qr) {
		if (l>r||l>qr||r<ql) {
			return mp(inf,0);
		}
		if (ql<=l&&r<=qr) {
			return st[x];
		}
		push(x);
		int mid=l+r>>1;
		auto qvl=query(x*2,l,mid,ql,qr);
		auto qvr=query(x*2+1,mid+1,r,ql,qr);
		pull(x);
		return mrg(qvl,qvr);
	}
	int sol(int l,int r) {
		auto p=query(1,1,n,l,r);
		return p.se;
	}
};

vector<PII> my;
namespace segs {
	multiset<PII> st[M];
	void add(int x,int l,int r,int ql,int qr,PII p) {
		if (l>r||l>qr||r<ql) {
			return;
		}
		if (ql<=l&&r<=qr) {
			st[x].insert(p);
			return;
		}
		int mid=l+r>>1;
		add(x*2,l,mid,ql,qr,p);
		add(x*2+1,mid+1,r,ql,qr,p);
	}
	void rem(int x,int l,int r,PII p) {
		if (l>r||l>p.se||r<p.fi) {
			return;
		}
		if (p.fi<=l&&r<=p.se) {
			st[x].erase(st[x].find(p));
			return;
		}
		int mid=l+r>>1;
		rem(x*2,l,mid,p);
		rem(x*2+1,mid+1,r,p);
	}
	void dfs(int x,int l,int r,int p) {
		while (SZ(st[x])) {
			auto p=*st[x].begin();
			cnt::add(1,1,n,p.fi+1,p.se-1,-1);
			rem(1,1,n,p);
		}
		st[x].clear();
		if (l==r) {
			return;
		}
		int mid=l+r>>1;
		if (p<=mid) {
			dfs(x*2,l,mid,p);
		} else {
			dfs(x*2+1,mid+1,r,p);
		}
	}
};

namespace pref {
	struct node {
		ll vl,vr,lzyl,lzyr;
		node(ll _vl=0,ll _vr=0,ll tg1=0,ll tg2=0) : vl(_vl),vr(_vr),lzyl(tg1),lzyr(tg2) {}
	};
	node st[M];
	node mrg(node a,node b) {
		node r;
		r.vl=max(a.vl,b.vl);
		r.vr=max(a.vr,b.vr);
		return r;
	}
	void pull(int x) {
		st[x]=mrg(st[x*2],st[x*2+1]);
	}
	void push(int x) {
		st[x*2].vl+=st[x].lzyl;
		st[x*2+1].vl+=st[x].lzyl;
		st[x*2].lzyl+=st[x].lzyl;
		st[x*2+1].lzyl+=st[x].lzyl;
		st[x].lzyl=0;
		st[x*2].vr+=st[x].lzyr;
		st[x*2+1].vr+=st[x].lzyr;
		st[x*2].lzyr+=st[x].lzyr;
		st[x*2+1].lzyr+=st[x].lzyr;
		st[x].lzyr=0;
	}
	void build(int x,int l,int r) {
		if (l==r) {
			st[x].vl=a[l]-sum::get(1,l-1);
			st[x].vr=a[l]-sum::get(l+1,N-1);
			st[x].lzyl=0;
			st[x].lzyr=0;
			return;
		}
		int mid=l+r>>1;
		build(x*2,l,mid);
		build(x*2+1,mid+1,r);
		pull(x);
	}
	void modifyL(int x,int l,int r,int ql,int qr,ll v) {
		if (l>r||l>qr||r<ql||ql>qr) {
			return;
		}
		if (ql<=l&&r<=qr) {
			st[x].lzyl+=v;
			st[x].vl+=v;
			push(x);
			return;
		}
		push(x);
		int mid=l+r>>1;
		modifyL(x*2,l,mid,ql,qr,v);
		modifyL(x*2+1,mid+1,r,ql,qr,v);
		pull(x);
	}
	void modifyR(int x,int l,int r,int ql,int qr,ll v) {
		if (l>r||l>qr||r<ql||ql>qr) {
			return;
		}
		if (ql<=l&&r<=qr) {
			st[x].lzyr+=v;
			st[x].vr+=v;
			push(x);
			return;
		}
		push(x);
		int mid=l+r>>1;
		modifyR(x*2,l,mid,ql,qr,v);
		modifyR(x*2+1,mid+1,r,ql,qr,v);
		pull(x);
	}
	node query(int x,int l,int r,int ql,int qr) {
		if (l>r||l>qr||r<ql||ql>qr) {
			return node(-inf*1ll*inf,-inf*1ll*inf,0ll,0ll);
		}
		if (ql<=l&&r<=qr) {
			return st[x];
		}
		push(x);
		int mid=l+r>>1;
		node qvl=query(x*2,l,mid,ql,qr);
		node qvr=query(x*2+1,mid+1,r,ql,qr);
		pull(x);
		return mrg(qvl,qvr);
	}
};

void build() {
	cnt::build(1,1,n);
	rep(i,1,n+1) {
		sum::modify(i,a[i]);
	}
	pref::build(1,1,n);
	stack<int> stk;
	rep(i,1,n+1) {
		while (SZ(stk)>0&&a[i]>a[stk.top()]) {
			int L=stk.top();
			int R=i;
			if (L!=R-1&&min(a[L],a[R])>sum::get(L+1,R-1)) {
				segs::add(1,1,n,L,R,mp(L,R));
				cnt::add(1,1,n,L+1,R-1,1);
			}
			stk.pop();
		}
		stk.push(i);
	}
	while (SZ(stk)) stk.pop();
	per(i,1,n+1) {
		while (SZ(stk)>0&&a[i]>=a[stk.top()]) {
			int L=i;
			int R=stk.top();
			if (L!=R-1&&min(a[L],a[R])>sum::get(L+1,R-1)) {
				segs::add(1,1,n,L,R,mp(L,R));
				cnt::add(1,1,n,L+1,R-1,1);
			}
			stk.pop();
		}
		stk.push(i);
	}
}

int main() {
	scanf("%d",&n);
	rep(i,1,n+1) {
		scanf("%d",&a[i]);
	}
	build();
	scanf("%d",&q);
	while (q--) {
		int op;
		scanf("%d",&op);
		if (op==1) {
			int i,x;
			scanf("%d%d",&i,&x);
			sum::modify(i,-a[i]);
			sum::modify(i,x);
			pref::modifyL(1,1,n,i,i,-a[i]+x);
			pref::modifyR(1,1,n,i,i,-a[i]+x);
			if (i!=n) pref::modifyL(1,1,n,i+1,n,a[i]-x);
			if (i!=1) pref::modifyR(1,1,n,1,i-1,a[i]-x);
			a[i]=x;
			my.clear();
			segs::dfs(1,1,n,i);
			for (auto& p:my) {
				if (min(a[p.fi],a[p.se])>sum::get(p.fi+1,p.se-1)) {
					segs::add(1,1,n,p.fi,p.se,p);
					cnt::add(1,1,n,p.fi+1,p.se-1,1);
				}
			}
			VI L(1,i),R(1,i);
			rep(j,1,i) if (a[j]>sum::get(j+1,i-1)) L.pb(j);
			rep(j,i+1,n+1) if (a[j]>sum::get(i+1,j-1)) R.pb(j);
			for (int x:L) {
				for (int y:R) {
					if (x+1<y&&min(a[x],a[y])>sum::get(x+1,y-1)) {
						segs::add(1,1,n,x,y,mp(x,y));
						cnt::add(1,1,n,x+1,y-1,1);
					}
				}
			}
		} else {
			int l,r;
			scanf("%d%d",&l,&r);
			{
				int low=l,high=r,pos=l;
				while (low<=high) {
					int mid=low+high>>1;
					if (pref::query(1,1,n,mid,r).vl+sum::get(1,l-1)>0) {
						pos=mid;
						low=mid+1;
					} else {
						high=mid-1;
					}
				}
				l=pos;
			}
			{
				int low=l,high=r,pos=r;
				while (low<=high) {
					int mid=low+high>>1;
					if (pref::query(1,1,n,l,mid).vr+sum::get(r+1,n)>0) {
						pos=mid;
						high=mid-1;
					} else {
						low=mid+1;
					}
				}
				r=pos;
			}
			//printf("-- %d %d --\n",l,r);
			printf("%d\n",cnt::sol(l,r));
		}
	}
}

Compilation message

fish2.cpp: In function 'void cnt::build(int, int, int)':
fish2.cpp:72:12: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   72 |   int mid=l+r>>1;
      |           ~^~
fish2.cpp: In function 'void cnt::add(int, int, int, int, int, int)':
fish2.cpp:88:12: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   88 |   int mid=l+r>>1;
      |           ~^~
fish2.cpp: In function 'PII cnt::query(int, int, int, int, int)':
fish2.cpp:101:12: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  101 |   int mid=l+r>>1;
      |           ~^~
fish2.cpp: In function 'void segs::add(int, int, int, int, int, PII)':
fish2.cpp:124:12: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  124 |   int mid=l+r>>1;
      |           ~^~
fish2.cpp: In function 'void segs::rem(int, int, int, PII)':
fish2.cpp:136:12: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  136 |   int mid=l+r>>1;
      |           ~^~
fish2.cpp: In function 'void segs::dfs(int, int, int, int)':
fish2.cpp:150:12: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  150 |   int mid=l+r>>1;
      |           ~^~
fish2.cpp: In function 'void pref::build(int, int, int)':
fish2.cpp:194:12: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  194 |   int mid=l+r>>1;
      |           ~^~
fish2.cpp: In function 'void pref::modifyL(int, int, int, int, int, ll)':
fish2.cpp:210:12: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  210 |   int mid=l+r>>1;
      |           ~^~
fish2.cpp: In function 'void pref::modifyR(int, int, int, int, int, ll)':
fish2.cpp:226:12: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  226 |   int mid=l+r>>1;
      |           ~^~
fish2.cpp: In function 'pref::node pref::query(int, int, int, int, int)':
fish2.cpp:239:12: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  239 |   int mid=l+r>>1;
      |           ~^~
fish2.cpp: In function 'int main()':
fish2.cpp:326:17: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  326 |      int mid=low+high>>1;
      |              ~~~^~~~~
fish2.cpp:339:17: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  339 |      int mid=low+high>>1;
      |              ~~~^~~~~
fish2.cpp:282:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  282 |  scanf("%d",&n);
      |  ~~~~~^~~~~~~~~
fish2.cpp:284:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  284 |   scanf("%d",&a[i]);
      |   ~~~~~^~~~~~~~~~~~
fish2.cpp:287:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  287 |  scanf("%d",&q);
      |  ~~~~~^~~~~~~~~
fish2.cpp:290:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  290 |   scanf("%d",&op);
      |   ~~~~~^~~~~~~~~~
fish2.cpp:293:9: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  293 |    scanf("%d%d",&i,&x);
      |    ~~~~~^~~~~~~~~~~~~~
fish2.cpp:322:9: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  322 |    scanf("%d%d",&l,&r);
      |    ~~~~~^~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 66136 KB Output is correct
2 Correct 11 ms 66136 KB Output is correct
3 Correct 11 ms 66136 KB Output is correct
4 Correct 11 ms 66140 KB Output is correct
5 Correct 15 ms 68184 KB Output is correct
6 Correct 14 ms 68188 KB Output is correct
7 Correct 15 ms 68184 KB Output is correct
8 Correct 14 ms 68188 KB Output is correct
9 Correct 14 ms 68184 KB Output is correct
10 Correct 14 ms 68184 KB Output is correct
11 Correct 13 ms 68184 KB Output is correct
12 Correct 15 ms 68184 KB Output is correct
13 Correct 15 ms 68184 KB Output is correct
14 Correct 14 ms 68184 KB Output is correct
15 Correct 15 ms 68188 KB Output is correct
16 Correct 14 ms 68184 KB Output is correct
17 Correct 15 ms 68184 KB Output is correct
18 Correct 14 ms 68184 KB Output is correct
19 Correct 15 ms 68184 KB Output is correct
20 Correct 14 ms 68188 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 66136 KB Output is correct
2 Correct 93 ms 87376 KB Output is correct
3 Correct 97 ms 84256 KB Output is correct
4 Correct 95 ms 87380 KB Output is correct
5 Correct 82 ms 84560 KB Output is correct
6 Correct 49 ms 75600 KB Output is correct
7 Correct 41 ms 74320 KB Output is correct
8 Correct 49 ms 75600 KB Output is correct
9 Correct 41 ms 74320 KB Output is correct
10 Correct 58 ms 79184 KB Output is correct
11 Correct 53 ms 77904 KB Output is correct
12 Correct 46 ms 75344 KB Output is correct
13 Correct 46 ms 75344 KB Output is correct
14 Correct 58 ms 78324 KB Output is correct
15 Correct 62 ms 78416 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 66136 KB Output is correct
2 Correct 11 ms 66136 KB Output is correct
3 Correct 11 ms 66136 KB Output is correct
4 Correct 11 ms 66140 KB Output is correct
5 Correct 15 ms 68184 KB Output is correct
6 Correct 14 ms 68188 KB Output is correct
7 Correct 15 ms 68184 KB Output is correct
8 Correct 14 ms 68188 KB Output is correct
9 Correct 14 ms 68184 KB Output is correct
10 Correct 14 ms 68184 KB Output is correct
11 Correct 13 ms 68184 KB Output is correct
12 Correct 15 ms 68184 KB Output is correct
13 Correct 15 ms 68184 KB Output is correct
14 Correct 14 ms 68184 KB Output is correct
15 Correct 15 ms 68188 KB Output is correct
16 Correct 14 ms 68184 KB Output is correct
17 Correct 15 ms 68184 KB Output is correct
18 Correct 14 ms 68184 KB Output is correct
19 Correct 15 ms 68184 KB Output is correct
20 Correct 14 ms 68188 KB Output is correct
21 Correct 11 ms 66136 KB Output is correct
22 Correct 93 ms 87376 KB Output is correct
23 Correct 97 ms 84256 KB Output is correct
24 Correct 95 ms 87380 KB Output is correct
25 Correct 82 ms 84560 KB Output is correct
26 Correct 49 ms 75600 KB Output is correct
27 Correct 41 ms 74320 KB Output is correct
28 Correct 49 ms 75600 KB Output is correct
29 Correct 41 ms 74320 KB Output is correct
30 Correct 58 ms 79184 KB Output is correct
31 Correct 53 ms 77904 KB Output is correct
32 Correct 46 ms 75344 KB Output is correct
33 Correct 46 ms 75344 KB Output is correct
34 Correct 58 ms 78324 KB Output is correct
35 Correct 62 ms 78416 KB Output is correct
36 Correct 742 ms 89680 KB Output is correct
37 Correct 444 ms 85072 KB Output is correct
38 Correct 145 ms 83488 KB Output is correct
39 Correct 1081 ms 90448 KB Output is correct
40 Correct 145 ms 83168 KB Output is correct
41 Correct 431 ms 76712 KB Output is correct
42 Correct 212 ms 76880 KB Output is correct
43 Correct 421 ms 74820 KB Output is correct
44 Correct 180 ms 74708 KB Output is correct
45 Correct 684 ms 81996 KB Output is correct
46 Correct 403 ms 80388 KB Output is correct
47 Correct 114 ms 75564 KB Output is correct
48 Correct 894 ms 76212 KB Output is correct
49 Correct 180 ms 75444 KB Output is correct
50 Correct 659 ms 78928 KB Output is correct
51 Correct 449 ms 79184 KB Output is correct
52 Correct 144 ms 79204 KB Output is correct

Subtask #4
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 66136 KB Output is correct
2 Correct 93 ms 87376 KB Output is correct
3 Correct 97 ms 84256 KB Output is correct
4 Correct 95 ms 87380 KB Output is correct
5 Correct 82 ms 84560 KB Output is correct
6 Correct 49 ms 75600 KB Output is correct
7 Correct 41 ms 74320 KB Output is correct
8 Correct 49 ms 75600 KB Output is correct
9 Correct 41 ms 74320 KB Output is correct
10 Correct 58 ms 79184 KB Output is correct
11 Correct 53 ms 77904 KB Output is correct
12 Correct 46 ms 75344 KB Output is correct
13 Correct 46 ms 75344 KB Output is correct
14 Correct 58 ms 78324 KB Output is correct
15 Correct 62 ms 78416 KB Output is correct
16 Correct 11 ms 66136 KB Output is correct
17 Correct 1579 ms 84916 KB Output is correct
18 Correct 1539 ms 90296 KB Output is correct
19 Correct 1532 ms 85328 KB Output is correct
20 Correct 1520 ms 85568 KB Output is correct
21 Correct 1533 ms 84604 KB Output is correct
22 Correct 1659 ms 90080 KB Output is correct
23 Correct 1604 ms 84716 KB Output is correct
24 Correct 1665 ms 85940 KB Output is correct
25 Correct 1643 ms 85492 KB Output is correct
26 Correct 1609 ms 85832 KB Output is correct
27 Correct 1539 ms 76464 KB Output is correct
28 Correct 1644 ms 76688 KB Output is correct
29 Correct 1554 ms 76596 KB Output is correct
30 Correct 1252 ms 74620 KB Output is correct
31 Correct 1169 ms 74612 KB Output is correct
32 Correct 1483 ms 78576 KB Output is correct
33 Correct 1543 ms 80036 KB Output is correct
34 Correct 1506 ms 78036 KB Output is correct
35 Correct 1536 ms 76620 KB Output is correct
36 Correct 1594 ms 81464 KB Output is correct
37 Correct 1412 ms 75712 KB Output is correct
38 Correct 1341 ms 75852 KB Output is correct
39 Correct 1545 ms 79480 KB Output is correct
40 Correct 1775 ms 79132 KB Output is correct

Subtask #5
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 66136 KB Output is correct
2 Correct 93 ms 87376 KB Output is correct
3 Correct 97 ms 84256 KB Output is correct
4 Correct 95 ms 87380 KB Output is correct
5 Correct 82 ms 84560 KB Output is correct
6 Correct 49 ms 75600 KB Output is correct
7 Correct 41 ms 74320 KB Output is correct
8 Correct 49 ms 75600 KB Output is correct
9 Correct 41 ms 74320 KB Output is correct
10 Correct 58 ms 79184 KB Output is correct
11 Correct 53 ms 77904 KB Output is correct
12 Correct 46 ms 75344 KB Output is correct
13 Correct 46 ms 75344 KB Output is correct
14 Correct 58 ms 78324 KB Output is correct
15 Correct 62 ms 78416 KB Output is correct
16 Correct 11 ms 66320 KB Output is correct
17 Execution timed out 4051 ms 87304 KB Time limit exceeded
18 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 66136 KB Output is correct
2 Correct 11 ms 66136 KB Output is correct
3 Correct 11 ms 66136 KB Output is correct
4 Correct 11 ms 66140 KB Output is correct
5 Correct 15 ms 68184 KB Output is correct
6 Correct 14 ms 68188 KB Output is correct
7 Correct 15 ms 68184 KB Output is correct
8 Correct 14 ms 68188 KB Output is correct
9 Correct 14 ms 68184 KB Output is correct
10 Correct 14 ms 68184 KB Output is correct
11 Correct 13 ms 68184 KB Output is correct
12 Correct 15 ms 68184 KB Output is correct
13 Correct 15 ms 68184 KB Output is correct
14 Correct 14 ms 68184 KB Output is correct
15 Correct 15 ms 68188 KB Output is correct
16 Correct 14 ms 68184 KB Output is correct
17 Correct 15 ms 68184 KB Output is correct
18 Correct 14 ms 68184 KB Output is correct
19 Correct 15 ms 68184 KB Output is correct
20 Correct 14 ms 68188 KB Output is correct
21 Correct 11 ms 66136 KB Output is correct
22 Correct 93 ms 87376 KB Output is correct
23 Correct 97 ms 84256 KB Output is correct
24 Correct 95 ms 87380 KB Output is correct
25 Correct 82 ms 84560 KB Output is correct
26 Correct 49 ms 75600 KB Output is correct
27 Correct 41 ms 74320 KB Output is correct
28 Correct 49 ms 75600 KB Output is correct
29 Correct 41 ms 74320 KB Output is correct
30 Correct 58 ms 79184 KB Output is correct
31 Correct 53 ms 77904 KB Output is correct
32 Correct 46 ms 75344 KB Output is correct
33 Correct 46 ms 75344 KB Output is correct
34 Correct 58 ms 78324 KB Output is correct
35 Correct 62 ms 78416 KB Output is correct
36 Correct 742 ms 89680 KB Output is correct
37 Correct 444 ms 85072 KB Output is correct
38 Correct 145 ms 83488 KB Output is correct
39 Correct 1081 ms 90448 KB Output is correct
40 Correct 145 ms 83168 KB Output is correct
41 Correct 431 ms 76712 KB Output is correct
42 Correct 212 ms 76880 KB Output is correct
43 Correct 421 ms 74820 KB Output is correct
44 Correct 180 ms 74708 KB Output is correct
45 Correct 684 ms 81996 KB Output is correct
46 Correct 403 ms 80388 KB Output is correct
47 Correct 114 ms 75564 KB Output is correct
48 Correct 894 ms 76212 KB Output is correct
49 Correct 180 ms 75444 KB Output is correct
50 Correct 659 ms 78928 KB Output is correct
51 Correct 449 ms 79184 KB Output is correct
52 Correct 144 ms 79204 KB Output is correct
53 Correct 11 ms 66136 KB Output is correct
54 Correct 1579 ms 84916 KB Output is correct
55 Correct 1539 ms 90296 KB Output is correct
56 Correct 1532 ms 85328 KB Output is correct
57 Correct 1520 ms 85568 KB Output is correct
58 Correct 1533 ms 84604 KB Output is correct
59 Correct 1659 ms 90080 KB Output is correct
60 Correct 1604 ms 84716 KB Output is correct
61 Correct 1665 ms 85940 KB Output is correct
62 Correct 1643 ms 85492 KB Output is correct
63 Correct 1609 ms 85832 KB Output is correct
64 Correct 1539 ms 76464 KB Output is correct
65 Correct 1644 ms 76688 KB Output is correct
66 Correct 1554 ms 76596 KB Output is correct
67 Correct 1252 ms 74620 KB Output is correct
68 Correct 1169 ms 74612 KB Output is correct
69 Correct 1483 ms 78576 KB Output is correct
70 Correct 1543 ms 80036 KB Output is correct
71 Correct 1506 ms 78036 KB Output is correct
72 Correct 1536 ms 76620 KB Output is correct
73 Correct 1594 ms 81464 KB Output is correct
74 Correct 1412 ms 75712 KB Output is correct
75 Correct 1341 ms 75852 KB Output is correct
76 Correct 1545 ms 79480 KB Output is correct
77 Correct 1775 ms 79132 KB Output is correct
78 Correct 11 ms 66320 KB Output is correct
79 Execution timed out 4051 ms 87304 KB Time limit exceeded
80 Halted 0 ms 0 KB -