제출 #370499

#제출 시각아이디문제언어결과실행 시간메모리
370499fhvirus"The Lyuboyn" code (IZhO19_lyuboyn)C++17
52 / 100
264 ms7668 KiB
// 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 void printb(int n, vector<int> v){ cout << v.size() << '\n'; for(auto i: v){ for(int j = n - 1; j >= 0; --j) cout << ((i & (1<<j)) ? 1 : 0); cout << '\n'; } } void solvek1(int n, vector<int> & ans){ ans = {0, 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); } return; } void addk(int k, int n, vector<int>& v){ assert(k % 2 == 0); if(k <= 0) return; vector<int> h; solvek1(k, h); vector<int> ans; int msk = (((1<<k)-1) << n); FOR(st, h.size()){ FOR(x, v.size()){ int id = st + x; if(id >= v.size()) id -= v.size(); int i = v[id]; i ^= (h[st]<<n); if(x & 1) i ^= msk; ans.pb(i); } } ans.swap(v); return; } int tobin(string s){ int ans = 0; for(int i = 0; i < s.size(); ++i) if(s[s.size() - 1 - i] == '1') ans += (1<<i); return ans; } int n, k, t; string ss; int32_t main(){ ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0); cin >> n >> k >> t >> ss; if(k % 2 == 0){ puts("-1"); return 0; } vector<int> ans; solvek1(n - k + 1, ans); addk(k - 1, n - k + 1, ans); int s = tobin(ss); FOR(i,ans.size()) if(ans[i] == s){ rotate(ans.begin(), ans.begin() + i, ans.end()); break; } printb(n, ans); return 0; }

컴파일 시 표준 에러 (stderr) 메시지

lyuboyn.cpp: In function 'void addk(int, int, std::vector<int>&)':
lyuboyn.cpp:9:35: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    9 | #define FOR(i,n) for(int i = 0; i < (n); ++i)
      |                                   ^
lyuboyn.cpp:48:2: note: in expansion of macro 'FOR'
   48 |  FOR(st, h.size()){
      |  ^~~
lyuboyn.cpp:9:35: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    9 | #define FOR(i,n) for(int i = 0; i < (n); ++i)
      |                                   ^
lyuboyn.cpp:49:3: note: in expansion of macro 'FOR'
   49 |   FOR(x, v.size()){
      |   ^~~
lyuboyn.cpp:50:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   50 |    int id = st + x; if(id >= v.size()) id -= v.size();
      |                        ~~~^~~~~~~~~~~
lyuboyn.cpp: In function 'int tobin(std::string)':
lyuboyn.cpp:62:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   62 |  for(int i = 0; i < s.size(); ++i)
      |                 ~~^~~~~~~~~~
lyuboyn.cpp: In function 'int32_t main()':
lyuboyn.cpp:9:35: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    9 | #define FOR(i,n) for(int i = 0; i < (n); ++i)
      |                                   ^
lyuboyn.cpp:84:2: note: in expansion of macro 'FOR'
   84 |  FOR(i,ans.size()) if(ans[i] == s){
      |  ^~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...