oj.uz

답안 #70427

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
70427 2018-08-22T21:05:00 Z MrTEK Norela (info1cup18_norela) C++14
100 / 100
 92 ms 792 KB 
#include <bits/stdc++.h>

using namespace std;
#define mp make_pair
#define pb push_back
#define len(a) (int)a.size()
#define fi first
#define sc second
#define d1(w) cerr<<#w<<":"<<w<<endl;
#define d2(w,c) cerr<<#w<<":"<<w<<" "<<#c<<":"<<c<<endl;
#define d3(w,c,z) cerr<<#w<<":"<<w<<" "<<#c<<":"<<c<<" "<<#z<<":"<<z<<endl;
#define left isc+isc
#define right isc+isc+1
#define mid (l+r)/2
#define FAfi_IO ios_base::sync_with_fidio(false);
#define escl '\n'
#define bit __builtin_popcount

typedef long long int ll;

const int maxn = 620;
const long long LINF = 1e18;
const int LOG = 31;
const int INF = 1e9;
const int N = 65;
const int M = 26;
const int SQ = 350;
const int MOD = 998244353;

typedef long long int lli;
typedef pair<int,int> pii;

vector <int> v[N];

int n,m;
ll tar,ans,a[N];

int my_min(int x,int y) {
	if (bit(x) < bit(y)) return x;
	if (bit(x) > bit(y)) return y;
	for (int i = 0 ; i < m ; i++) {
		int a = x & (1 << i) , b = y & (1 << i);
		if (a > b) return x;
		if (a < b) return y;
	}
	return x;
}

void brute(int cur,ll mask,int sum) {
	if (mask == tar) {
		ans = my_min(ans,sum);
		return;
	}
	if (cur == m) return ;
	brute(cur + 1,mask,sum);
	brute(cur + 1,mask ^ a[cur], sum + (1 << cur));
}

int main() {

	scanf("%d %d",&n,&m);
	tar = (1ll << n) - 1;
	ans = (1ll << m) - 1;
	for (int i = 0 ; i < m ; i++) {
		int q;
		scanf("%d",&q);
		for (int j = 1 ; j <= q ; j++) {
			int x;
			scanf("%d",&x);
			a[i] = a[i] ^ (1ll << (x - 1));
		}
	}
	brute(0,0,0);
	printf("%d\n",bit(ans));
	for (int i = 0 ; i < m ; i++) {
		if ((1 << i) & ans)
			printf("%d ",i + 1);
	}
}

Compilation message

norela.cpp: In function 'int main()':
norela.cpp:61:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d",&n,&m);
  ~~~~~^~~~~~~~~~~~~~~
norela.cpp:66:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d",&q);
   ~~~~~^~~~~~~~~
norela.cpp:69:9: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    scanf("%d",&x);
    ~~~~~^~~~~~~~~

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 248 KB Output is correct
2 Correct 3 ms 484 KB Output is correct
3 Correct 2 ms 484 KB Output is correct
4 Correct 4 ms 608 KB Output is correct
5 Correct 3 ms 608 KB Output is correct
6 Correct 4 ms 612 KB Output is correct

Subtask #2
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 248 KB Output is correct
2 Correct 3 ms 484 KB Output is correct
3 Correct 2 ms 484 KB Output is correct
4 Correct 4 ms 608 KB Output is correct
5 Correct 3 ms 608 KB Output is correct
6 Correct 4 ms 612 KB Output is correct
7 Correct 8 ms 612 KB Output is correct
8 Correct 12 ms 612 KB Output is correct
9 Correct 13 ms 612 KB Output is correct
10 Correct 17 ms 612 KB Output is correct
11 Correct 12 ms 612 KB Output is correct

Subtask #3
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 248 KB Output is correct
2 Correct 3 ms 484 KB Output is correct
3 Correct 2 ms 484 KB Output is correct
4 Correct 4 ms 608 KB Output is correct
5 Correct 3 ms 608 KB Output is correct
6 Correct 4 ms 612 KB Output is correct
7 Correct 8 ms 612 KB Output is correct
8 Correct 12 ms 612 KB Output is correct
9 Correct 13 ms 612 KB Output is correct
10 Correct 17 ms 612 KB Output is correct
11 Correct 12 ms 612 KB Output is correct
12 Correct 12 ms 612 KB Output is correct
13 Correct 22 ms 612 KB Output is correct
14 Correct 26 ms 712 KB Output is correct
15 Correct 23 ms 712 KB Output is correct
16 Correct 21 ms 712 KB Output is correct
17 Correct 21 ms 712 KB Output is correct

Subtask #4
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 248 KB Output is correct
2 Correct 3 ms 484 KB Output is correct
3 Correct 2 ms 484 KB Output is correct
4 Correct 4 ms 608 KB Output is correct
5 Correct 3 ms 608 KB Output is correct
6 Correct 4 ms 612 KB Output is correct
7 Correct 8 ms 612 KB Output is correct
8 Correct 12 ms 612 KB Output is correct
9 Correct 13 ms 612 KB Output is correct
10 Correct 17 ms 612 KB Output is correct
11 Correct 12 ms 612 KB Output is correct
12 Correct 12 ms 612 KB Output is correct
13 Correct 22 ms 612 KB Output is correct
14 Correct 26 ms 712 KB Output is correct
15 Correct 23 ms 712 KB Output is correct
16 Correct 21 ms 712 KB Output is correct
17 Correct 21 ms 712 KB Output is correct
18 Correct 42 ms 712 KB Output is correct
19 Correct 50 ms 764 KB Output is correct
20 Correct 92 ms 772 KB Output is correct
21 Correct 77 ms 792 KB Output is correct
22 Correct 78 ms 792 KB Output is correct
23 Correct 85 ms 792 KB Output is correct