제출 #1182446

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1182446		thieunguyenhuy	Mensza (COI22_mensza)	C++20	0 / 100	729 ms	72376 KiB

Main

#include <bits/stdc++.h>
using namespace std;

#define POPCOUNT(n) (__builtin_popcountll((n)))
#define CLZ(n) (__builtin_clzll((n)))
#define CTZ(n) (__builtin_ctzll((n)))
#define LOG(n) (63 - __builtin_clzll((n)))
#define BIT(n, i) (((n) >> (i)) & 1ll)
#define MASK(i) (1ll << (i))
#define FLIP(n, i) ((n) ^ (1ll << (i)))
#define ON(n, i) ((n) | MASK(i))
#define OFF(n, i) ((n) & ~MASK(i))

#define Int __int128
#define fi first
#define se second

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
typedef pair<long long, int> pli;
typedef pair<int, long long> pil;
typedef vector<pair<int, int>> vii;
typedef vector<pair<long long, long long>> vll;
typedef vector<pair<long long, int>> vli;
typedef vector<pair<int, long long>> vil;

template <class T1, class T2> bool maximize(T1 &x, T2 y) {
    if (x < y) {
        x = y;
        return true;
    }
    return false;
}
template <class T1, class T2> bool minimize(T1 &x, T2 y) {
    if (x > y) {
        x = y;
        return true;
    }
    return false;
}

template <class T> void remove_duplicate(vector<T> &ve) {
    sort (ve.begin(), ve.end());
    ve.resize(unique(ve.begin(), ve.end()) - ve.begin());
}

mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
template <class T1, class T2> T1 random(T1 l, T2 r) {
    return uniform_int_distribution<T1>(l, r)(rng);
}
template <class T> T random(T r) {
    return rng() % r;
}

const int N = 1e6 + 5, LG = 20;
const int MOD = 1e9 + 7;
const int inf = 1e9;
const long long INF = 1e18;

int L;

void solve() {
	string who; cin >> who;

	if (who == "alojzije") {
		int A; cin >> A;
		vector<int> ans; int num = 0;
		for (int i = LG - 1; i >= 0; --i) {
			if (BIT(A, i)) num += MASK(i), ans.emplace_back(num);
		}

		cout << ans.size() << ' ';
		for (auto &x : ans) cout << x << ' ';
		cout << '\n';
	}
	else if (who == "benjamin") {
		int B; cin >> B;
		vector<int> ans; int num = 0;
		for (int i = LG - 1; i >= 0; --i) {
			if (!BIT(B, i)) ans.emplace_back(ON(num, i));
			else num += MASK(i);
		}

		cout << ans.size() << ' ';
		for (auto &x : ans) cout << x << ' ';
		cout << '\n';
	}
	else {
		int lc; cin >> lc;
		vector<int> val(lc);
		for (auto &x : val) cin >> x;
		if (val.back() == 2) cout << "A\n";
		else cout << "B\n";
	}
}

signed main() {
    ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);

    cin >> L;
    int t; cin >> t;
    while (t--) solve();

    return 0;
}

• Subtask 1: 0 / 11
• Subtask 2: 0 / 23
• Subtask 3: 0 / 66