Submission #785010

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
785010	2023-07-16T22:42:46 Z	tolbi	Political Development (BOI17_politicaldevelopment)	C++17	16 / 100	3000 ms	65436 KB

politicaldevelopment

#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 int long long
#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 INF = LONG_LONG_MAX;
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;
			}
		}
		bitset<5000> kk;
		auto f = [&](bitset<5000> bs, int dept, auto f)->int{
			if (dept==k) return 0;
			int mava = 0;
			for (int i = 0; i < n; i++){
				if (bs[i]==0) continue;
				kk=bs&arr[i];
				mava=max(mava,f(kk,dept+1,f)+1);
			}
			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	0 ms	212 KB	Output is correct
3	Correct	37 ms	3412 KB	Output is correct
4	Correct	36 ms	3412 KB	Output is correct
5	Correct	37 ms	3412 KB	Output is correct
6	Correct	41 ms	3412 KB	Output is correct
7	Correct	37 ms	3412 KB	Output is correct
8	Correct	35 ms	3412 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	52 ms	3412 KB	Output is correct

Subtask #2
12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	37 ms	3412 KB	Output is correct
4	Correct	36 ms	3412 KB	Output is correct
5	Correct	37 ms	3412 KB	Output is correct
6	Correct	41 ms	3412 KB	Output is correct
7	Correct	37 ms	3412 KB	Output is correct
8	Correct	35 ms	3412 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	52 ms	3412 KB	Output is correct
11	Correct	37 ms	3412 KB	Output is correct
12	Correct	108 ms	3412 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	96 ms	3412 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	97 ms	3412 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Correct	98 ms	3412 KB	Output is correct
19	Correct	35 ms	3400 KB	Output is correct
20	Correct	66 ms	3412 KB	Output is correct
21	Correct	66 ms	3412 KB	Output is correct
22	Correct	36 ms	3412 KB	Output is correct
23	Correct	113 ms	3412 KB	Output is correct
24	Correct	35 ms	3400 KB	Output is correct
25	Correct	116 ms	3412 KB	Output is correct
26	Correct	108 ms	3412 KB	Output is correct
27	Correct	97 ms	3408 KB	Output is correct
28	Correct	105 ms	3412 KB	Output is correct
29	Correct	97 ms	3412 KB	Output is correct
30	Correct	117 ms	3404 KB	Output is correct
31	Correct	118 ms	3408 KB	Output is correct
32	Correct	130 ms	3408 KB	Output is correct
33	Correct	118 ms	3412 KB	Output is correct
34	Correct	139 ms	3408 KB	Output is correct
35	Correct	31 ms	1876 KB	Output is correct
36	Correct	32 ms	1868 KB	Output is correct
37	Correct	31 ms	1876 KB	Output is correct
38	Correct	11 ms	1108 KB	Output is correct
39	Correct	11 ms	1128 KB	Output is correct
40	Correct	159 ms	3540 KB	Output is correct
41	Correct	11 ms	1108 KB	Output is correct
42	Correct	166 ms	3412 KB	Output is correct
43	Correct	159 ms	3412 KB	Output is correct

Subtask #3
0 / 23.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	35 ms	3412 KB	Output is correct
2	Correct	0 ms	340 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	328 KB	Output is correct
5	Correct	1 ms	324 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	324 KB	Output is correct
8	Correct	1 ms	324 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	1 ms	340 KB	Output is correct
11	Runtime error	75 ms	65436 KB	Execution killed with signal 11
12	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	0 ms	212 KB	Output is correct
3	Correct	37 ms	3412 KB	Output is correct
4	Correct	36 ms	3412 KB	Output is correct
5	Correct	37 ms	3412 KB	Output is correct
6	Correct	41 ms	3412 KB	Output is correct
7	Correct	37 ms	3412 KB	Output is correct
8	Correct	35 ms	3412 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	52 ms	3412 KB	Output is correct
11	Correct	37 ms	3412 KB	Output is correct
12	Correct	108 ms	3412 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	96 ms	3412 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	97 ms	3412 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Correct	98 ms	3412 KB	Output is correct
19	Correct	35 ms	3400 KB	Output is correct
20	Correct	66 ms	3412 KB	Output is correct
21	Correct	66 ms	3412 KB	Output is correct
22	Correct	36 ms	3412 KB	Output is correct
23	Correct	113 ms	3412 KB	Output is correct
24	Correct	35 ms	3400 KB	Output is correct
25	Correct	116 ms	3412 KB	Output is correct
26	Correct	108 ms	3412 KB	Output is correct
27	Correct	97 ms	3408 KB	Output is correct
28	Correct	105 ms	3412 KB	Output is correct
29	Correct	97 ms	3412 KB	Output is correct
30	Correct	117 ms	3404 KB	Output is correct
31	Correct	118 ms	3408 KB	Output is correct
32	Correct	130 ms	3408 KB	Output is correct
33	Correct	118 ms	3412 KB	Output is correct
34	Correct	139 ms	3408 KB	Output is correct
35	Correct	31 ms	1876 KB	Output is correct
36	Correct	32 ms	1868 KB	Output is correct
37	Correct	31 ms	1876 KB	Output is correct
38	Correct	11 ms	1108 KB	Output is correct
39	Correct	11 ms	1128 KB	Output is correct
40	Correct	159 ms	3540 KB	Output is correct
41	Correct	11 ms	1108 KB	Output is correct
42	Correct	166 ms	3412 KB	Output is correct
43	Correct	159 ms	3412 KB	Output is correct
44	Execution timed out	3060 ms	3540 KB	Time limit exceeded
45	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	0 ms	212 KB	Output is correct
3	Correct	37 ms	3412 KB	Output is correct
4	Correct	36 ms	3412 KB	Output is correct
5	Correct	37 ms	3412 KB	Output is correct
6	Correct	41 ms	3412 KB	Output is correct
7	Correct	37 ms	3412 KB	Output is correct
8	Correct	35 ms	3412 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	52 ms	3412 KB	Output is correct
11	Correct	37 ms	3412 KB	Output is correct
12	Correct	108 ms	3412 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	96 ms	3412 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	97 ms	3412 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Correct	98 ms	3412 KB	Output is correct
19	Correct	35 ms	3400 KB	Output is correct
20	Correct	66 ms	3412 KB	Output is correct
21	Correct	66 ms	3412 KB	Output is correct
22	Correct	36 ms	3412 KB	Output is correct
23	Correct	113 ms	3412 KB	Output is correct
24	Correct	35 ms	3400 KB	Output is correct
25	Correct	116 ms	3412 KB	Output is correct
26	Correct	108 ms	3412 KB	Output is correct
27	Correct	97 ms	3408 KB	Output is correct
28	Correct	105 ms	3412 KB	Output is correct
29	Correct	97 ms	3412 KB	Output is correct
30	Correct	117 ms	3404 KB	Output is correct
31	Correct	118 ms	3408 KB	Output is correct
32	Correct	130 ms	3408 KB	Output is correct
33	Correct	118 ms	3412 KB	Output is correct
34	Correct	139 ms	3408 KB	Output is correct
35	Correct	31 ms	1876 KB	Output is correct
36	Correct	32 ms	1868 KB	Output is correct
37	Correct	31 ms	1876 KB	Output is correct
38	Correct	11 ms	1108 KB	Output is correct
39	Correct	11 ms	1128 KB	Output is correct
40	Correct	159 ms	3540 KB	Output is correct
41	Correct	11 ms	1108 KB	Output is correct
42	Correct	166 ms	3412 KB	Output is correct
43	Correct	159 ms	3412 KB	Output is correct
44	Correct	1 ms	212 KB	Output is correct
45	Runtime error	69 ms	64504 KB	Execution killed with signal 11
46	Halted	0 ms	0 KB	-

Submission #785010

Compilation message

Subtask #1 4.0 / 4.0

Subtask #2 12.0 / 12.0

Subtask #3 0 / 23.0

Subtask #4 0 / 38.0

Subtask #5 0 / 23.0

Subtask #1
4.0 / 4.0

Subtask #2
12.0 / 12.0

Subtask #3
0 / 23.0

Subtask #4
0 / 38.0

Subtask #5
0 / 23.0