제출 #1254055

#제출 시각아이디문제언어결과실행 시간메모리
1254055elotelo966Sob (COCI19_sob)C++20
39 / 110
408 ms18348 KiB
#include <bits/stdc++.h>
using namespace std;

#define int long long
#define OYY LLONG_MAX
#define faster ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define fi first
#define se second
#define FOR for(int i=1;i<=n;i++)
#define mid (start+end)/2
#define pb push_back
#define lim 1000005

const int mod=998244353;

int n,m;

int cev[lim];

int32_t main(){
	faster
	cin>>n>>m;
	set<int> st;
	
	FOR{
		st.insert(i-1);
	}
	
	for(int i=m;i<=m+n-1;i++){
		int x=i;
		for(int j=31;j>=0;j--){
			if((1ll<<j)&x){
				x-=(1ll<<j);
			}
			if(st.count(x)){
				//cout<<x<<" "<<i<<endl;
				cev[x]=i;
				st.erase(x);
				break;
			}
		}
	}
	
	FOR{
		cout<<i-1<<" "<<cev[i-1]<<'\n';
	}
	
	return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...