基于高斯消元法XOR方程组求解与优化策略研究.pdfVIP

XORequation

system

TsinghuaUniversity

MoTao

mythly@

hwd@

2

2

XOR的计算方式

N,M=100000

数字为260内的非负整数

讨论某道题时，假设其之前所有例题已解决

XORcalculation

method

N,M=100000

Thenumberisanon-neive

integerwithin260

Whendiscussingacertainquestion,assumethatallprevious

examphavebeensolved

概览一（10分钟）

证明XOR满换律，结合律，是自身的逆运算。

从N个数中选出两个数，使XOR和最大。

N个点的边带权的树，找一条路径使XOR和最大。

从N个数中选出若干个，使XOR和为X，给出方案或

不可行。

在上题的基础上，给定M个限制，每个限制是那N个数的

一个子集，要求该子集中的数恰有奇数个或偶数个被选择

从N个数中选出任意个数，使XOR和最大。

322

O(N*64)?O(N*64)?O((N/64)*64)?O(N*64)?

从N个数中选出任意个数，求能得到的XOR和的种数。

从N个数中选出任意个数，使它们的XOR和与X的XOR和

最大。

Overview1(10

minutes)

ProvethatXORsatisfiesthecommutativelawandassociativelaw,andisitsowninverseoperation.

SelecttwonumbersfromNnumberstoizetheXORsum.

ForatreewithedgeweightsofNpoints,findapathtoizetheXORsum.

SelectseveralnumbersfromNsothattheXORsumisX,giveasolution

orpointoutthatitisnotfeasible.

Basedontheabovequestion,givenMrestrictions,eachrestrictionisasubsetof

theNnumbers,anditisrequiredthatanoddorevennumberofthenumbersin

thesubsetbeselected.

SelectanynumberfromNnumberstoizetheXORsum.

O(N*643)?What(N*642)?O((N/64)*642)?O(N*64)?

SelectanynumberfromNnumbersandfindthenumberofXORsumsthatcanbeobtained.

SelectanynumberfromNnumberstoize