oj.uz

Submission #1095964

# Submission time Handle Problem Language Result Execution time Memory
1095964 2024-10-03T13:25:01 Z _8_8_ Spring cleaning (CEOI20_cleaning) C++17
34 / 100
 1000 ms 23636 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];
vector<int> g[N];
void dfs(int v, int pr = -1) {
    dp[v] = 0;
    bool is = 1;
    vector<int> c(2, 0);
    for(int to:g[v]) {
        if(to == pr) continue;
        is = 0;
        dfs(to, v);
        c[dp[to]]++;
    }
    if(is) {
        dp[v] = 1;
        return;
    }
    cur += c[0] * 2 + c[1];
    dp[v] = c[1] % 2;
}
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--) {
        cur =0 ;
        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);
        if(dp[rt]) {
            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

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4952 KB Output is correct
2 Execution timed out 1050 ms 6236 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 6748 KB Output is correct
2 Correct 11 ms 6716 KB Output is correct
3 Correct 20 ms 9684 KB Output is correct
4 Correct 30 ms 9680 KB Output is correct
5 Correct 45 ms 10952 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 7512 KB Output is correct
2 Correct 13 ms 7512 KB Output is correct
3 Correct 46 ms 23636 KB Output is correct
4 Correct 55 ms 23124 KB Output is correct
5 Correct 31 ms 21844 KB Output is correct

Subtask #4
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 350 ms 7904 KB Output is correct
2 Correct 182 ms 6232 KB Output is correct
3 Correct 247 ms 5936 KB Output is correct
4 Correct 332 ms 7004 KB Output is correct
5 Correct 294 ms 7256 KB Output is correct
6 Correct 341 ms 7272 KB Output is correct

Subtask #5
0 / 19.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1018 ms 8528 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1069 ms 10064 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #7
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4952 KB Output is correct
2 Execution timed out 1050 ms 6236 KB Time limit exceeded
3 Halted 0 ms 0 KB -