oj.uz

Submission #456465

# Submission time Handle Problem Language Result Execution time Memory
456465 2021-08-06T20:48:31 Z Antekb Sob (COCI19_sob) C++14
110 / 110
 177 ms 69684 KB 
#include<bits/stdc++.h>
using namespace std;
vector<pair<int, int> > ans;
void solve(int k, vector<int> A, vector<int> B){
	assert(A.size()==B.size());
	//cout<<k<<"a"<<A.size()<<"\n";
	//assert(A.size()<=(1<<k));
	if(A.size()==(1<<k)){
		/*for(int i:A)cout<<i<<"|"<<i%(1<<k)<<" ";
			cout<<"\n";
		for(int i:B)cout<<i<<"|"<<i%(1<<k)<<" ";
			cout<<"\n";
		cout<<(1<<k)<<"\n";*/
		for(int i=0; i<B.size(); i++){
			ans.push_back({A[(B[i]&((1<<k)-1))], B[i]});
			//cout<<A[((1<<k)-1)^(B[i]&((1<<k)-1))]<<" "<<B[i]<<"\n";
			//cout<<(A[B.size()-1-(B[i]&(B.size()-1))]&B[i])<<"\n";
		}
	}
	else if(A.size()<(1<<k))solve(k-1, A, B);
	else{
		/*for(int i:A)cout<<i<<" ";
			cout<<"\n";
		for(int i:B)cout<<i<<" ";
			cout<<"\n";*/
		assert((1<<k)<A.size());
		assert((1<<(k+1))>A.size());
		vector<int> A1, A2, B1, B2;
		for(int i=0; i<(1<<k);i++)A1.push_back(A[i]);
		for(int i=(1<<k); i<A.size();i++)A2.push_back(A[i]);
		int t=A.size()-(1<<k);
		for(int i=0; i<t; i++){
			if(B[i]&(1<<k)){
				B1.push_back(B[i+(1<<k)]);
				B2.push_back(B[i]);
			}
			else{
				B2.push_back(B[i+(1<<k)]);
				B1.push_back(B[i]);
			}
		}
		for(int i=0; i<(1<<k)-t; i++){
			B1.push_back(B[t+i]);
		}
		solve(k, A1, B1);
		solve(k-1, A2, B2);
	}
}
int main(){
	int n, m;
	cin>>n>>m;
	vector<int> A, B;
	for(int i=0; i<n; i++)A.push_back(i), B.push_back(m+i);
	solve(30, A, B);
	sort(ans.begin(), ans.end());
	assert(ans.size()==n);
	for(int i=1; i<n; i++)assert(ans[i].first>ans[i-1].first);
	for(int i=0; i<n; i++)assert((ans[i].first&ans[i].second)==ans[i].first);
	for(int i=0; i<n; i++)cout<<ans[i].first<<" "<<ans[i].second<<"\n";
}

Compilation message

sob.cpp: In function 'void solve(int, std::vector<int>, std::vector<int>)':
sob.cpp:8:13: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
    8 |  if(A.size()==(1<<k)){
      |     ~~~~~~~~^~~~~~~~
sob.cpp:14:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   14 |   for(int i=0; i<B.size(); i++){
      |                ~^~~~~~~~~
sob.cpp:20:18: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   20 |  else if(A.size()<(1<<k))solve(k-1, A, B);
      |          ~~~~~~~~^~~~~~~
In file included from /usr/include/c++/10/cassert:44,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:33,
                 from sob.cpp:1:
sob.cpp:26:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   26 |   assert((1<<k)<A.size());
      |          ~~~~~~^~~~~~~~~
sob.cpp:27:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   27 |   assert((1<<(k+1))>A.size());
      |          ~~~~~~~~~~^~~~~~~~~
sob.cpp:30:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   30 |   for(int i=(1<<k); i<A.size();i++)A2.push_back(A[i]);
      |                     ~^~~~~~~~~
In file included from /usr/include/c++/10/cassert:44,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:33,
                 from sob.cpp:1:
sob.cpp: In function 'int main()':
sob.cpp:56:19: warning: comparison of integer expressions of different signedness: 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   56 |  assert(ans.size()==n);
      |         ~~~~~~~~~~^~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 82 ms 31288 KB Output is correct

Subtask #2
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 972 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 288 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 82 ms 31288 KB Output is correct
7 Correct 50 ms 19900 KB Output is correct

Subtask #3
39.0 / 39.0

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

Subtask #4
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 82 ms 31288 KB Output is correct
5 Correct 2 ms 972 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 288 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 82 ms 31288 KB Output is correct
11 Correct 50 ms 19900 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 292 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 21 ms 9160 KB Output is correct
20 Correct 75 ms 28984 KB Output is correct
21 Correct 3 ms 1740 KB Output is correct
22 Correct 2 ms 972 KB Output is correct
23 Correct 119 ms 40140 KB Output is correct
24 Correct 176 ms 69684 KB Output is correct
25 Correct 177 ms 68376 KB Output is correct