#include<bits/stdc++.h>
using namespace std;
#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define in insert
#define all(x) x.begin(),x.end()
#define pb push_back
#define eb emplace_back
#define ff first
#define ss second
// #define int long long
typedef long long ll;
typedef vector<int> vi;
typedef set<int> si;
typedef multiset<int> msi;
typedef pair<int, int> pii;
typedef vector<pii> vpii;
// typedef pair<int, int> P;
template<typename T, typename U>
ostream & operator << (ostream &out, const pair<T, U> &c) {
out << c.first << ' ' << c.second;
return out;
}
template<typename T>
ostream & operator << (ostream &out, vector<T> &v) {
const int sz = v.size();
for (int i = 0; i < sz; i++) {
if (i) out << ' ';
out << v[i];
}
return out;
}
template<typename T>
istream & operator >> (istream &in, vector<T> &v) {
for (T &x : v) in >> x;
return in;
}
template<typename T, typename U>
istream & operator >> (istream &in, pair<T, U> &c) {
in >> c.first;
in >> c.second;
return in;
}
template<typename T>
void mxx(T &a, T b){if(b > a) a = b;}
template<typename T>
void mnn(T &a, T b){if(b < a) a = b;}
const int mxn = 1e5 + 10, MXLOG = 22, mod = 1e9 + 7, P = 1181, D = 1523, N = 2500;
const long long inf = 2e18 + 10;
int p[mxn];
void go() {
int n, q;
cin >> n >> q;
while(q--) {
string str;
cin >> str;
if(str[0] == 'a') {
int a;
cin >> a;
vector<int> ans;
int now = 0;
for(int i = 19; i >= 0; i--) {
if((a >> i) & 1) {
now |= (1 << i);
ans.pb(now);
}
}
cout << ans.size() << ' ' << ans << endl;
} else if(str[0] == 'b') {
int b;
cin >> b;
vector<int> ans;
int now = 0;
for(int i = 19; i >= 0; i--) {
if((b >> i) & 1) {
now |= (1 << i);
} else {
ans.pb(now | (1 << i));
}
}
cout << ans.size() << ' ' << ans << endl;
} else {
int x;
cin >> x;
int a;
while(x--) {
cin >> a;
}
if(a == 2) cout << "A\n";
else cout << "B\n";
}
}
}
signed main() {
fast;
int t = 1;
// cin >> t;
while(t--) {
go();
}
return 0;
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
9 ms |
788 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
830 ms |
3016 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
2915 ms |
145360 KB |
Output is correct |
