Submission #496071

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
496071	2021-12-20T14:01:31 Z	ktkerem	Sob (COCI19_sob)	C++17	110 / 110	70 ms	7156 KB

sob

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef __int128 vll;
typedef unsigned __int128 uvll;
ll _i=0;
#define ffn(x) _i=x
#define llll pair<ll , ll>
#define stitr set<ll>::iterator
#define fora(y,x) for(ll y=_i;x>y;y++)
#define pb push_back
#define pf push_front
#define debu cout << "hello\n"
#define fi first
#define sec second
#define all(a) a.begin() , a.end()
const ll limit = 1e13 + 7; 
const ll ous=1e5 + 5;
const ll dx[4] = {0 , -1 , 1 , 0} , dy[4] = {1,0,0,-1};
void solve(){
    ll n , m;cin >> n >> m;
    for(ll i = n-1 , l = m;i>=0;){
        for(ll j = l;j<n+m;++j){
            if((i&j) == i){
                ll o = j;
                while(o>=l && ((o&i) == i)){
                    cout << i <<" " << o << "\n";
                    --i;--o;
                }
                l = j+1;
                break;
            }
        }
    }
    return;/**/
}
signed main(){
    ios_base::sync_with_stdio(false);cin.tie(NULL);
    ll t=1;
    //cin >> t;
    while(t--){
        solve();
    }
    return 0; 
}

Subtask #1

10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	316 KB	Output is correct
2	Correct	1 ms	204 KB	Output is correct
3	Correct	1 ms	404 KB	Output is correct
4	Correct	35 ms	3864 KB	Output is correct

Subtask #2

29.0 / 29.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	296 KB	Output is correct
2	Correct	1 ms	204 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	0 ms	204 KB	Output is correct
6	Correct	35 ms	3748 KB	Output is correct
7	Correct	18 ms	1868 KB	Output is correct

Subtask #3

39.0 / 39.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	312 KB	Output is correct
2	Correct	1 ms	208 KB	Output is correct
3	Correct	1 ms	208 KB	Output is correct
4	Correct	1 ms	208 KB	Output is correct
5	Correct	1 ms	208 KB	Output is correct
6	Correct	1 ms	324 KB	Output is correct
7	Correct	1 ms	208 KB	Output is correct

Subtask #4

32.0 / 32.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	316 KB	Output is correct
2	Correct	1 ms	204 KB	Output is correct
3	Correct	1 ms	404 KB	Output is correct
4	Correct	35 ms	3864 KB	Output is correct
5	Correct	2 ms	296 KB	Output is correct
6	Correct	1 ms	204 KB	Output is correct
7	Correct	0 ms	204 KB	Output is correct
8	Correct	1 ms	204 KB	Output is correct
9	Correct	0 ms	204 KB	Output is correct
10	Correct	35 ms	3748 KB	Output is correct
11	Correct	18 ms	1868 KB	Output is correct
12	Correct	1 ms	312 KB	Output is correct
13	Correct	1 ms	208 KB	Output is correct
14	Correct	1 ms	208 KB	Output is correct
15	Correct	1 ms	208 KB	Output is correct
16	Correct	1 ms	208 KB	Output is correct
17	Correct	1 ms	324 KB	Output is correct
18	Correct	1 ms	208 KB	Output is correct
19	Correct	8 ms	908 KB	Output is correct
20	Correct	26 ms	2936 KB	Output is correct
21	Correct	2 ms	336 KB	Output is correct
22	Correct	1 ms	320 KB	Output is correct
23	Correct	38 ms	4152 KB	Output is correct
24	Correct	64 ms	7156 KB	Output is correct
25	Correct	70 ms	7092 KB	Output is correct