oj.uz

Submission #728612

# Submission time Handle Problem Language Result Execution time Memory
728612 2023-04-22T17:46:05 Z shadow_sami Connecting Supertrees (IOI20_supertrees) C++17
11 / 100
 205 ms 24140 KB 
#include<bits/stdc++.h>
#include "supertrees.h"
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef int ll;
typedef vector<ll> vi;
typedef vector<vector<ll>> vvi;
typedef pair<ll,ll> pi;
typedef map<ll,ll> mi;
typedef long double ld;
typedef vector<ld> vd;
typedef vector<vector<ld>> vvd;
typedef pair<ld,ld> pd;
#define ff first
#define ss second
#define srt(a) sort(a.begin(),a.end());
#define fip(k, n) for (ll i = k; i < n; i++)
#define fjp(k, n) for (ll j = k; j < n; j++)
#define fin(k, n) for (ll i = k; i >= n; i--)
#define fjn(k, n) for (ll j = k; j >= n; j--)
#define fp(k, n, m) for (ll k = n; k < m; k++)
#define fn(k, n, m) for (ll k = n; k >= m; k--)
#define ordered_set tree<pi, null_type,less< pi >, rb_tree_tag,tree_order_statistics_node_update>
#define totalOne(n) __builtin_popcount(n)
#define backZero(n) __builtin_ctzll(n)
#define frontZero(n) __builtin_clzll(n)
#define fx(k) for ( auto x : k )
#define test ll t;cin >> t;while (t--)
#define nli "\n"

// ==========================(debug)============================================================================================== //

#ifndef ONLINE_JUDGE
#define debug(x) cerr << #x <<" "; _printn(x); cerr << nli;
#else
#define debug(x)
#endif

// void _printn(ll x){ cerr<<x<<" "; }
void _printn(int x){ cerr<<x<<" "; }
void _printn(ld x){ cerr<<x<<" "; }
void _printn(double x){ cerr<<x<<" "; }
void _printn(string x){ cerr<<x<<" "; }
void _printn(char x){ cerr<<x<<" "; }
void _printn(bool x){ cerr<<x<<" "; }
template<class T,class V>void _printn(pair<T,V> vv);
template<class T> void _printn(vector<T> vv);
template<class T> void _printn(set<T> vv);
template<class T,class V> void _printn(map<T,V> vv);
template<class T> void _printn(multiset<T> vv);
template<class T,class V>void _printn(pair<T,V> vv){ cerr<<"( ";_printn(vv.ff);cerr<<",";_printn(vv.ss);cerr<<")";}
template<class T> void _printn(vector<T> vv){ cerr<<"[ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"]"; };
template<class T> void _printn(set<T> vv){ cerr<<"{ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"}"; };
template<class T> void _printn(multiset<T> vv){ cerr<<"{ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"}"; };
template<class T,class V> void _printn(map<T,V> vv){ cerr<<"{ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"}"; };

// ==========================(debug)============================================================================================== //

ll n,m,tp,tp2,res,cnt,sum,tptp,ans;
const ll mx = 1e3+5;
const ll mod = 1e9+7;

// // ==========================(MOD)=============================================================================================== //

// ll mod_add(ll aa,ll bb){ return ((aa%mod)+(bb%mod))%mod; }
// ll mod_minus(ll aa,ll bb){ return (((aa%mod)-(bb%mod))+10*mod)%mod; }
// ll mod_mul(ll aa,ll bb){ return ((aa%mod)*(bb%mod))%mod; }
// ll mod_power(ll aa,ll bb){ aa%=mod; ll empowered = 1; bb%=mod-1; while(bb > 0){ if(bb & 1) empowered = mod_mul(empowered,aa); bb = bb >> 1; aa = mod_mul(aa,aa); } return empowered; }
// ll mod_divi(ll aa,ll bb){ aa=mod_mul(aa,mod_power(bb,mod-2)); return aa; }

// // ==========================(MOD)=============================================================================================== //

bool f = false;
ll comp[mx];

int construct(vvi p){
	n = p.size();
	memset(comp,-1,sizeof(comp));
	vector<vector<int>> bu(n,vector<int>(n,0));
	tptp = 0;

	fip(0,n){
		if(comp[i] != -1){
			tp = comp[i];
		}
		else{
			tptp++;
			tp = tptp;
		}
		fjp(0,n){
			if(p[i][j]){
				if(comp[j] != -1 && comp[j] != tp)
					return 0;
				comp[j] = tp;
			}
		}
	}
	set<ll> st[tptp];
	fjp(0,tptp){
		fip(0,n){
			if(comp[i] == j+1){
				st[j].insert(i);
			}
		}
	}
	vector<int> st2[tptp];
	fip(0,tptp){
		fx(st[i])
			st2[i].push_back(x);
	}
	fp(yy,0,tptp){
		m = st2[yy].size();
		set<ll> temp;
		temp.clear();
		fip(0,m)
			fjp(0,m){
				if(p[st2[yy][i]][st2[yy][j]] == 1){
					temp.insert(st2[yy][i]);
					temp.insert(st2[yy][j]);
				}
			}
		vi v;
		fx(temp){
			st[yy].erase(st[yy].find(x));
			v.push_back(x);
		}
		st[yy].insert(v[0]);
		if(st[yy].size()==2)
			return 0;
		if(v.size()>1){
			fip(1,(int)v.size()){
				if(v[i-1] != v[i])
					bu[v[i-1]][v[i]] = 1;
			}
		}
		vi vv;
		fx(st[yy])
			vv.push_back(x);
		
		if(vv.size()>1){
			fip(1,(int)vv.size()){
				if(vv[i-1] != vv[i])
					bu[vv[i-1]][vv[i]] = 1;
			}
			if(vv[0] != vv[((int)vv.size())-1])
				bu[vv[0]][vv[((int)vv.size())-1]] = 1;
		}
	}
	fip(0,n)
		fjp(0,n)
			if(bu[i][j])
				bu[j][i] = 1;
	
	build(bu);
	return 1;
}

// int main(){
//     ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
//     #ifndef ONLINE_JUDGE
//         freopen("input1.txt", "r", stdin);
//         freopen("output1.txt", "w", stdout);
//         freopen("error1.txt", "w", stderr);
//     #endif // ONLINE_JUDGE

//         ll nn;
//         cin>>nn;
//         vector<vector<int>> a(nn,vector<int>(nn));
//         fip(0,nn)
//         	fjp(0,nn)        
//         		cin>>a[i][j];
//         if(construct(a)){
//         	cout<<"YES\n";        	
//         }else{
//         	cout<<"NO\n";        	
//         }
//         cout<<"OK";
        
//     cerr << "Time elapsed: " << setprecision(6) << 1000.0 * clock() / CLOCKS_PER_SEC << "ms\n";
//     return 0;
// }

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 308 KB Output is correct
6 Correct 9 ms 1272 KB Output is correct
7 Correct 205 ms 24048 KB Output is correct

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 308 KB Output is correct
6 Correct 9 ms 1272 KB Output is correct
7 Correct 205 ms 24048 KB Output is correct
8 Correct 1 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 0 ms 212 KB Output is correct
12 Correct 7 ms 1216 KB Output is correct
13 Correct 157 ms 24140 KB Output is correct
14 Incorrect 1 ms 212 KB Answer gives possible 1 while actual possible 0
15 Halted 0 ms 0 KB -

Subtask #3
0 / 19.0

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

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Incorrect 1 ms 212 KB Too few ways to get from 0 to 1, should be 2 found 1
3 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 308 KB Output is correct
6 Correct 9 ms 1272 KB Output is correct
7 Correct 205 ms 24048 KB Output is correct
8 Correct 1 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 0 ms 212 KB Output is correct
12 Correct 7 ms 1216 KB Output is correct
13 Correct 157 ms 24140 KB Output is correct
14 Incorrect 1 ms 212 KB Answer gives possible 1 while actual possible 0
15 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 308 KB Output is correct
6 Correct 9 ms 1272 KB Output is correct
7 Correct 205 ms 24048 KB Output is correct
8 Correct 1 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 0 ms 212 KB Output is correct
12 Correct 7 ms 1216 KB Output is correct
13 Correct 157 ms 24140 KB Output is correct
14 Incorrect 1 ms 212 KB Answer gives possible 1 while actual possible 0
15 Halted 0 ms 0 KB -