oj.uz

Submission #396433

# Submission time Handle Problem Language Result Execution time Memory
396433 2021-04-30T00:29:59 Z arnold518 Food Court (JOI21_foodcourt) C++17
68 / 100
 1000 ms 53924 KB 
#pragma GCC optimize ("O3")
#pragma GCC optimize ("Ofast")
#pragma GCC optimize ("unroll-loops")

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const int MAXN = 25e4;
const int MAXQ = 25e4;

int N, M, Q;

pll operator + (pll p, pll q)
{
	if(p.second>q.first)
	{
		p.second-=q.first;
		p.second+=q.second;
	}
	else
	{
		p.first+=q.first-p.second;
		p.second=q.second;
	}
	return p;
}

struct SEG
{
	ll A[MAXN+10];
	pll lazy[MAXN*4+10];

	void busy(int node, int tl, int tr)
	{
		if(tl==tr)
		{
			A[tl]=max(0ll, A[tl]-lazy[node].first);
			A[tl]+=lazy[node].second;
		}
		else
		{
			lazy[node*2]=lazy[node*2]+lazy[node];
			lazy[node*2+1]=lazy[node*2+1]+lazy[node];
		}
		lazy[node]=pll(0, 0);
	}

	void update(int node, int tl, int tr, int l, int r, pll p)
	{
		busy(node, tl, tr);
		if(r<tl || tr<l) return;
		if(l<=tl && tr<=r)
		{
			lazy[node]=p;
			busy(node, tl, tr);
			return;
		}
		int mid=tl+tr>>1;
		update(node*2, tl, mid, l, r, p);
		update(node*2+1, mid+1, tr, l, r, p);
	}

	void query(int node, int tl, int tr, int p)
	{
		busy(node, tl, tr);
		if(tl==tr) return;
		int mid=tl+tr>>1;
		if(p<=mid) query(node*2, tl, mid, p);
		else query(node*2+1, mid+1, tr, p);
	}
}seg;

struct Data
{
	int t, l, r, c, a, p;
	ll k, b;
};

struct BIT
{
	ll tree[MAXN+10];
	void init()
	{
		for(int i=1; i<=N; i++) tree[i]=0;
	}
	void update(int i, ll k)
	{
		for(; i<=N; i+=(i&-i)) tree[i]+=k;
	}
	ll query(int i)
	{
		ll ret=0;
		for(; i>0; i-=(i&-i)) ret+=tree[i];
		return ret;
	}
	void update(int l, int r, ll k)
	{
		update(l, k);
		update(r+1, -k);
	}
}bit;

Data B[MAXN+10];

int lo[MAXN+10], hi[MAXN+10];
vector<pii> VVV[MAXN+10];
ll P[MAXN+10];

int main()
{
	scanf("%d%d%d", &N, &M, &Q);
	vector<Data> V;
	for(int p=1; p<=Q; p++)
	{
		int t;
		scanf("%d", &t);
		B[p].t=t; B[p].p=p;
		if(t==1)
		{
			int l, r, c, k;
			scanf("%d%d%d%d", &l, &r, &c, &k);
			B[p].l=l; B[p].r=r; B[p].c=c; B[p].k=k;
			seg.update(1, 1, N, l, r, {0, k});
			bit.update(l, r, k);
		}
		if(t==2)
		{
			int l, r, k;
			scanf("%d%d%d", &l, &r, &k);
			B[p].l=l; B[p].r=r; B[p].k=k;
			seg.update(1, 1, N, l, r, {k, 0});	
		}
		if(t==3)
		{
			int a; ll b;
			scanf("%d%lld", &a, &b);
			B[p].a=a;
			seg.query(1, 1, N, a);
			ll t=seg.A[a];
			b=bit.query(a)-t+b;
			B[p].b=b;
		}
	}

	for(int i=1; i<=Q; i++)
	{
		if(B[i].t==3)
		{
			lo[i]=0;
			hi[i]=i;
		}
	}

	while(1)
	{
		vector<pii> VV;
		for(int i=1; i<=Q; i++)
		{
			if(B[i].t==3)
			{	
				if(lo[i]+1<hi[i])
				{
					VVV[lo[i]+hi[i]>>1].push_back({lo[i]+hi[i]>>1, i});
				}
			}
		}
		for(int i=0; i<=Q; i++)
		{
			for(auto it : VVV[i])
			{
				VV.push_back(it);
			}
			VVV[i].clear();
		}
		if(VV.empty()) break;
		bit.init();
		for(int i=0, j=1; i<VV.size(); i++)
		{
			for(; j<=VV[i].first && j<=Q; j++)
			{
				if(B[j].t!=1) continue;
				bit.update(B[j].l, B[j].r, B[j].k);
			}
			if(bit.query(B[VV[i].second].a)>=B[VV[i].second].b)
			{
				hi[VV[i].second]=VV[i].first;
			}
			else
			{
				lo[VV[i].second]=VV[i].first;
			}
		}
	}
	for(int i=1; i<=Q; i++)
	{
		if(B[i].t==3)
		{
			//printf("%d %d\n", lo[i], hi[i]);
			if(B[hi[i]].t!=1) printf("0\n");
			else printf("%d\n", B[hi[i]].c);
		}
	}
}

Compilation message

foodcourt.cpp: In member function 'void SEG::update(int, int, int, int, int, pll)':
foodcourt.cpp:62:13: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   62 |   int mid=tl+tr>>1;
      |           ~~^~~
foodcourt.cpp: In member function 'void SEG::query(int, int, int, int)':
foodcourt.cpp:71:13: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   71 |   int mid=tl+tr>>1;
      |           ~~^~~
foodcourt.cpp: In function 'int main()':
foodcourt.cpp:167:15: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  167 |      VVV[lo[i]+hi[i]>>1].push_back({lo[i]+hi[i]>>1, i});
      |          ~~~~~^~~~~~
foodcourt.cpp:167:42: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  167 |      VVV[lo[i]+hi[i]>>1].push_back({lo[i]+hi[i]>>1, i});
      |                                     ~~~~~^~~~~~
foodcourt.cpp:181:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  181 |   for(int i=0, j=1; i<VV.size(); i++)
      |                     ~^~~~~~~~~~
foodcourt.cpp:115:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  115 |  scanf("%d%d%d", &N, &M, &Q);
      |  ~~~~~^~~~~~~~~~~~~~~~~~~~~~
foodcourt.cpp:120:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  120 |   scanf("%d", &t);
      |   ~~~~~^~~~~~~~~~
foodcourt.cpp:125:9: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  125 |    scanf("%d%d%d%d", &l, &r, &c, &k);
      |    ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
foodcourt.cpp:133:9: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  133 |    scanf("%d%d%d", &l, &r, &k);
      |    ~~~~~^~~~~~~~~~~~~~~~~~~~~~
foodcourt.cpp:140:9: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  140 |    scanf("%d%lld", &a, &b);
      |    ~~~~~^~~~~~~~~~~~~~~~~~

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 21924 KB Output is correct
2 Correct 16 ms 22076 KB Output is correct
3 Correct 15 ms 21948 KB Output is correct
4 Correct 16 ms 21964 KB Output is correct
5 Correct 14 ms 21984 KB Output is correct
6 Correct 14 ms 21968 KB Output is correct
7 Correct 16 ms 21980 KB Output is correct
8 Correct 16 ms 21964 KB Output is correct
9 Correct 16 ms 21968 KB Output is correct
10 Correct 16 ms 22016 KB Output is correct
11 Correct 15 ms 22024 KB Output is correct
12 Correct 16 ms 21980 KB Output is correct
13 Correct 14 ms 21988 KB Output is correct
14 Correct 15 ms 22020 KB Output is correct
15 Correct 15 ms 21964 KB Output is correct
16 Correct 17 ms 21980 KB Output is correct
17 Correct 15 ms 21984 KB Output is correct
18 Correct 16 ms 22072 KB Output is correct
19 Correct 15 ms 21964 KB Output is correct
20 Correct 15 ms 21984 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 21924 KB Output is correct
2 Correct 16 ms 22076 KB Output is correct
3 Correct 15 ms 21948 KB Output is correct
4 Correct 16 ms 21964 KB Output is correct
5 Correct 14 ms 21984 KB Output is correct
6 Correct 14 ms 21968 KB Output is correct
7 Correct 16 ms 21980 KB Output is correct
8 Correct 16 ms 21964 KB Output is correct
9 Correct 16 ms 21968 KB Output is correct
10 Correct 16 ms 22016 KB Output is correct
11 Correct 15 ms 22024 KB Output is correct
12 Correct 16 ms 21980 KB Output is correct
13 Correct 14 ms 21988 KB Output is correct
14 Correct 15 ms 22020 KB Output is correct
15 Correct 15 ms 21964 KB Output is correct
16 Correct 17 ms 21980 KB Output is correct
17 Correct 15 ms 21984 KB Output is correct
18 Correct 16 ms 22072 KB Output is correct
19 Correct 15 ms 21964 KB Output is correct
20 Correct 15 ms 21984 KB Output is correct
21 Correct 15 ms 22092 KB Output is correct
22 Correct 16 ms 22092 KB Output is correct
23 Correct 15 ms 21964 KB Output is correct
24 Correct 16 ms 22092 KB Output is correct
25 Correct 14 ms 21964 KB Output is correct
26 Correct 14 ms 21964 KB Output is correct
27 Correct 15 ms 22092 KB Output is correct
28 Correct 15 ms 21988 KB Output is correct
29 Correct 17 ms 22092 KB Output is correct
30 Correct 16 ms 22092 KB Output is correct
31 Correct 16 ms 21980 KB Output is correct
32 Correct 15 ms 22092 KB Output is correct
33 Correct 14 ms 21964 KB Output is correct
34 Correct 15 ms 22108 KB Output is correct
35 Correct 15 ms 21964 KB Output is correct
36 Correct 16 ms 22092 KB Output is correct
37 Correct 15 ms 21976 KB Output is correct
38 Correct 15 ms 21964 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 129 ms 28348 KB Output is correct
2 Correct 135 ms 29396 KB Output is correct
3 Correct 132 ms 29512 KB Output is correct
4 Correct 130 ms 29516 KB Output is correct
5 Correct 165 ms 29340 KB Output is correct
6 Correct 133 ms 29412 KB Output is correct
7 Correct 72 ms 27712 KB Output is correct
8 Correct 74 ms 27772 KB Output is correct
9 Correct 127 ms 29404 KB Output is correct
10 Correct 123 ms 29412 KB Output is correct
11 Correct 125 ms 29332 KB Output is correct
12 Correct 127 ms 29444 KB Output is correct
13 Correct 119 ms 28408 KB Output is correct
14 Correct 134 ms 29600 KB Output is correct
15 Correct 132 ms 28736 KB Output is correct
16 Correct 133 ms 29148 KB Output is correct

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 703 ms 50320 KB Output is correct
2 Correct 535 ms 44668 KB Output is correct
3 Correct 788 ms 53084 KB Output is correct
4 Correct 641 ms 44884 KB Output is correct
5 Correct 638 ms 44364 KB Output is correct
6 Correct 906 ms 52208 KB Output is correct
7 Correct 324 ms 47168 KB Output is correct
8 Correct 328 ms 47060 KB Output is correct
9 Execution timed out 1028 ms 53924 KB Time limit exceeded
10 Halted 0 ms 0 KB -

Subtask #5
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 21924 KB Output is correct
2 Correct 16 ms 22076 KB Output is correct
3 Correct 15 ms 21948 KB Output is correct
4 Correct 16 ms 21964 KB Output is correct
5 Correct 14 ms 21984 KB Output is correct
6 Correct 14 ms 21968 KB Output is correct
7 Correct 16 ms 21980 KB Output is correct
8 Correct 16 ms 21964 KB Output is correct
9 Correct 16 ms 21968 KB Output is correct
10 Correct 16 ms 22016 KB Output is correct
11 Correct 15 ms 22024 KB Output is correct
12 Correct 16 ms 21980 KB Output is correct
13 Correct 14 ms 21988 KB Output is correct
14 Correct 15 ms 22020 KB Output is correct
15 Correct 15 ms 21964 KB Output is correct
16 Correct 17 ms 21980 KB Output is correct
17 Correct 15 ms 21984 KB Output is correct
18 Correct 16 ms 22072 KB Output is correct
19 Correct 15 ms 21964 KB Output is correct
20 Correct 15 ms 21984 KB Output is correct
21 Correct 129 ms 28348 KB Output is correct
22 Correct 135 ms 29396 KB Output is correct
23 Correct 132 ms 29512 KB Output is correct
24 Correct 130 ms 29516 KB Output is correct
25 Correct 165 ms 29340 KB Output is correct
26 Correct 133 ms 29412 KB Output is correct
27 Correct 72 ms 27712 KB Output is correct
28 Correct 74 ms 27772 KB Output is correct
29 Correct 127 ms 29404 KB Output is correct
30 Correct 123 ms 29412 KB Output is correct
31 Correct 125 ms 29332 KB Output is correct
32 Correct 127 ms 29444 KB Output is correct
33 Correct 119 ms 28408 KB Output is correct
34 Correct 134 ms 29600 KB Output is correct
35 Correct 132 ms 28736 KB Output is correct
36 Correct 133 ms 29148 KB Output is correct
37 Correct 135 ms 28612 KB Output is correct
38 Correct 129 ms 27860 KB Output is correct
39 Correct 60 ms 26748 KB Output is correct
40 Correct 69 ms 27452 KB Output is correct
41 Correct 153 ms 29072 KB Output is correct
42 Correct 169 ms 29148 KB Output is correct
43 Correct 145 ms 29256 KB Output is correct
44 Correct 153 ms 29144 KB Output is correct
45 Correct 152 ms 29160 KB Output is correct
46 Correct 147 ms 29196 KB Output is correct
47 Correct 99 ms 29220 KB Output is correct
48 Correct 145 ms 29300 KB Output is correct
49 Correct 104 ms 26964 KB Output is correct
50 Correct 129 ms 28160 KB Output is correct
51 Correct 162 ms 29128 KB Output is correct
52 Correct 145 ms 29148 KB Output is correct
53 Correct 107 ms 27604 KB Output is correct
54 Correct 132 ms 29172 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 169 ms 29396 KB Output is correct
2 Correct 186 ms 29944 KB Output is correct
3 Correct 180 ms 30188 KB Output is correct
4 Correct 128 ms 28028 KB Output is correct
5 Correct 190 ms 29184 KB Output is correct
6 Correct 196 ms 30148 KB Output is correct
7 Correct 104 ms 28060 KB Output is correct
8 Correct 86 ms 27680 KB Output is correct
9 Correct 138 ms 30064 KB Output is correct
10 Correct 117 ms 27804 KB Output is correct
11 Correct 173 ms 30168 KB Output is correct
12 Correct 176 ms 30160 KB Output is correct

Subtask #7
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 21924 KB Output is correct
2 Correct 16 ms 22076 KB Output is correct
3 Correct 15 ms 21948 KB Output is correct
4 Correct 16 ms 21964 KB Output is correct
5 Correct 14 ms 21984 KB Output is correct
6 Correct 14 ms 21968 KB Output is correct
7 Correct 16 ms 21980 KB Output is correct
8 Correct 16 ms 21964 KB Output is correct
9 Correct 16 ms 21968 KB Output is correct
10 Correct 16 ms 22016 KB Output is correct
11 Correct 15 ms 22024 KB Output is correct
12 Correct 16 ms 21980 KB Output is correct
13 Correct 14 ms 21988 KB Output is correct
14 Correct 15 ms 22020 KB Output is correct
15 Correct 15 ms 21964 KB Output is correct
16 Correct 17 ms 21980 KB Output is correct
17 Correct 15 ms 21984 KB Output is correct
18 Correct 16 ms 22072 KB Output is correct
19 Correct 15 ms 21964 KB Output is correct
20 Correct 15 ms 21984 KB Output is correct
21 Correct 15 ms 22092 KB Output is correct
22 Correct 16 ms 22092 KB Output is correct
23 Correct 15 ms 21964 KB Output is correct
24 Correct 16 ms 22092 KB Output is correct
25 Correct 14 ms 21964 KB Output is correct
26 Correct 14 ms 21964 KB Output is correct
27 Correct 15 ms 22092 KB Output is correct
28 Correct 15 ms 21988 KB Output is correct
29 Correct 17 ms 22092 KB Output is correct
30 Correct 16 ms 22092 KB Output is correct
31 Correct 16 ms 21980 KB Output is correct
32 Correct 15 ms 22092 KB Output is correct
33 Correct 14 ms 21964 KB Output is correct
34 Correct 15 ms 22108 KB Output is correct
35 Correct 15 ms 21964 KB Output is correct
36 Correct 16 ms 22092 KB Output is correct
37 Correct 15 ms 21976 KB Output is correct
38 Correct 15 ms 21964 KB Output is correct
39 Correct 129 ms 28348 KB Output is correct
40 Correct 135 ms 29396 KB Output is correct
41 Correct 132 ms 29512 KB Output is correct
42 Correct 130 ms 29516 KB Output is correct
43 Correct 165 ms 29340 KB Output is correct
44 Correct 133 ms 29412 KB Output is correct
45 Correct 72 ms 27712 KB Output is correct
46 Correct 74 ms 27772 KB Output is correct
47 Correct 127 ms 29404 KB Output is correct
48 Correct 123 ms 29412 KB Output is correct
49 Correct 125 ms 29332 KB Output is correct
50 Correct 127 ms 29444 KB Output is correct
51 Correct 119 ms 28408 KB Output is correct
52 Correct 134 ms 29600 KB Output is correct
53 Correct 132 ms 28736 KB Output is correct
54 Correct 133 ms 29148 KB Output is correct
55 Correct 135 ms 28612 KB Output is correct
56 Correct 129 ms 27860 KB Output is correct
57 Correct 60 ms 26748 KB Output is correct
58 Correct 69 ms 27452 KB Output is correct
59 Correct 153 ms 29072 KB Output is correct
60 Correct 169 ms 29148 KB Output is correct
61 Correct 145 ms 29256 KB Output is correct
62 Correct 153 ms 29144 KB Output is correct
63 Correct 152 ms 29160 KB Output is correct
64 Correct 147 ms 29196 KB Output is correct
65 Correct 99 ms 29220 KB Output is correct
66 Correct 145 ms 29300 KB Output is correct
67 Correct 104 ms 26964 KB Output is correct
68 Correct 129 ms 28160 KB Output is correct
69 Correct 162 ms 29128 KB Output is correct
70 Correct 145 ms 29148 KB Output is correct
71 Correct 107 ms 27604 KB Output is correct
72 Correct 132 ms 29172 KB Output is correct
73 Correct 169 ms 29396 KB Output is correct
74 Correct 186 ms 29944 KB Output is correct
75 Correct 180 ms 30188 KB Output is correct
76 Correct 128 ms 28028 KB Output is correct
77 Correct 190 ms 29184 KB Output is correct
78 Correct 196 ms 30148 KB Output is correct
79 Correct 104 ms 28060 KB Output is correct
80 Correct 86 ms 27680 KB Output is correct
81 Correct 138 ms 30064 KB Output is correct
82 Correct 117 ms 27804 KB Output is correct
83 Correct 173 ms 30168 KB Output is correct
84 Correct 176 ms 30160 KB Output is correct
85 Correct 143 ms 29068 KB Output is correct
86 Correct 158 ms 29900 KB Output is correct
87 Correct 152 ms 28840 KB Output is correct
88 Correct 172 ms 29796 KB Output is correct
89 Correct 103 ms 27256 KB Output is correct
90 Correct 154 ms 29780 KB Output is correct
91 Correct 129 ms 28176 KB Output is correct
92 Correct 119 ms 27988 KB Output is correct
93 Correct 158 ms 29748 KB Output is correct
94 Correct 155 ms 29640 KB Output is correct
95 Correct 156 ms 29548 KB Output is correct
96 Correct 157 ms 29780 KB Output is correct
97 Correct 177 ms 29708 KB Output is correct
98 Correct 129 ms 28400 KB Output is correct
99 Correct 138 ms 29744 KB Output is correct
100 Correct 126 ms 28592 KB Output is correct
101 Correct 150 ms 29828 KB Output is correct
102 Correct 137 ms 29528 KB Output is correct

Subtask #8
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 21924 KB Output is correct
2 Correct 16 ms 22076 KB Output is correct
3 Correct 15 ms 21948 KB Output is correct
4 Correct 16 ms 21964 KB Output is correct
5 Correct 14 ms 21984 KB Output is correct
6 Correct 14 ms 21968 KB Output is correct
7 Correct 16 ms 21980 KB Output is correct
8 Correct 16 ms 21964 KB Output is correct
9 Correct 16 ms 21968 KB Output is correct
10 Correct 16 ms 22016 KB Output is correct
11 Correct 15 ms 22024 KB Output is correct
12 Correct 16 ms 21980 KB Output is correct
13 Correct 14 ms 21988 KB Output is correct
14 Correct 15 ms 22020 KB Output is correct
15 Correct 15 ms 21964 KB Output is correct
16 Correct 17 ms 21980 KB Output is correct
17 Correct 15 ms 21984 KB Output is correct
18 Correct 16 ms 22072 KB Output is correct
19 Correct 15 ms 21964 KB Output is correct
20 Correct 15 ms 21984 KB Output is correct
21 Correct 15 ms 22092 KB Output is correct
22 Correct 16 ms 22092 KB Output is correct
23 Correct 15 ms 21964 KB Output is correct
24 Correct 16 ms 22092 KB Output is correct
25 Correct 14 ms 21964 KB Output is correct
26 Correct 14 ms 21964 KB Output is correct
27 Correct 15 ms 22092 KB Output is correct
28 Correct 15 ms 21988 KB Output is correct
29 Correct 17 ms 22092 KB Output is correct
30 Correct 16 ms 22092 KB Output is correct
31 Correct 16 ms 21980 KB Output is correct
32 Correct 15 ms 22092 KB Output is correct
33 Correct 14 ms 21964 KB Output is correct
34 Correct 15 ms 22108 KB Output is correct
35 Correct 15 ms 21964 KB Output is correct
36 Correct 16 ms 22092 KB Output is correct
37 Correct 15 ms 21976 KB Output is correct
38 Correct 15 ms 21964 KB Output is correct
39 Correct 129 ms 28348 KB Output is correct
40 Correct 135 ms 29396 KB Output is correct
41 Correct 132 ms 29512 KB Output is correct
42 Correct 130 ms 29516 KB Output is correct
43 Correct 165 ms 29340 KB Output is correct
44 Correct 133 ms 29412 KB Output is correct
45 Correct 72 ms 27712 KB Output is correct
46 Correct 74 ms 27772 KB Output is correct
47 Correct 127 ms 29404 KB Output is correct
48 Correct 123 ms 29412 KB Output is correct
49 Correct 125 ms 29332 KB Output is correct
50 Correct 127 ms 29444 KB Output is correct
51 Correct 119 ms 28408 KB Output is correct
52 Correct 134 ms 29600 KB Output is correct
53 Correct 132 ms 28736 KB Output is correct
54 Correct 133 ms 29148 KB Output is correct
55 Correct 703 ms 50320 KB Output is correct
56 Correct 535 ms 44668 KB Output is correct
57 Correct 788 ms 53084 KB Output is correct
58 Correct 641 ms 44884 KB Output is correct
59 Correct 638 ms 44364 KB Output is correct
60 Correct 906 ms 52208 KB Output is correct
61 Correct 324 ms 47168 KB Output is correct
62 Correct 328 ms 47060 KB Output is correct
63 Execution timed out 1028 ms 53924 KB Time limit exceeded
64 Halted 0 ms 0 KB -