oj.uz

Submission #754350

# Submission time Handle Problem Language Result Execution time Memory
754350 2023-06-07T14:25:51 Z tolbi Fountain Parks (IOI21_parks) C++17
30 / 100
 1214 ms 49064 KB 
#pragma optimize("Bismillahirrahmanirrahim")
//█▀█─█──█──█▀█─█─█
//█▄█─█──█──█▄█─█■█
//█─█─█▄─█▄─█─█─█─█
//Allahuekber
//ahmet23 orz...
//Sani buyuk Osman Pasa Plevneden cikmam diyor.
//FatihSultanMehmedHan
//YavuzSultanSelimHan
//AbdulhamidHan
#define author tolbi
#include <bits/stdc++.h>
using namespace std;
template<typename X, typename Y> istream& operator>>(istream& in, pair<X,Y> &pr) {return in>>pr.first>>pr.second;}
template<typename X, typename Y> ostream& operator<<(ostream& os, pair<X,Y> pr) {return os<<pr.first<<" "<<pr.second;}
template<typename X> istream& operator>>(istream& in, vector<X> &arr) {for(auto &it : arr) in>>it; return in;}
template<typename X> ostream& operator<<(ostream& os, vector<X> arr) {for(auto &it : arr) os<<it<<" "; return os;}
template<typename X, size_t Y> istream& operator>>(istream& in, array<X,Y> &arr) {for(auto &it : arr) in>>it; return in;}
template<typename X, size_t Y> ostream& operator<<(ostream& os, array<X,Y> arr) {for(auto &it : arr) os<<it<<" "; return os;}
template<typename T> vector<int32_t> normalize(vector<T> &arr){vector<int> rv;rv.resize(arr.size());for (int i = 0; i < rv.size(); ++i){rv[i]=arr[i];}return rv;}
#define endl '\n'
#define vint(x) vector<int> x
#define deci(x) int x;cin>>x;
#define decstr(x) string x;cin>>x;
#define cinarr(x) for (auto &it : x) cin>>it;
#define coutarr(x) for (auto &it : x) cout<<it<<" ";cout<<endl;
#define sortarr(x) sort(x.begin(),x.end())
#define sortrarr(x) sort(x.rbegin(),x.rend())
#define det(x) cout<<"NO\0YES"+x*3<<endl;
#define INF LONG_MAX
#define rev(x) reverse(x.begin(),x.end());
#define ios ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define tol(bi) (1LL<<((int)(bi)))
const int MOD = 1e9+7;
mt19937 ayahya(chrono::high_resolution_clock().now().time_since_epoch().count());
#include "parks.h"
struct DSU{
	vector<int> par;
	DSU(int n){
		par.resize(n);
		iota(par.begin(), par.end(), 0ll);
	}
	int find(int node){
		if (par[node]==node) return node;
		return par[node]=find(par[node]);
	}
	void merge(int a, int b){
		a=find(a);
		b=find(b);
		if (ayahya()%2) swap(a,b);
		par[a]=b;
	}
};
int construct_roads(vector<int> x, vector<int> y) {
	map<pair<int,int>,int> mp;
	int n = x.size();
	for (int i = 0; i < n; ++i)
	{
		mp[{x[i],y[i]}]=i;
	}
	map<pair<int,int>,int> dikey;
	map<pair<int,int>,int> yatay;
	vector<bool> yat;
	vector<int> u;
	vector<int> v;
	vector<int> a;
	vector<int> b;
	DSU dsu(n);
	vector<int> sirr;
	for (int i = 0; i < n; i++){
		if (x[i]==2) sirr.push_back(i);
	}
	for (int i = 0; i < n; ++i)
	{
		if (x[i]==6) sirr.push_back(i);
	}
	for (int i = 0; i < n; ++i){
		if (x[i]==4) sirr.push_back(i);
	}
	for (int j = 0; j < n; j++){
		int i = sirr[j];
		int xv = x[i];
		int yv = y[i];
		if (mp.count({xv+2,yv})){
			if (dsu.find(i)!=dsu.find(mp[{xv+2,yv}])){
				dsu.merge(i,mp[{xv+2,yv}]);
				yatay[{xv,yv}]=u.size();
				u.push_back(i);
				v.push_back(mp[{xv+2,yv}]);
				yat.push_back(true);
				a.push_back(-23);
				b.push_back(-23);
			}
		}
		if (mp.count({xv,yv+2})){
			if (dsu.find(i)!=dsu.find(mp[{xv,yv+2}])){
				dsu.merge(i,mp[{xv,yv+2}]);
				dikey[{xv,yv}]=u.size();
				u.push_back(i);
				v.push_back(mp[{xv,yv+2}]);
				yat.push_back(false);
				a.push_back(-23);
				b.push_back(-23);
			}
		}
	}
	if (u.size()!=n-1) return 0;
	map<pair<int,int>,bool> kap;
	int mini = *min_element(x.begin(), x.end());
	int minj = *min_element(y.begin(), y.end());
	int mani = *max_element(x.begin(), x.end());
	int manj = *max_element(y.begin(), y.end());
	vector<int> sir;
	vector<int> viss(u.size(),false);
	for (int i = 0; i < u.size(); i++){
		if (x[u[i]]==mini && !yat[i]){
			a[i]=x[u[i]]-1;
			b[i]=y[u[i]]+1;
			viss[i]=true;
			continue;
		}
		if (x[u[i]]==mani && !yat[i]){
			a[i]=x[u[i]]+1;
			b[i]=y[u[i]]+1;
			viss[i]=true;
			continue;
		}
		if (y[u[i]]==minj & yat[i]){
			a[i]=x[u[i]]+1;
			b[i]=y[u[i]]-1;
			viss[i]=true;
			continue;
		}
		if (y[u[i]]==manj && yat[i]){
			a[i]=x[u[i]]+1;
			b[i]=y[u[i]]+1;
			viss[i]=true;
			continue;
		}
	}
	for (int i = 0; i < u.size(); ++i)
	{
		if (viss[i]) continue;
		int xv = x[u[i]];
		int yv = y[u[i]];
		int ss = yatay.count({xv,yv}) + dikey.count({xv,yv}) + yatay.count({xv-2,yv}) + dikey.count({xv,yv-2});
		if (ss==4){
			sir.push_back(i);
			viss[i]=true;
		}
	}
	for (int i = 0; i < u.size(); ++i)
	{
		if (viss[i]) continue;
		int xv = x[u[i]];
		int yv = y[u[i]];
		int ss = yatay.count({xv,yv}) + dikey.count({xv,yv}) + yatay.count({xv-2,yv}) + dikey.count({xv,yv-2});
		int kk = yatay.count({xv,yv}) + yatay.count({xv-2,yv});
		if (ss>=3 && (kk>(ss-kk)) == yat[i]){
			sir.push_back(i);
			viss[i]=true;
		}
	}
	for (int i = 0; i < u.size(); ++i)
	{
		if (viss[i]) continue;
		sir.push_back(i);
	}
	for (int i = 0; i < sir.size(); i++){
		queue<int> q;
		q.push(sir[i]);
		while (q.size()){
			int ed = q.front();
			q.pop();
			if (a[ed]!=-23) continue;
			if (yat[ed]){
				if (!kap[{x[u[ed]]+1,y[u[ed]]+1}]){
					kap[{x[u[ed]]+1,y[u[ed]]+1}]=true;
					a[ed]=x[u[ed]]+1;
					b[ed]=y[u[ed]]+1;
				}
				else {
					if (kap[{x[u[ed]]+1,y[u[ed]]-1}]) return 0;
					kap[{x[u[ed]]+1,y[u[ed]]-1}]=true;
					a[ed]=x[u[ed]]+1;
					b[ed]=y[u[ed]]-1;
				}
			}
			else {
				if (!kap[{x[u[ed]]+1,y[u[ed]]+1}]){
					kap[{x[u[ed]]+1,y[u[ed]]+1}]=true;
					a[ed]=x[u[ed]]+1;
					b[ed]=y[u[ed]]+1;
				}
				else {
					if (kap[{x[u[ed]]-1,y[u[ed]]+1}]) return 0;
					kap[{x[u[ed]]-1,y[u[ed]]+1}]=true;
					a[ed]=x[u[ed]]-1;
					b[ed]=y[u[ed]]+1;
				}
			}
			pair<int,int> pr;
			pr={a[ed]-1,b[ed]-1};
			if (yatay.count(pr) && yatay[pr]!=ed && a[yatay[pr]]==-23){
				q.push(yatay[pr]);
			}
			pr={a[ed]-1,b[ed]+1};
			if (yatay.count(pr) && yatay[pr]!=ed && a[yatay[pr]]==-23){
				q.push(yatay[pr]);
			}			
			pr={a[ed]-1,b[ed]-1};
			if (dikey.count(pr) && dikey[pr]!=ed && a[dikey[pr]]==-23){
				q.push(dikey[pr]);
			}			
			pr={a[ed]+1,b[ed]-1};
			if (dikey.count(pr) && dikey[pr]!=ed && a[dikey[pr]]==-23){
				q.push(dikey[pr]);
			}
		}
	}
	build(u,v,a,b);
	return 1;
}

Compilation message

parks.cpp:1: warning: ignoring '#pragma optimize ' [-Wunknown-pragmas]
    1 | #pragma optimize("Bismillahirrahmanirrahim")
      | 
parks.cpp: In function 'int construct_roads(std::vector<int>, std::vector<int>)':
parks.cpp:107:14: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  107 |  if (u.size()!=n-1) return 0;
      |      ~~~~~~~~^~~~~
parks.cpp:115:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  115 |  for (int i = 0; i < u.size(); i++){
      |                  ~~^~~~~~~~~~
parks.cpp:128:14: warning: suggest parentheses around comparison in operand of '&' [-Wparentheses]
  128 |   if (y[u[i]]==minj & yat[i]){
parks.cpp:141:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  141 |  for (int i = 0; i < u.size(); ++i)
      |                  ~~^~~~~~~~~~
parks.cpp:152:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  152 |  for (int i = 0; i < u.size(); ++i)
      |                  ~~^~~~~~~~~~
parks.cpp:164:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  164 |  for (int i = 0; i < u.size(); ++i)
      |                  ~~^~~~~~~~~~
parks.cpp:169:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  169 |  for (int i = 0; i < sir.size(); i++){
      |                  ~~^~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 304 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 300 KB Output is correct
8 Correct 1 ms 304 KB Output is correct
9 Correct 279 ms 21280 KB Output is correct
10 Correct 13 ms 2516 KB Output is correct
11 Correct 78 ms 11472 KB Output is correct
12 Correct 19 ms 3676 KB Output is correct
13 Correct 56 ms 7880 KB Output is correct
14 Correct 2 ms 444 KB Output is correct
15 Correct 2 ms 596 KB Output is correct
16 Correct 224 ms 21212 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 304 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 300 KB Output is correct
8 Correct 1 ms 304 KB Output is correct
9 Correct 279 ms 21280 KB Output is correct
10 Correct 13 ms 2516 KB Output is correct
11 Correct 78 ms 11472 KB Output is correct
12 Correct 19 ms 3676 KB Output is correct
13 Correct 56 ms 7880 KB Output is correct
14 Correct 2 ms 444 KB Output is correct
15 Correct 2 ms 596 KB Output is correct
16 Correct 224 ms 21212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 300 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 300 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 913 ms 48816 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 3 ms 596 KB Output is correct
26 Correct 5 ms 852 KB Output is correct
27 Correct 6 ms 980 KB Output is correct
28 Correct 266 ms 19828 KB Output is correct
29 Correct 450 ms 29360 KB Output is correct
30 Correct 691 ms 39284 KB Output is correct
31 Correct 860 ms 48788 KB Output is correct
32 Correct 1 ms 312 KB Output is correct
33 Correct 1 ms 304 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 1 ms 212 KB Output is correct
38 Correct 0 ms 212 KB Output is correct
39 Correct 1 ms 212 KB Output is correct
40 Correct 1 ms 212 KB Output is correct
41 Correct 1 ms 212 KB Output is correct
42 Correct 1 ms 212 KB Output is correct
43 Correct 3 ms 596 KB Output is correct
44 Correct 4 ms 828 KB Output is correct
45 Correct 383 ms 23352 KB Output is correct
46 Correct 628 ms 33864 KB Output is correct
47 Correct 611 ms 33972 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 304 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 300 KB Output is correct
8 Correct 1 ms 304 KB Output is correct
9 Correct 279 ms 21280 KB Output is correct
10 Correct 13 ms 2516 KB Output is correct
11 Correct 78 ms 11472 KB Output is correct
12 Correct 19 ms 3676 KB Output is correct
13 Correct 56 ms 7880 KB Output is correct
14 Correct 2 ms 444 KB Output is correct
15 Correct 2 ms 596 KB Output is correct
16 Correct 224 ms 21212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 300 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 300 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 913 ms 48816 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 3 ms 596 KB Output is correct
26 Correct 5 ms 852 KB Output is correct
27 Correct 6 ms 980 KB Output is correct
28 Correct 266 ms 19828 KB Output is correct
29 Correct 450 ms 29360 KB Output is correct
30 Correct 691 ms 39284 KB Output is correct
31 Correct 860 ms 48788 KB Output is correct
32 Correct 1 ms 312 KB Output is correct
33 Correct 1 ms 304 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 1 ms 212 KB Output is correct
38 Correct 0 ms 212 KB Output is correct
39 Correct 1 ms 212 KB Output is correct
40 Correct 1 ms 212 KB Output is correct
41 Correct 1 ms 212 KB Output is correct
42 Correct 1 ms 212 KB Output is correct
43 Correct 3 ms 596 KB Output is correct
44 Correct 4 ms 828 KB Output is correct
45 Correct 383 ms 23352 KB Output is correct
46 Correct 628 ms 33864 KB Output is correct
47 Correct 611 ms 33972 KB Output is correct
48 Correct 1 ms 212 KB Output is correct
49 Correct 1 ms 212 KB Output is correct
50 Correct 1 ms 308 KB Output is correct
51 Correct 0 ms 304 KB Output is correct
52 Correct 1 ms 212 KB Output is correct
53 Correct 0 ms 308 KB Output is correct
54 Correct 1 ms 212 KB Output is correct
55 Correct 779 ms 46468 KB Output is correct
56 Correct 1 ms 212 KB Output is correct
57 Correct 4 ms 724 KB Output is correct
58 Correct 13 ms 1740 KB Output is correct
59 Correct 13 ms 1980 KB Output is correct
60 Correct 299 ms 23324 KB Output is correct
61 Correct 524 ms 31764 KB Output is correct
62 Correct 701 ms 38776 KB Output is correct
63 Correct 852 ms 46652 KB Output is correct
64 Correct 0 ms 212 KB Output is correct
65 Correct 1 ms 212 KB Output is correct
66 Correct 1 ms 212 KB Output is correct
67 Correct 527 ms 42148 KB Output is correct
68 Correct 561 ms 42120 KB Output is correct
69 Correct 588 ms 41972 KB Output is correct
70 Correct 5 ms 980 KB Output is correct
71 Correct 15 ms 1620 KB Output is correct
72 Correct 418 ms 24592 KB Output is correct
73 Correct 739 ms 37216 KB Output is correct
74 Correct 1113 ms 49064 KB Output is correct
75 Correct 795 ms 44852 KB Output is correct
76 Correct 617 ms 42164 KB Output is correct
77 Correct 6 ms 1108 KB Output is correct
78 Correct 12 ms 1852 KB Output is correct
79 Correct 416 ms 24140 KB Output is correct
80 Correct 799 ms 36292 KB Output is correct
81 Correct 1214 ms 48028 KB Output is correct

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 304 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 300 KB Output is correct
8 Correct 1 ms 304 KB Output is correct
9 Correct 279 ms 21280 KB Output is correct
10 Correct 13 ms 2516 KB Output is correct
11 Correct 78 ms 11472 KB Output is correct
12 Correct 19 ms 3676 KB Output is correct
13 Correct 56 ms 7880 KB Output is correct
14 Correct 2 ms 444 KB Output is correct
15 Correct 2 ms 596 KB Output is correct
16 Correct 224 ms 21212 KB Output is correct
17 Runtime error 1 ms 304 KB Execution killed with signal 11
18 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 304 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 300 KB Output is correct
8 Correct 1 ms 304 KB Output is correct
9 Correct 279 ms 21280 KB Output is correct
10 Correct 13 ms 2516 KB Output is correct
11 Correct 78 ms 11472 KB Output is correct
12 Correct 19 ms 3676 KB Output is correct
13 Correct 56 ms 7880 KB Output is correct
14 Correct 2 ms 444 KB Output is correct
15 Correct 2 ms 596 KB Output is correct
16 Correct 224 ms 21212 KB Output is correct
17 Runtime error 235 ms 44076 KB Execution killed with signal 11
18 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 304 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 300 KB Output is correct
8 Correct 1 ms 304 KB Output is correct
9 Correct 279 ms 21280 KB Output is correct
10 Correct 13 ms 2516 KB Output is correct
11 Correct 78 ms 11472 KB Output is correct
12 Correct 19 ms 3676 KB Output is correct
13 Correct 56 ms 7880 KB Output is correct
14 Correct 2 ms 444 KB Output is correct
15 Correct 2 ms 596 KB Output is correct
16 Correct 224 ms 21212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 300 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 300 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 913 ms 48816 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 3 ms 596 KB Output is correct
26 Correct 5 ms 852 KB Output is correct
27 Correct 6 ms 980 KB Output is correct
28 Correct 266 ms 19828 KB Output is correct
29 Correct 450 ms 29360 KB Output is correct
30 Correct 691 ms 39284 KB Output is correct
31 Correct 860 ms 48788 KB Output is correct
32 Correct 1 ms 312 KB Output is correct
33 Correct 1 ms 304 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 1 ms 212 KB Output is correct
38 Correct 0 ms 212 KB Output is correct
39 Correct 1 ms 212 KB Output is correct
40 Correct 1 ms 212 KB Output is correct
41 Correct 1 ms 212 KB Output is correct
42 Correct 1 ms 212 KB Output is correct
43 Correct 3 ms 596 KB Output is correct
44 Correct 4 ms 828 KB Output is correct
45 Correct 383 ms 23352 KB Output is correct
46 Correct 628 ms 33864 KB Output is correct
47 Correct 611 ms 33972 KB Output is correct
48 Correct 1 ms 212 KB Output is correct
49 Correct 1 ms 212 KB Output is correct
50 Correct 1 ms 308 KB Output is correct
51 Correct 0 ms 304 KB Output is correct
52 Correct 1 ms 212 KB Output is correct
53 Correct 0 ms 308 KB Output is correct
54 Correct 1 ms 212 KB Output is correct
55 Correct 779 ms 46468 KB Output is correct
56 Correct 1 ms 212 KB Output is correct
57 Correct 4 ms 724 KB Output is correct
58 Correct 13 ms 1740 KB Output is correct
59 Correct 13 ms 1980 KB Output is correct
60 Correct 299 ms 23324 KB Output is correct
61 Correct 524 ms 31764 KB Output is correct
62 Correct 701 ms 38776 KB Output is correct
63 Correct 852 ms 46652 KB Output is correct
64 Correct 0 ms 212 KB Output is correct
65 Correct 1 ms 212 KB Output is correct
66 Correct 1 ms 212 KB Output is correct
67 Correct 527 ms 42148 KB Output is correct
68 Correct 561 ms 42120 KB Output is correct
69 Correct 588 ms 41972 KB Output is correct
70 Correct 5 ms 980 KB Output is correct
71 Correct 15 ms 1620 KB Output is correct
72 Correct 418 ms 24592 KB Output is correct
73 Correct 739 ms 37216 KB Output is correct
74 Correct 1113 ms 49064 KB Output is correct
75 Correct 795 ms 44852 KB Output is correct
76 Correct 617 ms 42164 KB Output is correct
77 Correct 6 ms 1108 KB Output is correct
78 Correct 12 ms 1852 KB Output is correct
79 Correct 416 ms 24140 KB Output is correct
80 Correct 799 ms 36292 KB Output is correct
81 Correct 1214 ms 48028 KB Output is correct
82 Runtime error 1 ms 304 KB Execution killed with signal 11
83 Halted 0 ms 0 KB -