oj.uz

답안 #639869

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
639869 2022-09-12T14:31:32 Z Vladth11 Norela (info1cup18_norela) C++14
100 / 100
 77 ms 131668 KB 
#include <bits/stdc++.h>
#define debug(x) cerr << #x << " " << x << "\n"
#define debugs(x) cerr << #x << " " << x << " "
 
using namespace std;
typedef long long ll;
typedef pair <int, int> pii;
typedef pair <long double, pii> muchie;
 
const ll NMAX = 25;
const ll VMAX = 101;
const ll INF = 2e9;
const ll MOD = 1000000007;
const ll BLOCK = 447;
const ll base = 117;
const ll nr_of_bits = 24;
const ll inv2 = 500000004;
 
int n, m;
 
ll spell[NMAX];
ll dp[(1 << 24)];
ll all = 0;
int bit[(1 << 24)];
 
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int i;
    cin >> n >> m;
    for(i = 0; i < n; i++)
        all |= (1LL << i);
    for(i = 1; i <= m; i++){
        int q;
        cin >> q;
        while(q--){
            int x;
            cin >> x;
            x--;
            spell[i - 1] |= (1LL << x);
        }
    }
    dp[0] = 0;
    int minim = 2e9, maxim = -1;
    for(int j = 0; j < m; j++){
        bit[(1 << j)] = j;
    }
    for(int i = 1; i < (1 << m); i++){
        int j = i & (-i);
        if(j != 0){
            dp[i] = dp[i ^ j] ^ spell[bit[j]];
        }
        if(dp[i] == all){
            if(minim > __builtin_popcount(i)){
                minim = __builtin_popcount(i);
                maxim = i;
            }else if(minim == __builtin_popcount(i)){
                for(int j = 0; j < m; j++){
                    int bitI = i & (1 << j);
                    int bitM = maxim & (1 << j);
                    if(bitI == bitM) continue;
                    if(bitI > bitM){
                        maxim = i;
                    }
                    break;
                }
            }
        }
    }
    cout << minim << "\n";
    for(i = 0; i < n; i++){
        if(maxim & (1LL << i)){
            cout << i + 1 << " ";
        }
    }
    return 0;
}

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2388 KB Output is correct
2 Correct 2 ms 2388 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 2388 KB Output is correct
5 Correct 2 ms 2388 KB Output is correct
6 Correct 2 ms 2388 KB Output is correct

Subtask #2
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2388 KB Output is correct
2 Correct 2 ms 2388 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 2388 KB Output is correct
5 Correct 2 ms 2388 KB Output is correct
6 Correct 2 ms 2388 KB Output is correct
7 Correct 5 ms 8532 KB Output is correct
8 Correct 12 ms 16740 KB Output is correct
9 Correct 13 ms 16724 KB Output is correct
10 Correct 10 ms 16724 KB Output is correct
11 Correct 10 ms 16696 KB Output is correct

Subtask #3
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2388 KB Output is correct
2 Correct 2 ms 2388 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 2388 KB Output is correct
5 Correct 2 ms 2388 KB Output is correct
6 Correct 2 ms 2388 KB Output is correct
7 Correct 5 ms 8532 KB Output is correct
8 Correct 12 ms 16740 KB Output is correct
9 Correct 13 ms 16724 KB Output is correct
10 Correct 10 ms 16724 KB Output is correct
11 Correct 10 ms 16696 KB Output is correct
12 Correct 10 ms 16696 KB Output is correct
13 Correct 19 ms 33144 KB Output is correct
14 Correct 19 ms 33108 KB Output is correct
15 Correct 20 ms 33148 KB Output is correct
16 Correct 19 ms 33120 KB Output is correct
17 Correct 19 ms 33148 KB Output is correct

Subtask #4
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2388 KB Output is correct
2 Correct 2 ms 2388 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 2388 KB Output is correct
5 Correct 2 ms 2388 KB Output is correct
6 Correct 2 ms 2388 KB Output is correct
7 Correct 5 ms 8532 KB Output is correct
8 Correct 12 ms 16740 KB Output is correct
9 Correct 13 ms 16724 KB Output is correct
10 Correct 10 ms 16724 KB Output is correct
11 Correct 10 ms 16696 KB Output is correct
12 Correct 10 ms 16696 KB Output is correct
13 Correct 19 ms 33144 KB Output is correct
14 Correct 19 ms 33108 KB Output is correct
15 Correct 20 ms 33148 KB Output is correct
16 Correct 19 ms 33120 KB Output is correct
17 Correct 19 ms 33148 KB Output is correct
18 Correct 37 ms 65992 KB Output is correct
19 Correct 39 ms 66044 KB Output is correct
20 Correct 73 ms 131668 KB Output is correct
21 Correct 77 ms 131660 KB Output is correct
22 Correct 75 ms 131620 KB Output is correct
23 Correct 75 ms 131668 KB Output is correct