oj.uz

답안 #754237

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
754237 2023-06-07T10:05:25 Z tolbi 분수 공원 (IOI21_parks) C++17
15 / 100
 1338 ms 53764 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);
	for (int i = 0; i < n; i++){
		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;
	for (int i = 0; i < u.size(); i++){
		int ed = i;
		while (true){
			if (a[ed]!=-23) break;
			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 {
					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 {
					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){
				ed=yatay[pr];
				continue;
			}
			pr={a[ed]-1,b[ed]+1};
			if (yatay.count(pr) && yatay[pr]!=ed){
				ed=yatay[pr];
				continue;
			}			
			pr={a[ed]-1,b[ed]-1};
			if (dikey.count(pr) && dikey[pr]!=ed){
				continue;
			}			
			pr={a[ed]+1,b[ed]-1};
			if (dikey.count(pr) && dikey[pr]!=ed){
				ed=dikey[pr];
				continue;
			}
		}
	}
	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:95:14: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   95 |  if (u.size()!=n-1) return 0;
      |      ~~~~~~~~^~~~~
parks.cpp:97:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   97 |  for (int i = 0; i < u.size(); i++){
      |                  ~~^~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 304 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 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 378 ms 26576 KB Output is correct
10 Correct 18 ms 3028 KB Output is correct
11 Correct 126 ms 14340 KB Output is correct
12 Correct 27 ms 4392 KB Output is correct
13 Correct 55 ms 7752 KB Output is correct
14 Correct 2 ms 436 KB Output is correct
15 Correct 3 ms 596 KB Output is correct
16 Correct 405 ms 26540 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 304 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 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 378 ms 26576 KB Output is correct
10 Correct 18 ms 3028 KB Output is correct
11 Correct 126 ms 14340 KB Output is correct
12 Correct 27 ms 4392 KB Output is correct
13 Correct 55 ms 7752 KB Output is correct
14 Correct 2 ms 436 KB Output is correct
15 Correct 3 ms 596 KB Output is correct
16 Correct 405 ms 26540 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 304 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1138 ms 52812 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 3 ms 568 KB Output is correct
26 Correct 4 ms 724 KB Output is correct
27 Correct 5 ms 948 KB Output is correct
28 Correct 320 ms 21296 KB Output is correct
29 Correct 564 ms 31852 KB Output is correct
30 Correct 829 ms 42372 KB Output is correct
31 Correct 1070 ms 52924 KB Output is correct
32 Correct 1 ms 304 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 340 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 1 ms 212 KB Output is correct
38 Correct 1 ms 212 KB Output is correct
39 Correct 1 ms 304 KB Output is correct
40 Correct 1 ms 212 KB Output is correct
41 Correct 1 ms 340 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 724 KB Output is correct
45 Correct 413 ms 26640 KB Output is correct
46 Correct 752 ms 38632 KB Output is correct
47 Correct 818 ms 38464 KB Output is correct

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 304 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 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 378 ms 26576 KB Output is correct
10 Correct 18 ms 3028 KB Output is correct
11 Correct 126 ms 14340 KB Output is correct
12 Correct 27 ms 4392 KB Output is correct
13 Correct 55 ms 7752 KB Output is correct
14 Correct 2 ms 436 KB Output is correct
15 Correct 3 ms 596 KB Output is correct
16 Correct 405 ms 26540 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 304 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1138 ms 52812 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 3 ms 568 KB Output is correct
26 Correct 4 ms 724 KB Output is correct
27 Correct 5 ms 948 KB Output is correct
28 Correct 320 ms 21296 KB Output is correct
29 Correct 564 ms 31852 KB Output is correct
30 Correct 829 ms 42372 KB Output is correct
31 Correct 1070 ms 52924 KB Output is correct
32 Correct 1 ms 304 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 340 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 1 ms 212 KB Output is correct
38 Correct 1 ms 212 KB Output is correct
39 Correct 1 ms 304 KB Output is correct
40 Correct 1 ms 212 KB Output is correct
41 Correct 1 ms 340 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 724 KB Output is correct
45 Correct 413 ms 26640 KB Output is correct
46 Correct 752 ms 38632 KB Output is correct
47 Correct 818 ms 38464 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 304 KB Output is correct
51 Correct 1 ms 212 KB Output is correct
52 Correct 1 ms 212 KB Output is correct
53 Incorrect 1 ms 212 KB Tree @(3, 5) appears more than once: for edges on positions 0 and 3
54 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 304 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 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 378 ms 26576 KB Output is correct
10 Correct 18 ms 3028 KB Output is correct
11 Correct 126 ms 14340 KB Output is correct
12 Correct 27 ms 4392 KB Output is correct
13 Correct 55 ms 7752 KB Output is correct
14 Correct 2 ms 436 KB Output is correct
15 Correct 3 ms 596 KB Output is correct
16 Correct 405 ms 26540 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 1058 ms 53764 KB Output is correct
21 Correct 1020 ms 53448 KB Output is correct
22 Correct 1154 ms 53528 KB Output is correct
23 Correct 1014 ms 45340 KB Output is correct
24 Correct 325 ms 18536 KB Output is correct
25 Correct 820 ms 33932 KB Output is correct
26 Correct 629 ms 34000 KB Output is correct
27 Correct 1168 ms 52868 KB Output is correct
28 Correct 1338 ms 52840 KB Output is correct
29 Correct 1285 ms 52780 KB Output is correct
30 Correct 1282 ms 52772 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Incorrect 45 ms 4400 KB Tree @(186201, 20727) appears more than once: for edges on positions 1008 and 1069
33 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 304 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 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 378 ms 26576 KB Output is correct
10 Correct 18 ms 3028 KB Output is correct
11 Correct 126 ms 14340 KB Output is correct
12 Correct 27 ms 4392 KB Output is correct
13 Correct 55 ms 7752 KB Output is correct
14 Correct 2 ms 436 KB Output is correct
15 Correct 3 ms 596 KB Output is correct
16 Correct 405 ms 26540 KB Output is correct
17 Correct 1144 ms 53256 KB Output is correct
18 Correct 1191 ms 53588 KB Output is correct
19 Incorrect 936 ms 53592 KB Tree @(99999, 50001) appears more than once: for edges on positions 16885 and 41940
20 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 304 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 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 378 ms 26576 KB Output is correct
10 Correct 18 ms 3028 KB Output is correct
11 Correct 126 ms 14340 KB Output is correct
12 Correct 27 ms 4392 KB Output is correct
13 Correct 55 ms 7752 KB Output is correct
14 Correct 2 ms 436 KB Output is correct
15 Correct 3 ms 596 KB Output is correct
16 Correct 405 ms 26540 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 304 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1138 ms 52812 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 3 ms 568 KB Output is correct
26 Correct 4 ms 724 KB Output is correct
27 Correct 5 ms 948 KB Output is correct
28 Correct 320 ms 21296 KB Output is correct
29 Correct 564 ms 31852 KB Output is correct
30 Correct 829 ms 42372 KB Output is correct
31 Correct 1070 ms 52924 KB Output is correct
32 Correct 1 ms 304 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 340 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 1 ms 212 KB Output is correct
38 Correct 1 ms 212 KB Output is correct
39 Correct 1 ms 304 KB Output is correct
40 Correct 1 ms 212 KB Output is correct
41 Correct 1 ms 340 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 724 KB Output is correct
45 Correct 413 ms 26640 KB Output is correct
46 Correct 752 ms 38632 KB Output is correct
47 Correct 818 ms 38464 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 304 KB Output is correct
51 Correct 1 ms 212 KB Output is correct
52 Correct 1 ms 212 KB Output is correct
53 Incorrect 1 ms 212 KB Tree @(3, 5) appears more than once: for edges on positions 0 and 3
54 Halted 0 ms 0 KB -