oj.uz

Submission #336720

# Submission time Handle Problem Language Result Execution time Memory
336720 2020-12-16T14:10:12 Z beksultan04 "The Lyuboyn" code (IZhO19_lyuboyn) C++14
34 / 100
 296 ms 7516 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pii pair<int,int>
#define OK puts("OK");
#define fr first
#define sc second
#define ret return
#define scan1(a) scanf("%lld",&a);
#define scan2(a,b) scanf("%lld %lld",&a, &b);
#define scan3(a,b,c) scanf("%lld %lld %lld",&a,&b,&c);
#define all(s) s.begin(),s.end()
#define pb push_back
#define sz(v) (int)v.size()
#define endi puts("");
const int N = 5e5+12,INF=1e9+7;
int q[N],p[N],dp[N];
main(){
    int n,k,t,i,j;
    scan3(n,k,t)
    string s;
    cin>>s;
    if (k%2==0){
        cout <<-1;
        ret 0;
    }
    vector <int> v;
    v.pb(0);
    v.pb(1);
    for (i=1;i<=k;++i){
        int x = (1<<i);
        for (j=v.size()-1;j>=0;--j){
            v.pb(x+v[j]);
        }
    }
    int x = (1<<i)-1;
    for (i=0;i<v.size();++i){
        if (i%2)v[i]^=x;
    }

    for (i=k+1;i<n;++i){
        int x = (1<<i),xr = (1<<(k-1))-1;
        for (j=v.size()-1;j>=0;--j){
            v.pb(x+v[j]^xr);
        }
    }





























///Answer
    cout <<v.size()<<"\n";
    for (i=0;i<v.size();++i){
        for (j=0;j<n;++j){
            if (v[i]&(1<<j)){
                cout << 1;
            }
            else cout<<0;
        }endi
    }
}

Compilation message

lyuboyn.cpp:18:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   18 | main(){
      |      ^
lyuboyn.cpp: In function 'int main()':
lyuboyn.cpp:37:15: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   37 |     for (i=0;i<v.size();++i){
      |              ~^~~~~~~~~
lyuboyn.cpp:44:19: warning: suggest parentheses around arithmetic in operand of '^' [-Wparentheses]
   44 |             v.pb(x+v[j]^xr);
lyuboyn.cpp:78:15: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   78 |     for (i=0;i<v.size();++i){
      |              ~^~~~~~~~~
lyuboyn.cpp:11:27: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   11 | #define scan3(a,b,c) scanf("%lld %lld %lld",&a,&b,&c);
      |                      ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
lyuboyn.cpp:20:5: note: in expansion of macro 'scan3'
   20 |     scan3(n,k,t)
      |     ^~~~~

Subtask #1
0 / 0.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 364 KB First number in answer is not x 1 0

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 0 ms 364 KB Ok
5 Correct 1 ms 364 KB Ok
6 Correct 1 ms 364 KB Ok
7 Correct 1 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 296 ms 7516 KB Ok
2 Correct 139 ms 3936 KB Ok
3 Correct 1 ms 364 KB Ok
4 Correct 1 ms 364 KB Ok
5 Correct 1 ms 364 KB Ok

Subtask #5
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Ok
2 Correct 7 ms 620 KB Ok
3 Correct 138 ms 3996 KB Ok
4 Correct 65 ms 2148 KB Ok
5 Correct 1 ms 364 KB Ok
6 Correct 2 ms 364 KB Ok
7 Correct 31 ms 1304 KB Ok
8 Correct 1 ms 364 KB Ok

Subtask #6
0 / 18.0

# Verdict Execution time Memory Grader output
1 Incorrect 291 ms 7472 KB First number in answer is not x 44202 0
2 Halted 0 ms 0 KB -

Subtask #7
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 296 ms 7516 KB Ok
2 Correct 139 ms 3936 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 7 ms 620 KB Ok
8 Correct 138 ms 3996 KB Ok
9 Correct 65 ms 2148 KB Ok
10 Correct 1 ms 364 KB Ok
11 Correct 2 ms 364 KB Ok
12 Correct 31 ms 1304 KB Ok
13 Correct 1 ms 364 KB Ok
14 Incorrect 291 ms 7472 KB First number in answer is not x 44202 0
15 Halted 0 ms 0 KB -

Subtask #8
0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 139 ms 3936 KB First number in answer is not x 92826 0
2 Halted 0 ms 0 KB -