oj.uz

Submission #370475

# Submission time Handle Problem Language Result Execution time Memory
370475 2021-02-24T04:04:06 Z fhvirus "The Lyuboyn" code (IZhO19_lyuboyn) C++17
34 / 100
 263 ms 6492 KB 
// Knapsack DP is harder than FFT.
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii; typedef pair<ll, ll> pll;
#define ff first
#define ss second
#define pb emplace_back
#define FOR(i,n) for(int i = 0; i < (n); ++i)
#define FOO(i,a,b) for(int i = (a); i <= (b); ++i)
#define AI(x) (x).begin(),(x).end()
template<typename I> bool chmax(I &a, I b){ return a < b ? (a = b, true) : false;}
template<typename I> bool chmin(I &a, I b){ return a > b ? (a = b, true) : false;}
#ifdef OWO
#define debug(args...) LKJ("[ " + string(#args) + " ]", args)
void LKJ(){ cerr << endl;}
template<typename I, typename...T> void LKJ(I&&x, T&&...t){ cerr<<x<<", ", LKJ(t...);}
template<typename I> void DE(I a, I b){ while(a < b) cerr<<*a<<" \n"[next(a)==b], ++a;}
#else
#define debug(...) 0
#define DE(...) 0
#endif
int n, k, t, s;

int32_t main(){
	ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	cin >> n >> k >> t >> s;
	if(k % 2 == 0 or k >= n){
		puts("-1");
		return 0;
	}
	if(k == 1 and s == 0){
		vector<int> ans(2, 0);
		ans[0] = 0, ans[1] = 1;
		FOO(i,2,n){
			vector<int> b = ans;
			reverse(AI(b));
			for(auto &j: b) j += (1<<(i-1));
			for(auto j: b) ans.pb(j);
		}
		assert(ans.size() == (1<<n));
		cout << ans.size() << '\n';
		for(auto i: ans){
			for(int j = n - 1; j >= 0; --j)
				cout << ((i & (1<<j)) ? 1 : 0);
			cout << '\n';
		}
		return 0;
	}
	if(k == 3 and s == 0){
		n -= 2;
		vector<int> ans(2, 0);
		ans[0] = 0, ans[1] = 1;
		FOO(i,2,n){
			vector<int> b = ans;
			reverse(AI(b));
			for(auto &j: b) j += (1<<(i-1));
			for(auto j: b) ans.pb(j);
		}
		assert(ans.size() == (1<<n));
		cout << ans.size() * 4 << '\n';
		const int d[4] = {0, 1, 3, 2};
		for(int st = 0; st < 4; ++st){
			for(int x = 0; x < ans.size(); ++x){
				int i = ans[(st + x) % ans.size()];
				i ^= d[st] << n;
				if(x & 1) i ^= 3 << n;
				for(int j = n + 1; j >= 0; --j)
					cout << ((i & (1<<j)) ? 1 : 0);
				cout << '\n';
			}
		}
		return 0;
	}
	return 0;
}

Compilation message

In file included from /usr/include/c++/9/cassert:44,
                 from /usr/include/x86_64-linux-gnu/c++/9/bits/stdc++.h:33,
                 from lyuboyn.cpp:2:
lyuboyn.cpp: In function 'int32_t main()':
lyuboyn.cpp:41:21: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   41 |   assert(ans.size() == (1<<n));
      |          ~~~~~~~~~~~^~~~~~~~~
lyuboyn.cpp:60:21: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   60 |   assert(ans.size() == (1<<n));
      |          ~~~~~~~~~~~^~~~~~~~~
lyuboyn.cpp:64:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   64 |    for(int x = 0; x < ans.size(); ++x){
      |                   ~~^~~~~~~~~~~~

Subtask #1
0 / 0.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 364 KB Unexpected end of file - int32 expected

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 364 KB Ok

Subtask #3
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Ok
2 Correct 0 ms 364 KB Ok
3 Correct 1 ms 364 KB Ok
4 Correct 1 ms 364 KB Ok
5 Correct 1 ms 364 KB Ok
6 Correct 1 ms 364 KB Ok
7 Correct 0 ms 364 KB Ok
8 Correct 1 ms 364 KB Ok

Subtask #4
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 263 ms 6492 KB Ok
2 Correct 159 ms 3556 KB Ok
3 Correct 1 ms 364 KB Ok
4 Correct 1 ms 364 KB Ok
5 Correct 1 ms 384 KB Ok

Subtask #5
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Ok
2 Correct 6 ms 492 KB Ok
3 Correct 132 ms 2944 KB Ok
4 Correct 59 ms 1644 KB Ok
5 Correct 1 ms 364 KB Ok
6 Correct 2 ms 364 KB Ok
7 Correct 28 ms 1004 KB Ok
8 Correct 1 ms 364 KB Ok

Subtask #6
0 / 18.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 364 KB Unexpected end of file - int32 expected
2 Halted 0 ms 0 KB -

Subtask #7
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 263 ms 6492 KB Ok
2 Correct 159 ms 3556 KB Ok
3 Correct 1 ms 364 KB Ok
4 Correct 1 ms 364 KB Ok
5 Correct 1 ms 384 KB Ok
6 Correct 1 ms 364 KB Ok
7 Correct 6 ms 492 KB Ok
8 Correct 132 ms 2944 KB Ok
9 Correct 59 ms 1644 KB Ok
10 Correct 1 ms 364 KB Ok
11 Correct 2 ms 364 KB Ok
12 Correct 28 ms 1004 KB Ok
13 Correct 1 ms 364 KB Ok
14 Incorrect 0 ms 364 KB Unexpected end of file - int32 expected
15 Halted 0 ms 0 KB -

Subtask #8
0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 364 KB Unexpected end of file - int32 expected
2 Halted 0 ms 0 KB -