Submission #858554

#	Time	Username	Problem	Language	Result	Execution time	Memory
858554		serifefedartar	Sob (COCI19_sob)	C++17	0 / 110	1 ms	348 KiB

sob

#include <bits/stdc++.h>
using namespace std;
 
#define fast ios::sync_with_stdio(0);cin.tie(0);
#define s second
#define f first
typedef long long ll;
const ll MOD = 998244353;
const ll LOGN = 18; 
const ll INF = 1e15;
const ll MAXN = 1e6 + 5;
	
int ans[MAXN]; 
int main() {
	fast
	int N, M;
	cin >> N >> M;

	vector<int> A, B;
	for (int i = 0; i < N; i++)
		A.push_back(i);
	for (int i = M + N - 1; i >= M; i--)
		B.push_back(i);

	while (A.size()) {
		vector<int> right;
		while ((A.back() & B.back()) != A.back()) {
			right.push_back(B.back());
			B.pop_back();
		}

		// right azalan şekilde gidiyor.
		right.push_back(B.back());
		B.pop_back();

		for (auto u : right) {
			ans[A.back()] = u;
			A.pop_back();
		}
	}

	for (int i = 0; i < N; i++)
		cout << i << " " << ans[i] << "\n";
}

• Subtask 1: 0 / 10
• Subtask 2: 0 / 29
• Subtask 3: 0 / 39
• Subtask 4: 0 / 32