oj.uz

Submission #489689

# Submission time Handle Problem Language Result Execution time Memory
489689 2021-11-23T23:26:44 Z JerryLiu06 Bitwise (BOI06_bitwise) C++17
100 / 100
 1 ms 204 KB 
// https://oj.uz/problem/view/BOI06_bitwise

#include <bits/stdc++.h>
 
using namespace std;
 
using ll = long long;
using ld = long double;
using db = double;
using str = string;
 
using pi = pair<int, int>;
using pl = pair<ll, ll>;
using pd = pair<db, db>;
 
using vi = vector<int>;
using vb = vector<bool>;
using vl = vector<ll>;
using vd = vector<db>;
using vs = vector<str>;
using vpi = vector<pi>;
using vpl = vector<pl>;
using vpd = vector<pd>;
 
#define FASTIO ios_base::sync_with_stdio(false); cin.tie(0);
#define FASTIOF ios_base::sync_with_stdio(false); fin.tie(0);
 
#define mp make_pair
#define f first
#define s second
 
#define sz(x) (int)(x).size()
#define bg(x) begin(x)
#define all(x) bg(x), end(x)
#define sor(x) sort(all(x))
#define rsz resize
#define ins insert 
#define ft front()
#define bk back()
#define pb push_back
#define pf push_front
 
#define lb lower_bound
#define ub upper_bound
 
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define F0R(i, a) FOR(i, 0, a)
#define ROF(i, a, b) for (int i = (b) - 1; i >= (a); i--)
#define R0F(i, a) ROF(i, 0, a)
#define EACH(a, x) for (auto& a : x)
 
ll cdiv(ll a, ll b) { return a / b + ((a ^ b) > 0 && a % b); }
ll fdiv(ll a, ll b) { return a / b - ((a ^ b) < 0 && a % b); }
 
template<class T> bool ckmin(T& a, const T& b) { return b < a ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }
 
template<class T> void remDup(vector<T>& v) { sor(v); v.erase(unique(all(v)), v.end()); }
 
const int MOD = 1e9 + 7;
const int MX = 110; 
const ll INF = 1e18;

int N, P, K[MX], A[MX], B[MX]; int sub[MX], ans = 0;

int main() {
    FASTIO;

    cin >> N >> P;

    FOR(i, 1, P + 1) {
        cin >> K[i];

        K[i] += K[i - 1];
    }
    FOR(i, 1, N + 1) {
        cin >> A[i] >> B[i];
    }
    R0F(i, 31) {
        bool possible = true;
        int curBit = (1 << i);

        FOR(j, 1, P + 1) {
            bool check = false;
            bool hasIntervalBigger = false;

            sub[j] = 0;

            FOR(k, K[j - 1] + 1, K[j] + 1) {
                if (A[k] >= curBit && B[k] >= curBit) {
                    check = hasIntervalBigger = true;
                }
                else if (B[k] >= curBit) {
                    check = true; 

                    if (B[k] > B[sub[j]]) {
                        sub[j] = k;
                    }
                }
            }
            if (!check) {
                possible = false; break;
            }
            if (hasIntervalBigger) {
                sub[j] = 0;
            }
        }
        if (possible) {
            ans += curBit;

            FOR(j, 1, P + 1) {
                if (sub[j]) {
                    A[sub[j]] = 0;
                    B[sub[j]] -= curBit;
                }
            }
        }
        FOR(j, 1, N + 1) {
            if (A[j] >= curBit && B[j] >= curBit) {
                A[j] -= curBit;
                B[j] -= curBit;
            }
            else if (B[j] >= curBit) {
                B[j] = curBit - 1;
            }
        }
    }
    cout << ans;
}

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 0 ms 204 KB Output is correct