oj.uz

Submission #785019

# Submission time Handle Problem Language Result Execution time Memory
785019 2023-07-16T23:22:35 Z tolbi Political Development (BOI17_politicaldevelopment) C++17
4 / 100
 15 ms 3432 KB 
#pragma optimize("Bismillahirrahmanirrahim")
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
//█▀█─█──█──█▀█─█─█
//█▄█─█──█──█▄█─█■█
//█─█─█▄─█▄─█─█─█─█
//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);
		for (int i = 0; i < n; ++i)
		{
			full[i]=1;
			deci(y);
			for (int j = 0; j < y; j++){
				deci(x);
				arr[i][x]=1;
			}
		}
		sort(arr.begin(), arr.end(), [&](bitset<5000> &a, bitset<5000> &b){
			return a.count()<b.count();
		});
		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 15 ms 3412 KB Output is correct
4 Correct 12 ms 3428 KB Output is correct
5 Correct 11 ms 3412 KB Output is correct
6 Correct 12 ms 3412 KB Output is correct
7 Correct 12 ms 3412 KB Output is correct
8 Correct 10 ms 3412 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 10 ms 3412 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 15 ms 3412 KB Output is correct
4 Correct 12 ms 3428 KB Output is correct
5 Correct 11 ms 3412 KB Output is correct
6 Correct 12 ms 3412 KB Output is correct
7 Correct 12 ms 3412 KB Output is correct
8 Correct 10 ms 3412 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 10 ms 3412 KB Output is correct
11 Correct 11 ms 3412 KB Output is correct
12 Incorrect 13 ms 3412 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #3
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 3432 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 15 ms 3412 KB Output is correct
4 Correct 12 ms 3428 KB Output is correct
5 Correct 11 ms 3412 KB Output is correct
6 Correct 12 ms 3412 KB Output is correct
7 Correct 12 ms 3412 KB Output is correct
8 Correct 10 ms 3412 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 10 ms 3412 KB Output is correct
11 Correct 11 ms 3412 KB Output is correct
12 Incorrect 13 ms 3412 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 15 ms 3412 KB Output is correct
4 Correct 12 ms 3428 KB Output is correct
5 Correct 11 ms 3412 KB Output is correct
6 Correct 12 ms 3412 KB Output is correct
7 Correct 12 ms 3412 KB Output is correct
8 Correct 10 ms 3412 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 10 ms 3412 KB Output is correct
11 Correct 11 ms 3412 KB Output is correct
12 Incorrect 13 ms 3412 KB Output isn't correct
13 Halted 0 ms 0 KB -