oj.uz

답안 #1096034

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1096034 2024-10-03T15:25:23 Z _8_8_ Spring cleaning (CEOI20_cleaning) C++17
34 / 100
 1000 ms 17784 KB 
#include <bits/stdc++.h>
    
using namespace std;
    
typedef long long ll;
const int  N = 2e5 + 12, MOD = (int)1e9 + 7;
 
int n, q, rt;
ll cur = 0;
int dp[N], s[N];
vector<int> g[N];
void dfs(int v, int pr = -1) {
    s[v] = 0;
    bool is = 1;
    for(int to:g[v]) {
        if(to == pr) continue;
        is = 0;
        dfs(to, v);
        s[v] += s[to];
    }
    s[v] += (is);
}
void test() {
    cin >> n >> q;
    for(int i = 1; i <= n - 1; i++) {
        int a, b;
        cin >> a >> b;
        g[a].push_back(b);
        g[b].push_back(a);
    }
 
    for(int i = 1; i <= n; i++) {
        if((int)g[i].size() != 1) {
            rt = i;
            break;
        }
    }
    while(q--) {
        int d;
        cin >> d;
        vector<int> a(d);
        for(int j = 0; j < d; j++) {       
            cin >> a[j];
            g[a[j]].push_back(n + j + 1);
        }
        dfs(rt);
        cur = 0;
        for(int i = 1; i <= n + d; i++) {
            if(i != rt) {
                cur += (s[i] & 1 ? 1 : 2);
            }
        }
        if(s[rt] & 1) {
            cur = -1;
        }
        cout << cur << '\n';
        for(int i = 0; i < d; ++i) {
            g[a[i]].pop_back();
        }
    }
}
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0); 
 
    int t = 1; 
    // cin >> t;
    
    while(t--) 
        test();
    return 0;
}

Subtask #1
0.0 / 0.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4956 KB Output is correct
2 Execution timed out 1058 ms 6356 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #2
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 6744 KB Output is correct
2 Correct 10 ms 6748 KB Output is correct
3 Correct 20 ms 9836 KB Output is correct
4 Correct 26 ms 9744 KB Output is correct
5 Correct 33 ms 10952 KB Output is correct

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 7260 KB Output is correct
2 Correct 11 ms 7260 KB Output is correct
3 Correct 30 ms 17488 KB Output is correct
4 Correct 36 ms 17784 KB Output is correct
5 Correct 27 ms 16164 KB Output is correct

Subtask #4
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 175 ms 7252 KB Output is correct
2 Correct 98 ms 6232 KB Output is correct
3 Correct 137 ms 5976 KB Output is correct
4 Correct 206 ms 6488 KB Output is correct
5 Correct 170 ms 6748 KB Output is correct
6 Correct 225 ms 6868 KB Output is correct

Subtask #5
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1074 ms 8452 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1070 ms 10068 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #7
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4956 KB Output is correct
2 Execution timed out 1058 ms 6356 KB Time limit exceeded
3 Halted 0 ms 0 KB -