Submission #1090241

#	Time	Username	Problem	Language	Result	Execution time	Memory
1090241		Gourougourou	Untitled (POI11_kon)	C++17	10 / 100	3072 ms	127276 KiB

Main

#include <iostream>
#include <bits/stdc++.h>
 
using namespace std;
const int MAXN = 20;
 bool adj[MAXN][MAXN];


 
int countAttackGroups(int N, int M, vector<int> &A, vector<int> &B) {
for (int i = 0; i<M; ++i) {
   adj[A[i]-1][B[i]-1] = true;
   adj[B[i]-1][A[i]-1] = true;
}
int ans = 0;
// check each group that isnt empty or all the nodes
for (int i = 1; i < (1 << N)-1; ++i) {
   vector<int> in, out;
   for (int node = 0; node < N; ++node) {
       if (i & (1 << node)) in.push_back(node);
       else out.push_back(node);
   }
   bool ok = true;
   for (int node1: in) {
       for (int node2: in) {
           if (node1 != node2) ok &= adj[node1][node2];
       }
   }
   for (int node1 : out) {
       for (int node2 : out) {
           ok &= !adj[node1][node2];
       }
   }
   if (ok) ++ans;
}
return ans;


}
 
int main() {
   ios::sync_with_stdio(0); cin.tie(0);
   int N;
   cin >> N;
   vector<int> A,B;
   A.reserve((N*(N-1))/2);
   B.reserve((N*(N-1))/2);
   for (int i = 1; i<=N; ++i) {
       int sz,a; cin >> sz;
       while (sz--) {
           cin >> a;
           if (a > i) {
               A.push_back(a);
               B.push_back(i);
           }
       }
 
   }
   cout << countAttackGroups(N, A.size(), A, B);
}

• Subtask 1: 10 / 10
• Subtask 2: 0 / 10
• Subtask 3: 0 / 10
• Subtask 4: 0 / 10
• Subtask 5: 0 / 10
• Subtask 6: 0 / 10
• Subtask 7: 0 / 10
• Subtask 8: 0 / 10
• Subtask 9: 0 / 10
• Subtask 10: 0 / 10