oj.uz

답안 #957840

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
957840 2024-04-04T11:41:36 Z ono_de206 Mensza (COI22_mensza) C++17
0 / 100
 2610 ms 58724 KB 
#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;
			for(int i = 0; i < 20; i++) {
				if(a >> i & 1) ans.pb(i * 2);
				else ans.pb(i * 2 + 1);
			}
			cout << ans.size() << ' ' << ans << endl;
		} else if(str[0] == 'b') {
			int b;
			cin >> b;
			vector<int> ans;
			for(int i = 0; i < 20; i++) {
				if(b >> i & 1) ans.pb(i * 2 + 1);
				else ans.pb(i * 2);
			}
			cout << ans.size() << ' ' << ans << endl;
		} else {
			int x;
			cin >> x;
			vector<vector<int>> a(20, vector<int>(2, 0));
			while(x--) {
				int p;
				cin >> p;
				a[p / 2][p % 2] = 1;
			}
			for(int i = 19; i >= 0; i--) {
				if(a[i][0] == 1 && a[i][1] == 0) {
					cout << "A\n";
					break;
				}
				if(a[i][0] == 0 && a[i][1] == 1) {
					cout << "B\n";
					break;
				}
			}
		}
	}
}

signed main() {
	fast;
	int t = 1;
	// cin >> t;
	while(t--) {
		go();
	}
	return 0;
}

Subtask #1
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 20 ms 820 KB Wrong answer on query 1: expected B, found A
2 Halted 0 ms 0 KB -

Subtask #2
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1849 ms 2896 KB Wrong answer on query 1: expected B, found A
2 Halted 0 ms 0 KB -

Subtask #3
0 / 66.0

# 결과 실행 시간 메모리 Grader output
1 Failed 2610 ms 58724 KB Input processor failed - contact admins or jury
2 Halted 0 ms 0 KB -