oj.uz

Submission #953535

# Submission time Handle Problem Language Result Execution time Memory
953535 2024-03-26T05:46:37 Z koukirocks Viruses (BOI20_viruses) C++17
0 / 100
 0 ms 348 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("avx2")
 
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=100+10,P=1e9+7;
const ll INF=0x3f3f3f3f,oo=0x3f3f3f3f3f3f3f3f;
const ldb eps=1e-6;

int g,n,m;
vector<vector<int> > GT[MAX];
ll ans[MAX];

ll dfs(int v) {
	if (ans[v]!=-1) return ans[v];
	if (GT[v].size()==0) return ans[v]=1;
	ans[v]=INF;
	for (auto st:GT[v]) {
		ll now=0;
		for (int i:st) {
			now+=dfs(i);
		}
		ans[v]=min(ans[v],now);
	}
	return ans[v];
}

int main() {
	speed;
	cin>>g>>n>>m;
	for (int i=0;i<n;i++) {
		int a,k;
		vector<int> mut;
		cin>>a>>k;
		while (k--) {
			int x;
			cin>>x;
			mut.push_back(x);
		}
		GT[a].push_back(mut);
	}
	memset(ans,-1,sizeof(ans));
	ans[0]=1;
	ans[1]=1;
	for (int i=0;i<g;i++) {
		cout<<"NO "<<dfs(i)<<"\n";
	}
	return 0;
}

Subtask #1
0 / 11.0

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

Subtask #2
0 / 14.0

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

Subtask #3
0 / 25.0

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

Subtask #4
0 / 32.0

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

Subtask #5
0 / 18.0

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