oj.uz

답안 #139626

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
139626 2019-08-01T07:55:24 Z gs14004 Bitwise (BOI06_bitwise) C++17
100 / 100
 3 ms 376 KB 
#include <bits/stdc++.h>
using namespace std;
using pi = pair<int, int>;
const int MAXN = 305;

int n, m;
int l[MAXN], r[MAXN];
vector<int> pos[MAXN];

bool good(vector<int> &pos, int msk){
	vector<int> choice[32];
	for(auto &i : pos){
		if(l[i] == r[i]){
			msk &= ~l[i];
			continue;
		}
		int j = 30;
		while((l[i] >> j) == (r[i] >> j)) j--;
		int val = (l[i] >> (j + 1)) << (j + 1);
		msk &= ~val;
		choice[j].push_back(r[i] - val);
	}
	priority_queue<pi> pq;
	for(int i = 30; i >= 0; i--){
		for(auto &j : choice[i]) pq.emplace(i, j);
		if((msk >> i) & 1){
			if(pq.empty()) return 0;
			auto x = pq.top(); pq.pop();
			if(x.first > i){
				return 1;
			}
			msk ^= (1 << i);
			x.second ^= (1 << i);
			int pos = i;
			if(x.second > 0){
				while((x.second >> pos) == 0) pos--;
				choice[pos].push_back(x.second);
			}
		}
	}
	return 1;
}

bool good(int msk){
	for(int i=0; i<m; i++){
		if(!good(pos[i], msk)) return 0;
	}
	return 1;
}

int main(){
	scanf("%d %d",&n,&m);
	int cur = 0;
	for(int i=0; i<m; i++){
		int x; cin >> x;
		pos[i].resize(x);
		iota(pos[i].begin(), pos[i].end(), cur);
		cur += x;
	}
	for(int i=0; i<n; i++) cin >> l[i] >> r[i];
	int ans = 0;
	for(int i=30; i>=0; i--){
		if(good(ans | (1 << i))) ans |= (1 << i);
	}
	cout << ans << endl;
}

Compilation message

bitwise.cpp: In function 'int main()':
bitwise.cpp:52:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d",&n,&m);
  ~~~~~^~~~~~~~~~~~~~~

Subtask #1
100.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 252 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 296 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 256 KB Output is correct
13 Correct 2 ms 256 KB Output is correct
14 Correct 2 ms 256 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 256 KB Output is correct
17 Correct 2 ms 256 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 3 ms 376 KB Output is correct
20 Correct 3 ms 376 KB Output is correct