oj.uz

Submission #754352

# Submission time Handle Problem Language Result Execution time Memory
754352 2023-06-07T14:26:54 Z tolbi Fountain Parks (IOI21_parks) C++17
30 / 100
 1104 ms 48640 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 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:111:14: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  111 |  if (u.size()!=n-1) return 0;
      |      ~~~~~~~~^~~~~
parks.cpp:119:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  119 |  for (int i = 0; i < u.size(); i++){
      |                  ~~^~~~~~~~~~
parks.cpp:132:14: warning: suggest parentheses around comparison in operand of '&' [-Wparentheses]
  132 |   if (y[u[i]]==minj & yat[i]){
parks.cpp:145:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  145 |  for (int i = 0; i < u.size(); ++i)
      |                  ~~^~~~~~~~~~
parks.cpp:156:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  156 |  for (int i = 0; i < u.size(); ++i)
      |                  ~~^~~~~~~~~~
parks.cpp:168:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  168 |  for (int i = 0; i < u.size(); ++i)
      |                  ~~^~~~~~~~~~
parks.cpp:173:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  173 |  for (int i = 0; i < sir.size(); i++){
      |                  ~~^~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 252 ms 20292 KB Output is correct
10 Correct 13 ms 2388 KB Output is correct
11 Correct 79 ms 11004 KB Output is correct
12 Correct 19 ms 3600 KB Output is correct
13 Correct 51 ms 7496 KB Output is correct
14 Correct 2 ms 468 KB Output is correct
15 Correct 3 ms 596 KB Output is correct
16 Correct 236 ms 20408 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 252 ms 20292 KB Output is correct
10 Correct 13 ms 2388 KB Output is correct
11 Correct 79 ms 11004 KB Output is correct
12 Correct 19 ms 3600 KB Output is correct
13 Correct 51 ms 7496 KB Output is correct
14 Correct 2 ms 468 KB Output is correct
15 Correct 3 ms 596 KB Output is correct
16 Correct 236 ms 20408 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 889 ms 47108 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 3 ms 596 KB Output is correct
26 Correct 3 ms 724 KB Output is correct
27 Correct 5 ms 852 KB Output is correct
28 Correct 259 ms 19156 KB Output is correct
29 Correct 477 ms 28260 KB Output is correct
30 Correct 693 ms 38000 KB Output is correct
31 Correct 848 ms 47188 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 0 ms 212 KB Output is correct
37 Correct 0 ms 212 KB Output is correct
38 Correct 0 ms 212 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 0 ms 212 KB Output is correct
41 Correct 0 ms 212 KB Output is correct
42 Correct 0 ms 212 KB Output is correct
43 Correct 3 ms 596 KB Output is correct
44 Correct 4 ms 724 KB Output is correct
45 Correct 358 ms 22496 KB Output is correct
46 Correct 595 ms 32852 KB Output is correct
47 Correct 597 ms 32920 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 252 ms 20292 KB Output is correct
10 Correct 13 ms 2388 KB Output is correct
11 Correct 79 ms 11004 KB Output is correct
12 Correct 19 ms 3600 KB Output is correct
13 Correct 51 ms 7496 KB Output is correct
14 Correct 2 ms 468 KB Output is correct
15 Correct 3 ms 596 KB Output is correct
16 Correct 236 ms 20408 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 889 ms 47108 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 3 ms 596 KB Output is correct
26 Correct 3 ms 724 KB Output is correct
27 Correct 5 ms 852 KB Output is correct
28 Correct 259 ms 19156 KB Output is correct
29 Correct 477 ms 28260 KB Output is correct
30 Correct 693 ms 38000 KB Output is correct
31 Correct 848 ms 47188 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 0 ms 212 KB Output is correct
37 Correct 0 ms 212 KB Output is correct
38 Correct 0 ms 212 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 0 ms 212 KB Output is correct
41 Correct 0 ms 212 KB Output is correct
42 Correct 0 ms 212 KB Output is correct
43 Correct 3 ms 596 KB Output is correct
44 Correct 4 ms 724 KB Output is correct
45 Correct 358 ms 22496 KB Output is correct
46 Correct 595 ms 32852 KB Output is correct
47 Correct 597 ms 32920 KB Output is correct
48 Correct 0 ms 212 KB Output is correct
49 Correct 1 ms 212 KB Output is correct
50 Correct 0 ms 212 KB Output is correct
51 Correct 1 ms 212 KB Output is correct
52 Correct 1 ms 212 KB Output is correct
53 Correct 1 ms 212 KB Output is correct
54 Correct 1 ms 212 KB Output is correct
55 Correct 811 ms 45976 KB Output is correct
56 Correct 1 ms 212 KB Output is correct
57 Correct 4 ms 724 KB Output is correct
58 Correct 12 ms 1732 KB Output is correct
59 Correct 13 ms 1876 KB Output is correct
60 Correct 386 ms 23108 KB Output is correct
61 Correct 454 ms 30908 KB Output is correct
62 Correct 629 ms 37544 KB Output is correct
63 Correct 769 ms 46108 KB Output is correct
64 Correct 1 ms 212 KB Output is correct
65 Correct 1 ms 212 KB Output is correct
66 Correct 0 ms 212 KB Output is correct
67 Correct 588 ms 41648 KB Output is correct
68 Correct 548 ms 41632 KB Output is correct
69 Correct 597 ms 41424 KB Output is correct
70 Correct 5 ms 852 KB Output is correct
71 Correct 12 ms 1548 KB Output is correct
72 Correct 370 ms 24132 KB Output is correct
73 Correct 714 ms 36108 KB Output is correct
74 Correct 1104 ms 48640 KB Output is correct
75 Correct 747 ms 44388 KB Output is correct
76 Correct 578 ms 41588 KB Output is correct
77 Correct 7 ms 1108 KB Output is correct
78 Correct 12 ms 1880 KB Output is correct
79 Correct 357 ms 23772 KB Output is correct
80 Correct 699 ms 35344 KB Output is correct
81 Correct 1008 ms 47580 KB Output is correct

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 252 ms 20292 KB Output is correct
10 Correct 13 ms 2388 KB Output is correct
11 Correct 79 ms 11004 KB Output is correct
12 Correct 19 ms 3600 KB Output is correct
13 Correct 51 ms 7496 KB Output is correct
14 Correct 2 ms 468 KB Output is correct
15 Correct 3 ms 596 KB Output is correct
16 Correct 236 ms 20408 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Incorrect 568 ms 35744 KB Solution announced impossible, but it is possible.
21 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 252 ms 20292 KB Output is correct
10 Correct 13 ms 2388 KB Output is correct
11 Correct 79 ms 11004 KB Output is correct
12 Correct 19 ms 3600 KB Output is correct
13 Correct 51 ms 7496 KB Output is correct
14 Correct 2 ms 468 KB Output is correct
15 Correct 3 ms 596 KB Output is correct
16 Correct 236 ms 20408 KB Output is correct
17 Incorrect 485 ms 33480 KB Solution announced impossible, but it is possible.
18 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 252 ms 20292 KB Output is correct
10 Correct 13 ms 2388 KB Output is correct
11 Correct 79 ms 11004 KB Output is correct
12 Correct 19 ms 3600 KB Output is correct
13 Correct 51 ms 7496 KB Output is correct
14 Correct 2 ms 468 KB Output is correct
15 Correct 3 ms 596 KB Output is correct
16 Correct 236 ms 20408 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 889 ms 47108 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 3 ms 596 KB Output is correct
26 Correct 3 ms 724 KB Output is correct
27 Correct 5 ms 852 KB Output is correct
28 Correct 259 ms 19156 KB Output is correct
29 Correct 477 ms 28260 KB Output is correct
30 Correct 693 ms 38000 KB Output is correct
31 Correct 848 ms 47188 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 0 ms 212 KB Output is correct
37 Correct 0 ms 212 KB Output is correct
38 Correct 0 ms 212 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 0 ms 212 KB Output is correct
41 Correct 0 ms 212 KB Output is correct
42 Correct 0 ms 212 KB Output is correct
43 Correct 3 ms 596 KB Output is correct
44 Correct 4 ms 724 KB Output is correct
45 Correct 358 ms 22496 KB Output is correct
46 Correct 595 ms 32852 KB Output is correct
47 Correct 597 ms 32920 KB Output is correct
48 Correct 0 ms 212 KB Output is correct
49 Correct 1 ms 212 KB Output is correct
50 Correct 0 ms 212 KB Output is correct
51 Correct 1 ms 212 KB Output is correct
52 Correct 1 ms 212 KB Output is correct
53 Correct 1 ms 212 KB Output is correct
54 Correct 1 ms 212 KB Output is correct
55 Correct 811 ms 45976 KB Output is correct
56 Correct 1 ms 212 KB Output is correct
57 Correct 4 ms 724 KB Output is correct
58 Correct 12 ms 1732 KB Output is correct
59 Correct 13 ms 1876 KB Output is correct
60 Correct 386 ms 23108 KB Output is correct
61 Correct 454 ms 30908 KB Output is correct
62 Correct 629 ms 37544 KB Output is correct
63 Correct 769 ms 46108 KB Output is correct
64 Correct 1 ms 212 KB Output is correct
65 Correct 1 ms 212 KB Output is correct
66 Correct 0 ms 212 KB Output is correct
67 Correct 588 ms 41648 KB Output is correct
68 Correct 548 ms 41632 KB Output is correct
69 Correct 597 ms 41424 KB Output is correct
70 Correct 5 ms 852 KB Output is correct
71 Correct 12 ms 1548 KB Output is correct
72 Correct 370 ms 24132 KB Output is correct
73 Correct 714 ms 36108 KB Output is correct
74 Correct 1104 ms 48640 KB Output is correct
75 Correct 747 ms 44388 KB Output is correct
76 Correct 578 ms 41588 KB Output is correct
77 Correct 7 ms 1108 KB Output is correct
78 Correct 12 ms 1880 KB Output is correct
79 Correct 357 ms 23772 KB Output is correct
80 Correct 699 ms 35344 KB Output is correct
81 Correct 1008 ms 47580 KB Output is correct
82 Correct 1 ms 212 KB Output is correct
83 Correct 1 ms 212 KB Output is correct
84 Correct 1 ms 212 KB Output is correct
85 Incorrect 568 ms 35744 KB Solution announced impossible, but it is possible.
86 Halted 0 ms 0 KB -