Submission #1054699

#	Time	Username	Problem	Language	Result	Execution time	Memory
1054699		kiryl_krutsko	Spring cleaning (CEOI20_cleaning)	C++14	0 / 100	133 ms	592 KiB

cleaning

#include <iostream>
#include <vector>

using namespace std;

struct node {
	int num;
	vector<int> conns;
};

int main()
{
	int n, q;
	cin >> n >> q;
	//vector<node> vec(n);
	int a, b; 
	//vec[0].num = 0;
	for (int i = 1; i < n; i++) {
		//vec[i].num = i;
		cin >> a >> b;
		a--; b--;
		//vec[a].conns.push_back(b);
		//vec[b].conns.push_back(a);
	}
	int new_num;
	for (int i = 0; i < q; i++) {
		cin >> new_num;
		for (int j = 0; j < new_num; j++) {
			cin >> a;
		}
		if ((n - 1) % 2 == 1) {
			cout << "-1";
		}
		else cout << n - 1 + new_num;
	}
}

• Subtask 1: 0 / 0
• Subtask 2: 0 / 9
• Subtask 3: 0 / 9
• Subtask 4: 0 / 16
• Subtask 5: 0 / 19
• Subtask 6: 0 / 17
• Subtask 7: 0 / 30