oj.uz

Submission #288232

# Submission time Handle Problem Language Result Execution time Memory
288232 2020-09-01T10:38:53 Z errorgorn "The Lyuboyn" code (IZhO19_lyuboyn) C++14
3 / 100
 2 ms 384 KB 
//雪花飄飄北風嘯嘯
//天地一片蒼茫

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
#define ll long long
#define ii pair<ll,ll>
#define iii pair<ii,ll>
#define fi first
#define se second
#define endl '\n'
#define debug(x) cout << #x << " is " << x << endl

#define rep(x,start,end) for(auto x=(start)-((start)>(end));x!=(end)-((start)>(end));((start)<(end)?x++:x--))
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).size()

#define indexed_set tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update>
//change less to less_equal for non distinct pbds, but erase will bug

mt19937 rng(chrono::system_clock::now().time_since_epoch().count());

const string zzz[]={
	"0000",
	"1110",
	"1001",
	"0010",
	"1111",
	"0100",
	"1010",
	"1101",
	"0110",
	"1011",
	"0101",
	"0010",
	"1001",
	"0001",
	"0110",
	"1101"
};

int n,k,t;
string s;

int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin.exceptions(ios::badbit | ios::failbit);
	
	cin>>n>>k>>t;
	cin>>s;
	
	if (k%2==0){
		cout<<"-1"<<endl;
		return 0;
	}
	
	int idx;
	rep(x,0,16) if (zzz[x]==s) idx=x;
	
	cout<<16<<endl;
	rep(x,0,16) cout<<zzz[(x+idx)%16]<<endl;
}

Compilation message

lyuboyn.cpp: In function 'int main()':
lyuboyn.cpp:64:6: warning: 'idx' may be used uninitialized in this function [-Wmaybe-uninitialized]
   64 |  int idx;
      |      ^~~

Subtask #1
0 / 0.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 384 KB The output is neither -1 nor the length of the answer

Subtask #2
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 384 KB The values in the output sequence are not pairwise distinct!

Subtask #3
3.0 / 3.0

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

Subtask #4
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 384 KB The output is neither -1 nor the length of the answer
2 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 384 KB The output is neither -1 nor the length of the answer
2 Halted 0 ms 0 KB -

Subtask #6
0 / 18.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 384 KB The output is neither -1 nor the length of the answer
2 Halted 0 ms 0 KB -

Subtask #7
0 / 31.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 384 KB The output is neither -1 nor the length of the answer
2 Halted 0 ms 0 KB -

Subtask #8
0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 384 KB The output is neither -1 nor the length of the answer
2 Halted 0 ms 0 KB -