-
-
Save neetsdkasu/ed06dc75de77c2a0a5efd5230c5a7a1f to your computer and use it in GitHub Desktop.
MM26 C# Solution (2400000 cycles)
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
using System; | |
public class Permute | |
{ | |
public long limit = 2400000; | |
public int[] findOrder(double[] w) | |
{ | |
int n = (int)Math.Sqrt((double)w.Length); | |
var ret = new int[n]; | |
for (int i = 0; i < n; i++) | |
{ | |
ret[i] = i; | |
} | |
double sc = 0.0; | |
for (int i = 0; i < n - 1; i++) | |
{ | |
int rn = ret[i] * n; | |
for (int j = i + 1; j < n; j++) | |
{ | |
sc += w[rn + ret[j]]; | |
} | |
} | |
long lp = 0; | |
int a = 0, b = 1; | |
while (lp < limit) | |
{ | |
lp++; | |
int ra = ret[a]; | |
int rb = ret[b]; | |
int ran = ra * n; | |
int rbn = rb * n; | |
double dsc = w[rbn + ra] - w[ran + rb]; | |
for (int i = a + 1; i < b; i++) | |
{ | |
int r = ret[i]; | |
int rn = r * n; | |
dsc += w[rbn + r] + w[rn + ra] - w[ran + r] - w[rn + rb]; | |
} | |
if (dsc > 0.0) | |
{ | |
ret[a] = rb; | |
ret[b] = ra; | |
sc += dsc; | |
} | |
b++; | |
if (b >= n) | |
{ | |
a++; | |
if (a >= n - 1) | |
{ | |
a = 0; | |
} | |
b = a + 1; | |
} | |
} | |
double dv = (double)n * Math.Sqrt((double)n * Math.Log((double)n) - (double)n) / 100.0; | |
sc /= dv; | |
Console.Error.WriteLine("score={0}", sc); | |
Console.Error.WriteLine("loop={0}", lp); | |
return ret; | |
} | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment