oj.uz

Submission #1054699

# Submission time Handle Problem Language Result Execution time Memory
1054699 2024-08-12T11:36:34 Z kiryl_krutsko Spring cleaning (CEOI20_cleaning) C++14
0 / 100
 133 ms 592 KB 

#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 / 0.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 / 9.0

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

Subtask #3
0 / 9.0

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

Subtask #4
0 / 16.0

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

Subtask #5
0 / 19.0

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

Subtask #6
0 / 17.0

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

Subtask #7
0 / 30.0

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