Submission #723197

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
723197	2023-04-13T10:13:20 Z	gagik_2007	Viruses (BOI20_viruses)	C++17	11 / 100	1 ms	332 KB

Viruses

#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <chrono>
#include <ctime>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <limits>
#include <iomanip>
#include <unordered_set>
#include <unordered_map>
#include <fstream>
#include <functional>
#include <random>
#include <cassert>
#include <climits>
using namespace std;

typedef long long ll;
typedef long double ld;

#define ff first
#define ss second

ll ttt;
const ll INF = 1e18;
const ll MOD = 1e9 + 7;
const ll N = 200007;
const ll M = 307;
const ll LG = 31;
ll n, m, k;
ll len[N];
vector<pair<int, vector<int>>>a;
vector<vector<int>>abd;

int main() {
	//freopen("in.txt", "r", stdin);
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	cin >> k >> n >> m;
	a.resize(n);
	for (int i = 0; i < n; i++) {
		int v;
		cin >> v;
		a[i].ff = v;
		a[i].ss.clear();
		int sz;
		cin >> sz;
		for (int j = 0; j < sz; j++) {
			int x;
			cin >> x;
			a[i].ss.push_back(x);
		}
	}
	abd.resize(m, vector<int>(0));
	for (int i = 0; i < m; i++) {
		int sz;
		cin >> sz;
		for (int j = 0; j < sz; j++) {
			int x;
			cin >> x;
			abd[i].push_back(x);
		}
	}
	len[0] = len[1] = 1;
	for (int v = 2; v < k; v++) {
		len[v] = -1;
	}
	for (int _ = 0; _ <= n; _++) {
		for (int i = 0; i < n; i++) {
			//cout << i << " ";
			ll cur = 0;
			bool ok = true;
			for (int v : a[i].ss) {
				//cout << v << " ";
				if (len[v] == -1) {
					ok = false;
					break;
				}
				cur += len[v];
			}
			//cout << endl;
			if (ok)
				len[a[i].ff] = min((len[a[i].ff] == -1 ? LLONG_MAX : len[a[i].ff]), cur);
		}
	}
	for (int v = 2; v < k; v++) {
		if (len[v] != -1)cout << "NO " << len[v] << endl;
		else cout << "YES\n";
	}
}

/// ---- - --------  ------ -------- -- - - -
/// Just a reminder. Ubuntu password is I O I
/// ---- - --------  ------ -------- -- - - -

Subtask #1

11.0 / 11.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	1 ms	212 KB	Output is correct
4	Correct	1 ms	212 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	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	0 ms	212 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	1 ms	212 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Correct	1 ms	324 KB	Output is correct
19	Correct	1 ms	332 KB	Output is correct
20	Correct	1 ms	212 KB	Output is correct

Subtask #2

0 / 14.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	Incorrect	1 ms	212 KB	Output isn't correct
4	Halted	0 ms	0 KB	-

Subtask #3

0 / 25.0

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

Subtask #4

0 / 32.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	1 ms	212 KB	Output is correct
4	Correct	1 ms	212 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	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	0 ms	212 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	1 ms	212 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Correct	1 ms	324 KB	Output is correct
19	Correct	1 ms	332 KB	Output is correct
20	Correct	1 ms	212 KB	Output is correct
21	Incorrect	1 ms	328 KB	Output isn't correct
22	Halted	0 ms	0 KB	-

Subtask #5

0 / 18.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	1 ms	212 KB	Output is correct
4	Correct	1 ms	212 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	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	0 ms	212 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	1 ms	212 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Correct	1 ms	324 KB	Output is correct
19	Correct	1 ms	332 KB	Output is correct
20	Correct	1 ms	212 KB	Output is correct
21	Incorrect	1 ms	212 KB	Output isn't correct
22	Halted	0 ms	0 KB	-