oj.uz

Submission #954584

# Submission time Handle Problem Language Result Execution time Memory
954584 2024-03-28T07:40:27 Z koukirocks Political Development (BOI17_politicaldevelopment) C++17
4 / 100
 2 ms 3164 KB 
#include <bits/stdc++.h>
#define speed ios_base::sync_with_stdio(0); cin.tie(0)
#define all(x) (x).begin(),(x).end()
#define F first
#define S second
//#pragma GCC optimize("O3")
//#pragma GCC target("avx,avx2")
//#pragma GCC target("popcnt")
 
namespace{using namespace std;}
typedef long long ll;
typedef double db;
typedef long double ldb;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

const ll MAX=1e5+10,P=1e9+7;
const ll INF=0x3f3f3f3f,oo=0x3f3f3f3f3f3f3f3f;
const ldb eps=1e-6;

int n,k;
vector<int> G[MAX];
int deg[MAX];

bool findc(int lim) {
	queue<int> BFS;
	for (int i=0;i<n;i++) {
		if (deg[i]<lim-1) {
			BFS.push(i);
//			cout<<lim<<" "<<i<<" "<<deg[i]<<" i\n";
		}
	}
	int cnt=0;
	while (!BFS.empty()) {
		cnt++;
		int v=BFS.front();
		BFS.pop();
		for (int i:G[v]) {
			if (deg[i]--==lim-1) BFS.push(i);
		}
	}
	for (int i=0;i<n;i++) {
		deg[i]=G[i].size();
//		cout<<deg[i]<<" ";
	}
//	cout<<"\n";
//	cout<<lim<<" "<<cnt<<"\n";
	return (cnt!=n);
}

int main() {
	speed;
	cin>>n>>k;
	for (int i=0;i<n;i++) {
		int d;
		cin>>d;
		deg[i]=d;
		while (d--) {
			int x;
			cin>>x;
			G[i].push_back(x);
		}
	}
//	for (int i=0;i<n;i++) cout<<deg[i]<<" ";
//	cout<<"\n";
	for (int i=2;i<=k;i++) {
		if (!findc(i)) {
			cout<<i-1<<"\n";
			return 0;
		}
	}
	cout<<k<<"\n";
	return 0;
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2904 KB Output is correct
2 Correct 1 ms 2908 KB Output is correct
3 Correct 2 ms 3164 KB Output is correct
4 Correct 2 ms 3164 KB Output is correct
5 Correct 2 ms 3116 KB Output is correct
6 Correct 2 ms 3164 KB Output is correct
7 Correct 2 ms 3164 KB Output is correct
8 Correct 1 ms 2908 KB Output is correct
9 Correct 1 ms 2908 KB Output is correct
10 Correct 1 ms 2908 KB Output is correct

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2904 KB Output is correct
2 Correct 1 ms 2908 KB Output is correct
3 Correct 2 ms 3164 KB Output is correct
4 Correct 2 ms 3164 KB Output is correct
5 Correct 2 ms 3116 KB Output is correct
6 Correct 2 ms 3164 KB Output is correct
7 Correct 2 ms 3164 KB Output is correct
8 Correct 1 ms 2908 KB Output is correct
9 Correct 1 ms 2908 KB Output is correct
10 Correct 1 ms 2908 KB Output is correct
11 Correct 2 ms 3164 KB Output is correct
12 Correct 2 ms 3164 KB Output is correct
13 Incorrect 1 ms 2904 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #3
0 / 23.0

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

Subtask #4
0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2904 KB Output is correct
2 Correct 1 ms 2908 KB Output is correct
3 Correct 2 ms 3164 KB Output is correct
4 Correct 2 ms 3164 KB Output is correct
5 Correct 2 ms 3116 KB Output is correct
6 Correct 2 ms 3164 KB Output is correct
7 Correct 2 ms 3164 KB Output is correct
8 Correct 1 ms 2908 KB Output is correct
9 Correct 1 ms 2908 KB Output is correct
10 Correct 1 ms 2908 KB Output is correct
11 Correct 2 ms 3164 KB Output is correct
12 Correct 2 ms 3164 KB Output is correct
13 Incorrect 1 ms 2904 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2904 KB Output is correct
2 Correct 1 ms 2908 KB Output is correct
3 Correct 2 ms 3164 KB Output is correct
4 Correct 2 ms 3164 KB Output is correct
5 Correct 2 ms 3116 KB Output is correct
6 Correct 2 ms 3164 KB Output is correct
7 Correct 2 ms 3164 KB Output is correct
8 Correct 1 ms 2908 KB Output is correct
9 Correct 1 ms 2908 KB Output is correct
10 Correct 1 ms 2908 KB Output is correct
11 Correct 2 ms 3164 KB Output is correct
12 Correct 2 ms 3164 KB Output is correct
13 Incorrect 1 ms 2904 KB Output isn't correct
14 Halted 0 ms 0 KB -