oj.uz

Submission #785017

# Submission time Handle Problem Language Result Execution time Memory
785017 2023-07-16T23:21:00 Z tolbi Political Development (BOI17_politicaldevelopment) C++17
4 / 100
 8 ms 6564 KB 
#pragma optimize("Bismillahirrahmanirrahim")
//█▀█─█──█──█▀█─█─█
//█▄█─█──█──█▄█─█■█
//█─█─█▄─█▄─█─█─█─█
//ahmet23 orz...
//FatihSultanMehmedHan
//YavuzSultanSelimHan
//AbdulhamidHan
//Sani buyuk Osman Pasa Plevneden cikmam diyor
#define author tolbi
#include <bits/stdc++.h>
using namespace std;
template<typename X, typename Y> istream& operator>>(istream& is, pair<X,Y> &pr){return is>>pr.first>>pr.second;}
#ifdef tolbi
template<typename X, typename Y> ostream& operator<<(ostream& os, pair<X,Y> pr){return os<<"{ "<<pr.first<<", "<<pr.second<<" }";}
#else
template<typename X, typename Y> ostream& operator<<(ostream& os, pair<X,Y> pr){return os<<pr.first<<" "<<pr.second;}
#endif
ostream& operator<<(ostream& os, bool bl){return os<<(int32_t)bl;}
template<typename X> istream& operator>>(istream& is, vector<X> &arr){for (auto &it : arr) is>>it; return is;}
template<typename X, size_t Y> istream& operator>>(istream& is, array<X,Y> &arr){for (auto &it : arr) is>>it; return is;}
template<typename X> ostream& operator<<(ostream& os, vector<X> &arr){for (auto &it : arr) os<<" "<<it;os<<endl;return os;}
template<typename X, size_t Y> ostream& operator<<(ostream& os, array<X,Y> &arr){for (auto &it : arr) os<<" "<<it;os<<endl;return os;}
#define endl '\n'
#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 rev(x) reverse(x.begin(), x.end())
#define tol(bi) (1LL<<((int)(bi)))
#define ios ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
const int MOD = 1e9+7;
mt19937 ayahya(chrono::high_resolution_clock().now().time_since_epoch().count());
int32_t main(){
	ios;
	int T = 1;
	if (!T) cin>>T;
	int tno = 0;
	while (T-(tno++)){
		bitset<5000> full;
		deci(n);deci(k);
		vector<bitset<5000>> __arr(n);
		vector<bitset<5000>> arr(n);
		vector<pair<int,int>> sz(n);
		for (int i = 0; i < n; ++i)
		{
			sz[i].second=i;
			full[i]=1;
			cin>>sz[i].first;
			for (int j = 0; j < sz[i].first; j++){
				deci(x);
				__arr[i][x]=1;
			}
		}
		sortarr(sz);
		for (int i = 0; i < n; ++i)
		{
			swap(arr[i],__arr[sz[i].second]);
		}
		bitset<5000> kk;
		auto f = [&](bitset<5000> bs, int dept, auto f)->int{
			if (dept==k) return 0;
			int mava = 0;
			int pos = bs._Find_first();
			while (pos<5000){
				if (bs[pos]==0) continue;
				kk=bs&arr[pos];
				mava=max(mava,f(kk,dept+1,f)+1);
				pos=bs._Find_next(pos);
			}
			return mava;
		};
		cout<<f(full,0,f)<<endl;
	}
}

Compilation message

politicaldevelopment.cpp:1: warning: ignoring '#pragma optimize ' [-Wunknown-pragmas]
    1 | #pragma optimize("Bismillahirrahmanirrahim")
      |

Subtask #1
4.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 7 ms 6484 KB Output is correct
4 Correct 7 ms 6484 KB Output is correct
5 Correct 6 ms 6484 KB Output is correct
6 Correct 7 ms 6484 KB Output is correct
7 Correct 8 ms 6564 KB Output is correct
8 Correct 4 ms 6484 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 5 ms 6484 KB Output is correct

Subtask #2
0 / 12.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 7 ms 6484 KB Output is correct
4 Correct 7 ms 6484 KB Output is correct
5 Correct 6 ms 6484 KB Output is correct
6 Correct 7 ms 6484 KB Output is correct
7 Correct 8 ms 6564 KB Output is correct
8 Correct 4 ms 6484 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 5 ms 6484 KB Output is correct
11 Correct 6 ms 6484 KB Output is correct
12 Incorrect 8 ms 6484 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #3
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 6484 KB Output is correct
2 Incorrect 1 ms 340 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 38.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 7 ms 6484 KB Output is correct
4 Correct 7 ms 6484 KB Output is correct
5 Correct 6 ms 6484 KB Output is correct
6 Correct 7 ms 6484 KB Output is correct
7 Correct 8 ms 6564 KB Output is correct
8 Correct 4 ms 6484 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 5 ms 6484 KB Output is correct
11 Correct 6 ms 6484 KB Output is correct
12 Incorrect 8 ms 6484 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #5
0 / 23.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 7 ms 6484 KB Output is correct
4 Correct 7 ms 6484 KB Output is correct
5 Correct 6 ms 6484 KB Output is correct
6 Correct 7 ms 6484 KB Output is correct
7 Correct 8 ms 6564 KB Output is correct
8 Correct 4 ms 6484 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 5 ms 6484 KB Output is correct
11 Correct 6 ms 6484 KB Output is correct
12 Incorrect 8 ms 6484 KB Output isn't correct
13 Halted 0 ms 0 KB -