oj.uz

답안 #751823

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
751823 2023-06-01T14:23:30 Z tolbi 슈퍼트리 잇기 (IOI20_supertrees) C++17
100 / 100
 199 ms 22152 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;}
#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_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 "supertrees.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(vector<vector<int>> p){
	int n = p.size();
	for (int i = 0; i < n; ++i)
	{
		if (p[i][i]!=1) return 0;
	}
	DSU glob(n);
	DSU dal(n);
	for (int i = 0; i < n; i++){
		for (int j = 0; j < n; j++){
			if (p[i][j]==3) return 0;
			if (p[i][j]!=p[j][i]) return 0;
			if (p[i][j]) glob.merge(i,j);
			else if (glob.find(i)==glob.find(j)) return 0;
			if (p[i][j]==1) dal.merge(i,j);
			else if (dal.find(i)==dal.find(j)) return 0;
		}
	}
	vector<vector<int>> els(n);
	vector<vector<int>> els2(n);
	for (int i = 0; i < n; ++i)
	{
		els[dal.find(i)].push_back(i);
		if (dal.find(i)==i){
			els2[glob.find(i)].push_back(i);
		}
	}
	vector<vector<int>> rval(n,vector<int>(n,0));
	for (int i = 0; i < n; ++i)
	{
		if (els2[i].size()==2) return 0;
		for (int j = 0; j < els2[i].size(); j++){
			int x = els2[i][j];
			int y = els2[i][(j+1)%els2[i].size()];
			if (x==y) continue;
			rval[x][y]=1;
			rval[y][x]=1;
		}
	}
	for (int i = 0; i < n; ++i)
	{
		for (int j = 1; j < els[i].size(); j++){
			int x = els[i][j];
			int y = els[i][j-1];
			if (x==y) continue;
			rval[x][y]=1;
			rval[y][x]=1;
		}
	}
	build(rval);
	return 1;
}

Compilation message

supertrees.cpp:1: warning: ignoring '#pragma optimize ' [-Wunknown-pragmas]
    1 | #pragma optimize("Bismillahirrahmanirrahim")
      | 
supertrees.cpp: In function 'int construct(std::vector<std::vector<int> >)':
supertrees.cpp:85:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   85 |   for (int j = 0; j < els2[i].size(); j++){
      |                   ~~^~~~~~~~~~~~~~~~
supertrees.cpp:95:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   95 |   for (int j = 1; j < els[i].size(); j++){
      |                   ~~^~~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 9 ms 1144 KB Output is correct
7 Correct 183 ms 22040 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 9 ms 1144 KB Output is correct
7 Correct 183 ms 22040 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 6 ms 1108 KB Output is correct
13 Correct 160 ms 22088 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 3 ms 592 KB Output is correct
17 Correct 73 ms 8068 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 45 ms 5836 KB Output is correct
21 Correct 175 ms 22020 KB Output is correct
22 Correct 162 ms 22052 KB Output is correct
23 Correct 191 ms 22104 KB Output is correct
24 Correct 159 ms 22152 KB Output is correct
25 Correct 75 ms 8080 KB Output is correct
26 Correct 68 ms 8140 KB Output is correct
27 Correct 198 ms 22056 KB Output is correct
28 Correct 164 ms 22152 KB Output is correct

Subtask #3
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 0 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 7 ms 1108 KB Output is correct
9 Correct 165 ms 22152 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 9 ms 1208 KB Output is correct
13 Correct 183 ms 22108 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 4 ms 596 KB Output is correct
17 Correct 73 ms 8084 KB Output is correct
18 Correct 0 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 42 ms 5764 KB Output is correct
22 Correct 170 ms 22116 KB Output is correct
23 Correct 166 ms 22108 KB Output is correct
24 Correct 182 ms 22092 KB Output is correct
25 Correct 75 ms 12172 KB Output is correct
26 Correct 71 ms 8076 KB Output is correct
27 Correct 174 ms 22076 KB Output is correct
28 Correct 186 ms 22092 KB Output is correct
29 Correct 72 ms 12172 KB Output is correct

Subtask #4
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 51 ms 5772 KB Output is correct
5 Correct 171 ms 22020 KB Output is correct
6 Correct 183 ms 22020 KB Output is correct
7 Correct 199 ms 22032 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 48 ms 5708 KB Output is correct
10 Correct 166 ms 22024 KB Output is correct
11 Correct 178 ms 22028 KB Output is correct
12 Correct 181 ms 22152 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 42 ms 5700 KB Output is correct
17 Correct 161 ms 22036 KB Output is correct
18 Correct 165 ms 22072 KB Output is correct
19 Correct 165 ms 22104 KB Output is correct
20 Correct 161 ms 22152 KB Output is correct

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 9 ms 1144 KB Output is correct
7 Correct 183 ms 22040 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 6 ms 1108 KB Output is correct
13 Correct 160 ms 22088 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 3 ms 592 KB Output is correct
17 Correct 73 ms 8068 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 45 ms 5836 KB Output is correct
21 Correct 175 ms 22020 KB Output is correct
22 Correct 162 ms 22052 KB Output is correct
23 Correct 191 ms 22104 KB Output is correct
24 Correct 159 ms 22152 KB Output is correct
25 Correct 75 ms 8080 KB Output is correct
26 Correct 68 ms 8140 KB Output is correct
27 Correct 198 ms 22056 KB Output is correct
28 Correct 164 ms 22152 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 0 ms 212 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 0 ms 212 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 7 ms 1108 KB Output is correct
37 Correct 165 ms 22152 KB Output is correct
38 Correct 0 ms 212 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 9 ms 1208 KB Output is correct
41 Correct 183 ms 22108 KB Output is correct
42 Correct 0 ms 212 KB Output is correct
43 Correct 0 ms 212 KB Output is correct
44 Correct 4 ms 596 KB Output is correct
45 Correct 73 ms 8084 KB Output is correct
46 Correct 0 ms 212 KB Output is correct
47 Correct 0 ms 212 KB Output is correct
48 Correct 0 ms 212 KB Output is correct
49 Correct 42 ms 5764 KB Output is correct
50 Correct 170 ms 22116 KB Output is correct
51 Correct 166 ms 22108 KB Output is correct
52 Correct 182 ms 22092 KB Output is correct
53 Correct 75 ms 12172 KB Output is correct
54 Correct 71 ms 8076 KB Output is correct
55 Correct 174 ms 22076 KB Output is correct
56 Correct 186 ms 22092 KB Output is correct
57 Correct 72 ms 12172 KB Output is correct
58 Correct 1 ms 212 KB Output is correct
59 Correct 1 ms 212 KB Output is correct
60 Correct 4 ms 596 KB Output is correct
61 Correct 73 ms 8076 KB Output is correct
62 Correct 0 ms 212 KB Output is correct
63 Correct 0 ms 212 KB Output is correct
64 Correct 1 ms 212 KB Output is correct
65 Correct 44 ms 5768 KB Output is correct
66 Correct 67 ms 8072 KB Output is correct
67 Correct 65 ms 8084 KB Output is correct
68 Correct 69 ms 8140 KB Output is correct
69 Correct 72 ms 12180 KB Output is correct

Subtask #6
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 9 ms 1144 KB Output is correct
7 Correct 183 ms 22040 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 6 ms 1108 KB Output is correct
13 Correct 160 ms 22088 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 3 ms 592 KB Output is correct
17 Correct 73 ms 8068 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 45 ms 5836 KB Output is correct
21 Correct 175 ms 22020 KB Output is correct
22 Correct 162 ms 22052 KB Output is correct
23 Correct 191 ms 22104 KB Output is correct
24 Correct 159 ms 22152 KB Output is correct
25 Correct 75 ms 8080 KB Output is correct
26 Correct 68 ms 8140 KB Output is correct
27 Correct 198 ms 22056 KB Output is correct
28 Correct 164 ms 22152 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 0 ms 212 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 0 ms 212 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 7 ms 1108 KB Output is correct
37 Correct 165 ms 22152 KB Output is correct
38 Correct 0 ms 212 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 9 ms 1208 KB Output is correct
41 Correct 183 ms 22108 KB Output is correct
42 Correct 0 ms 212 KB Output is correct
43 Correct 0 ms 212 KB Output is correct
44 Correct 4 ms 596 KB Output is correct
45 Correct 73 ms 8084 KB Output is correct
46 Correct 0 ms 212 KB Output is correct
47 Correct 0 ms 212 KB Output is correct
48 Correct 0 ms 212 KB Output is correct
49 Correct 42 ms 5764 KB Output is correct
50 Correct 170 ms 22116 KB Output is correct
51 Correct 166 ms 22108 KB Output is correct
52 Correct 182 ms 22092 KB Output is correct
53 Correct 75 ms 12172 KB Output is correct
54 Correct 71 ms 8076 KB Output is correct
55 Correct 174 ms 22076 KB Output is correct
56 Correct 186 ms 22092 KB Output is correct
57 Correct 72 ms 12172 KB Output is correct
58 Correct 0 ms 212 KB Output is correct
59 Correct 0 ms 212 KB Output is correct
60 Correct 1 ms 212 KB Output is correct
61 Correct 51 ms 5772 KB Output is correct
62 Correct 171 ms 22020 KB Output is correct
63 Correct 183 ms 22020 KB Output is correct
64 Correct 199 ms 22032 KB Output is correct
65 Correct 0 ms 212 KB Output is correct
66 Correct 48 ms 5708 KB Output is correct
67 Correct 166 ms 22024 KB Output is correct
68 Correct 178 ms 22028 KB Output is correct
69 Correct 181 ms 22152 KB Output is correct
70 Correct 1 ms 212 KB Output is correct
71 Correct 1 ms 212 KB Output is correct
72 Correct 1 ms 212 KB Output is correct
73 Correct 42 ms 5700 KB Output is correct
74 Correct 161 ms 22036 KB Output is correct
75 Correct 165 ms 22072 KB Output is correct
76 Correct 165 ms 22104 KB Output is correct
77 Correct 161 ms 22152 KB Output is correct
78 Correct 1 ms 212 KB Output is correct
79 Correct 1 ms 212 KB Output is correct
80 Correct 4 ms 596 KB Output is correct
81 Correct 73 ms 8076 KB Output is correct
82 Correct 0 ms 212 KB Output is correct
83 Correct 0 ms 212 KB Output is correct
84 Correct 1 ms 212 KB Output is correct
85 Correct 44 ms 5768 KB Output is correct
86 Correct 67 ms 8072 KB Output is correct
87 Correct 65 ms 8084 KB Output is correct
88 Correct 69 ms 8140 KB Output is correct
89 Correct 72 ms 12180 KB Output is correct
90 Correct 1 ms 212 KB Output is correct
91 Correct 0 ms 212 KB Output is correct
92 Correct 4 ms 596 KB Output is correct
93 Correct 74 ms 8068 KB Output is correct
94 Correct 1 ms 212 KB Output is correct
95 Correct 1 ms 212 KB Output is correct
96 Correct 1 ms 212 KB Output is correct
97 Correct 17 ms 2680 KB Output is correct
98 Correct 70 ms 10060 KB Output is correct
99 Correct 70 ms 10104 KB Output is correct
100 Correct 68 ms 10060 KB Output is correct
101 Correct 70 ms 10100 KB Output is correct
102 Correct 67 ms 10100 KB Output is correct
103 Correct 67 ms 10060 KB Output is correct
104 Correct 63 ms 10108 KB Output is correct
105 Correct 76 ms 10112 KB Output is correct