oj.uz

Submission #1093938

# Submission time Handle Problem Language Result Execution time Memory
1093938 2024-09-28T06:20:04 Z 0pt1mus23 Sob (COCI19_sob) C++14
110 / 110
 59 ms 18864 KB 
#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.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 31 ms 9724 KB Output is correct

Subtask #2
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 31 ms 10288 KB Output is correct
7 Correct 15 ms 5088 KB Output is correct

Subtask #3
39.0 / 39.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct

Subtask #4
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 31 ms 9724 KB Output is correct
5 Correct 1 ms 600 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 31 ms 10288 KB Output is correct
11 Correct 15 ms 5088 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 344 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 7 ms 2276 KB Output is correct
20 Correct 24 ms 7756 KB Output is correct
21 Correct 2 ms 600 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 36 ms 11348 KB Output is correct
24 Correct 59 ms 18864 KB Output is correct
25 Correct 57 ms 18616 KB Output is correct