摘要:
A -Guess Your Way Out!Time Limit:1000MSMemory Limit:262144KB64bit IO Format:%I64d & %I64uSubmitStatusPracticeCodeForces 507CDescriptionAmr bought a ne... 阅读全文
摘要:
First OneTime Limit: 4000/2000 MS (Java/Others)Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 831Accepted Submission(s): 253Problem D... 阅读全文
摘要:
MZL's endless loopTime Limit: 3000/1500 MS (Java/Others)Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 898Accepted Submission(s): 178... 阅读全文
摘要:
A -Gargari and BishopsTime Limit:3000MSMemory Limit:262144KB64bit IO Format:%I64d & %I64uSubmitStatusPracticeCodeForces 463CDescriptionGargari is jeal... 阅读全文
摘要:
1 struct Matrix { 2 int n , m ; 3 int mat[M][M] ; 4 int * operator [] (int x) { 5 return mat[x] ; 6 }... 阅读全文
摘要:
假设1为必胜态,0为必败态。那么如果当前的为1,那么当前拿得人胜,所以为先手胜,0为先手败。Nim游戏SG函数:http://www.cnblogs.com/hsqdboke/archive/2012/04/21/2461034.html三种经典博弈:!chomp型广搜型:BC27D 阅读全文
摘要:
C. Amr and Chemistrytime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputAmr loves Chemistry, and spec... 阅读全文
摘要:
A.Little Pony and Expected MaximumTime Limit:1000MSMemory Limit:262144KB64bit IO Format:%I64d & %I64uSubmitStatusPracticeCodeForces 454CDescriptionTwi... 阅读全文
摘要:
dfs序是指你用dfs遍历一棵树时,每个节点会按照遍历到的先后顺序得到一个序号。然后你用这些序号,可以把整个遍历过程表示出来。如上图所示,则整个遍历过程为1 2 3 2 4 5 4 6 4 2 1 7 8 7 1反正按照实现目的不同,dfs序会长得不太一样,比如说为了实现LCA就需要上面形式的dfs... 阅读全文
摘要:
1 #include 2 using namespace std; 3 const int M = 1e6 + 10 , inf = 0x3f3f3f3f ; 4 int s ; 5 int n , k ; 6 int a[M] ; 7 int b[M] , tot ; 8 void solve ... 阅读全文