제출 #1093938

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1093938		0pt1mus23	Sob (COCI19_sob)	C++14	110 / 110	59 ms	18864 KiB

sob

#include <bits/stdc++.h>
using namespace std;
#define needforspeed ios::sync_with_stdio(0);cin.tie(0);
#define int long long int
#define pb push_back
#define ins insert
#define endl '\n'
#define putr(x) cout<<x<<endl;return;
#define all(x) x.begin(),x.end()
const int mod = 1e9 +7,sze = 1e5 +23,inf = INT_MAX, L = 23; 
//ref: https://oj.uz/submission/858556
void opt1z(){
    int n,m;
    cin>>n>>m;
    vector<int> arr,brr;
    for(int i=0;i<n;i++){
        arr.pb(i);
    }
    for(int i = n+m-1;i>=m;i--){
        brr.pb(i);
    }


    while(!arr.empty()){
        vector<int> lst;
        while((arr.back() & brr.back())!=arr.back()){
            lst.pb(brr.back());
            brr.pop_back();
        }
        lst.pb(brr.back());
        brr.pop_back();
        while(!lst.empty()){
            cout<<arr.back()<<" "<<lst.back()<<endl;
            lst.pop_back();
            arr.pop_back();
        }
    }
}
 
signed main() {
    needforspeed;

    int tt = 1;
    // cin>>tt;
    while(tt--){
        opt1z();
    }
 
    return 0;
}

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