Submission #498086

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
498086	2021-12-24T11:34:03 Z	asandikci	Sob (COCI19_sob)	C++17	110 / 110	82 ms	7156 KB

sob

#include"iostream"
// #include"vector"
// #include"queue"
// #include"deque"
// #include"set"
// #include"map"
// #include"algorithm"
// #include"iomanip"
// #include"cstring"
// #include"cmath"
// #include"bitset"
// #define int long long
// __LINE__
using namespace std;  

void solve(){
  int n,m;
  cin >> n >> m;
  int last=m;
  for(int i=n-1;i>=0;){
    for(int j=last;last<n+m;j++){
      if((i&j)==i){
        int tmp = j;
        while(tmp>=last && (tmp&i)==i){
          cout << i << " " << tmp << "\n";
          i--;
          tmp--;
        }
        last=j+1;
        break;
      }
    }
  }

}

signed main(){
  ios::sync_with_stdio(false); cin.tie(0);
  // freopen("","r",stdin);freopen("","w",stdout);
  int t=1;
  // cin >> t;
  for(int i=1;i<=t;i++){
    // cout << "Case " << i << ":\n";
    solve();
    // cout <<"\n\n";
  }
}

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	0 ms	312 KB	Output is correct
4	Correct	39 ms	3768 KB	Output is correct

Subtask #2

29.0 / 29.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	332 KB	Output is correct
2	Correct	1 ms	204 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Correct	52 ms	3804 KB	Output is correct
7	Correct	19 ms	1868 KB	Output is correct

Subtask #3

39.0 / 39.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	324 KB	Output is correct
2	Correct	1 ms	204 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Correct	0 ms	204 KB	Output is correct
6	Correct	0 ms	216 KB	Output is correct
7	Correct	1 ms	216 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	0 ms	312 KB	Output is correct
4	Correct	39 ms	3768 KB	Output is correct
5	Correct	1 ms	332 KB	Output is correct
6	Correct	1 ms	204 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	204 KB	Output is correct
9	Correct	1 ms	204 KB	Output is correct
10	Correct	52 ms	3804 KB	Output is correct
11	Correct	19 ms	1868 KB	Output is correct
12	Correct	1 ms	324 KB	Output is correct
13	Correct	1 ms	204 KB	Output is correct
14	Correct	1 ms	204 KB	Output is correct
15	Correct	0 ms	204 KB	Output is correct
16	Correct	0 ms	204 KB	Output is correct
17	Correct	0 ms	216 KB	Output is correct
18	Correct	1 ms	216 KB	Output is correct
19	Correct	9 ms	964 KB	Output is correct
20	Correct	42 ms	2908 KB	Output is correct
21	Correct	2 ms	292 KB	Output is correct
22	Correct	1 ms	308 KB	Output is correct
23	Correct	49 ms	4144 KB	Output is correct
24	Correct	80 ms	7156 KB	Output is correct
25	Correct	82 ms	7016 KB	Output is correct