oj.uz

Submission #751818

# Submission time Handle Problem Language Result Execution time Memory
751818 2023-06-01T14:15:40 Z tolbi Connecting Supertrees (IOI20_supertrees) C++17
56 / 100
 276 ms 22160 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]) 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;
		}
	}
	for (int i = 0; i < n; i++){
		for (int j = 0; j < n; j++){
			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)
	{
		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:90:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   90 |   for (int j = 0; j < els2[i].size(); j++){
      |                   ~~^~~~~~~~~~~~~~~~
supertrees.cpp:100:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  100 |   for (int j = 1; j < els[i].size(); j++){
      |                   ~~^~~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 240 KB Output is correct
2 Correct 1 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 1 ms 212 KB Output is correct
6 Correct 14 ms 1208 KB Output is correct
7 Correct 228 ms 22036 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 240 KB Output is correct
2 Correct 1 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 1 ms 212 KB Output is correct
6 Correct 14 ms 1208 KB Output is correct
7 Correct 228 ms 22036 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 8 ms 1108 KB Output is correct
13 Correct 160 ms 22152 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 3 ms 596 KB Output is correct
17 Correct 77 ms 8084 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 58 ms 5728 KB Output is correct
21 Correct 186 ms 22032 KB Output is correct
22 Correct 197 ms 22096 KB Output is correct
23 Correct 228 ms 22092 KB Output is correct
24 Correct 202 ms 22160 KB Output is correct
25 Correct 87 ms 8080 KB Output is correct
26 Correct 86 ms 8088 KB Output is correct
27 Correct 270 ms 22020 KB Output is correct
28 Correct 192 ms 22124 KB Output is correct

Subtask #3
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Incorrect 0 ms 212 KB Answer gives possible 1 while actual possible 0
5 Halted 0 ms 0 KB -

Subtask #4
35.0 / 35.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 1 ms 212 KB Output is correct
4 Correct 62 ms 5772 KB Output is correct
5 Correct 236 ms 22104 KB Output is correct
6 Correct 221 ms 22052 KB Output is correct
7 Correct 260 ms 22096 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 52 ms 5692 KB Output is correct
10 Correct 207 ms 22040 KB Output is correct
11 Correct 222 ms 22096 KB Output is correct
12 Correct 231 ms 22100 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 51 ms 5808 KB Output is correct
17 Correct 179 ms 22052 KB Output is correct
18 Correct 276 ms 22108 KB Output is correct
19 Correct 188 ms 22096 KB Output is correct
20 Correct 212 ms 22092 KB Output is correct

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 240 KB Output is correct
2 Correct 1 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 1 ms 212 KB Output is correct
6 Correct 14 ms 1208 KB Output is correct
7 Correct 228 ms 22036 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 8 ms 1108 KB Output is correct
13 Correct 160 ms 22152 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 3 ms 596 KB Output is correct
17 Correct 77 ms 8084 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 58 ms 5728 KB Output is correct
21 Correct 186 ms 22032 KB Output is correct
22 Correct 197 ms 22096 KB Output is correct
23 Correct 228 ms 22092 KB Output is correct
24 Correct 202 ms 22160 KB Output is correct
25 Correct 87 ms 8080 KB Output is correct
26 Correct 86 ms 8088 KB Output is correct
27 Correct 270 ms 22020 KB Output is correct
28 Correct 192 ms 22124 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 0 ms 212 KB Output is correct
32 Incorrect 0 ms 212 KB Answer gives possible 1 while actual possible 0
33 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 240 KB Output is correct
2 Correct 1 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 1 ms 212 KB Output is correct
6 Correct 14 ms 1208 KB Output is correct
7 Correct 228 ms 22036 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 8 ms 1108 KB Output is correct
13 Correct 160 ms 22152 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 3 ms 596 KB Output is correct
17 Correct 77 ms 8084 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 58 ms 5728 KB Output is correct
21 Correct 186 ms 22032 KB Output is correct
22 Correct 197 ms 22096 KB Output is correct
23 Correct 228 ms 22092 KB Output is correct
24 Correct 202 ms 22160 KB Output is correct
25 Correct 87 ms 8080 KB Output is correct
26 Correct 86 ms 8088 KB Output is correct
27 Correct 270 ms 22020 KB Output is correct
28 Correct 192 ms 22124 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 0 ms 212 KB Output is correct
32 Incorrect 0 ms 212 KB Answer gives possible 1 while actual possible 0
33 Halted 0 ms 0 KB -