結果
問題 | No.1228 I hate XOR Matching |
ユーザー |
![]() |
提出日時 | 2020-09-11 23:13:45 |
言語 | C++11 (gcc 13.3.0) |
結果 |
AC
|
実行時間 | 2 ms / 2,000 ms |
コード長 | 2,383 bytes |
コンパイル時間 | 1,918 ms |
コンパイル使用メモリ | 82,748 KB |
実行使用メモリ | 5,248 KB |
最終ジャッジ日時 | 2024-12-27 19:54:08 |
合計ジャッジ時間 | 4,366 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 |
other | AC * 31 |
コンパイルメッセージ
main.cpp: In function ‘int main()’: main.cpp:123:38: warning: ‘b’ may be used uninitialized in this function [-Wmaybe-uninitialized] 123 | llint x = vec[i] % (1<<b); | ~~^~~~
ソースコード
#include <iostream>#include <cstdio>#include <cmath>#include <ctime>#include <cstdlib>#include <cassert>#include <vector>#include <list>#include <stack>#include <queue>#include <deque>#include <map>#include <set>#include <bitset>#include <string>#include <algorithm>#include <utility>#define llint long long#define PI 3.1415926535897932384626433832795028841971#define inf 1e18#define rep(x, s, t) for(llint (x) = (s); (x) < (t); (x)++)#define Rep(x, s, t) for(llint (x) = (s); (x) <= (t); (x)++)#define chmin(x, y) (x) = min((x), (y))#define chmax(x, y) (x) = max((x), (y))#define mod 1000000007using namespace std;typedef pair<llint, llint> P;llint k, x;vector<llint> vec;void get(llint r){if(r <= 26){for(int i = 0; i < r/11; i++){for(int j = 1; j <= 7; j++){llint x = j<<(3*i);vec.push_back(x);vec.push_back(x);}}for(int i = 0; i < r%11; i++){vec.push_back(1<<(r/11*3+i));vec.push_back(1<<(r/11*3+i));}}else{for(int i = 0; i < r/26; i++){for(int j = 1; j <= 15; j++){llint x = j<<(4*i);//cout << x << endl;vec.push_back(x);vec.push_back(x);}}for(int i = 0; i < r%26; i++){vec.push_back(1<<(r/26*4+i));vec.push_back(1<<(r/26*4+i));}}}int main(void){ios::sync_with_stdio(0);cin.tie(0);cin >> k >> x;if(k == 0){if(x == 0){cout << "Yes" << endl;cout << 1 << endl;cout << 1 << endl;return 0;}if((x+1)&x){cout << "No" << endl;return 0;}llint r = 0;x++;for(;x;x/=2) r++;r--;cout << "Yes" << endl;get(r);cout << vec.size() << endl;for(int i = 0; i < vec.size(); i++) cout << vec[i] << " "; cout << endl;return 0;}if(x == 0){cout << "Yes" << endl;cout << 1 << endl;cout << 0 << endl;return 0;}if((x-1)&x){cout << "No" << endl;return 0;}llint r = 0;for(;x;x/=2) r++;r--;llint b;for(int i = 0; i < 20; i++){if(k & (1<<i)){b = i;break;}}cout << "Yes" << endl;get(r);//cout << b << endl;for(int i = 0; i < vec.size(); i++){//cout << vec[i] << " ";llint x = vec[i] % (1<<b);vec[i] = ((vec[i] >> b) << (b+1)) + x;//cout << vec[i] << endl;}vec.push_back(k);cout << vec.size() << endl;for(int i = 0; i < vec.size(); i++) cout << vec[i] << " "; cout << endl;cout << endl;return 0;}