oj.uz

Submission #959166

# Submission time Handle Problem Language Result Execution time Memory
959166 2024-04-07T14:30:51 Z Ariadna Geppetto (COCI15_geppetto) C++14
80 / 80
 89 ms 4544 KB 
#include <bits/stdc++.h>

using namespace std;

int pizzas(int n, vector<vector<int>>& mixing) {
    priority_queue<int> pq;
    vector<int> visited(1<<n, 0);
    pq.push(0);
    int ans = 1;
    while (!pq.empty()) {
        int mask = pq.top();
        pq.pop();

        for (int i = 0; i < n; ++i) {
            if (mask & (1<<i) || visited[mask | (1<<i)]) continue;
            bool control = true;
            for (int j = 0; j < n; ++j) {
                if ((mask & (1<<j)) && mixing[i][j]) control = false;
            }
            int new_mask = mask | (1<<i);
            if (control) {
                ++ans;
                pq.push(new_mask);
            }
            visited[new_mask] = 1;
        }
    }
    return ans;
}

int main() {
    int n, m;
    cin >> n >> m;
    vector<vector<int>> mixing(n, vector<int>(n, 0));

    while (m--) {
        int a, b;
        cin >> a >> b;
        --a; --b;
        mixing[a][b] = mixing[b][a] = 1;
    }
    cout << pizzas(n, mixing) << '\n';

    return 0;
}

Subtask #1
80.0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 2 ms 4440 KB Output is correct
4 Correct 2 ms 4440 KB Output is correct
5 Correct 2 ms 4444 KB Output is correct
6 Correct 2 ms 4444 KB Output is correct
7 Correct 3 ms 4444 KB Output is correct
8 Correct 3 ms 4444 KB Output is correct
9 Correct 26 ms 4544 KB Output is correct
10 Correct 89 ms 4444 KB Output is correct