結果
問題 |
No.3088 XOR = SUM
|
ユーザー |
|
提出日時 | 2025-04-04 23:09:34 |
言語 | Rust (1.83.0 + proconio) |
結果 |
AC
|
実行時間 | 204 ms / 2,000 ms |
コード長 | 1,841 bytes |
コンパイル時間 | 13,604 ms |
コンパイル使用メモリ | 394,980 KB |
実行使用メモリ | 7,844 KB |
最終ジャッジ日時 | 2025-04-04 23:10:03 |
合計ジャッジ時間 | 28,509 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 1 |
other | AC * 22 |
ソースコード
//#![allow(unused)] #[allow(unused_imports)] use std::{ cell::RefCell, convert::{Infallible, TryFrom, TryInto as _}, fmt::{self, Debug, Display, Formatter,}, fs::{File}, hash::{Hash, Hasher}, iter::{Product, Sum}, marker::PhantomData, ops::{Add, AddAssign, Sub, SubAssign, Div, DivAssign, Mul, MulAssign, Neg, RangeBounds}, str::{FromStr, SplitWhitespace}, sync::{atomic::{self, AtomicU32, AtomicU64}, Once}, collections::{*, btree_map::Range}, mem::{swap}, cmp::{self, Reverse, Ordering, Eq, PartialEq, PartialOrd}, thread::LocalKey, f64::consts::PI, time::Instant, rc::Rc, io::{self, stdin, Read, read_to_string, BufWriter, BufReader, stdout, Write}, }; #[allow(unused_imports)] use proconio::{input, input_interactive, marker::{*}}; #[allow(unused_imports)] //use rand::{thread_rng, Rng, seq::SliceRandom}; #[allow(unused_imports)] //use ac_library::{*}; #[allow(dead_code)] const INF: i64 = 1<<60; #[allow(dead_code)] const MOD: i64 = 1000000007; #[allow(dead_code)] const D: [(usize, usize); 4] = [(1, 0), (0, 1), (!0, 0), (0, !0)]; use proconio::fastout; #[fastout] fn main() { input! { t: usize, } for _ in 0..t{ input!{ n: i128, } let (mut mx, mut x, mut y) = (0, 0, 0); let mut z = 0; for i in (0..=60).rev(){ let bit = 1<<i; if n & bit > 0{ if mx < (z|bit)*(n^(z|bit)){ (mx, x, y) = (bit*(n^bit), z|bit, n^(z|bit)); } if mx < z*(bit-1){ (mx, x, y) = (x*(bit-1), x, bit-1); } if mx < bit/2*(bit/2-1){ (mx, x, y) = (bit/2*(bit/2-1), bit/2, bit/2-1); } z |= bit; } } println!("{} {}", x, y); } }