1
// 一般的随机数
2
srand(time(nullptr));
3
int x1 = rand();
4

5
// random device
6
random_device rd;
7
unsigned x2 = rd();
8

9
// mt19937
10
mt19937 mt(time(nullptr));
11
unsigned x3 = mt();
12

13
// 均匀分布
14
default_random_engine seed(time(nullptr));
15
uniform_real_distribution<double> urd(L, R);
16
uniform_int_distribution<int> uid(L, R);
17
double x4 = urd(seed);
18
int x5 = uid(seed);

1
#include <bits/stdc++.h>
2
#define N 200
3
using namespace std;
4

5
typedef pair<double, double> PDD;
6

7
PDD p[N];
8
int n;
9
double ans = 0x3f3f3f3f;
10

11
double dis(PDD i, PDD j) {
12
    return sqrt((i.first - j.first) * (i.first - j.first) + (i.second - j.second) * (i.second - j.second));
13
}
14

15
double rand(double x, double y) {
16
    return (double) rand() / RAND_MAX * (y - x) + x;
17
}
18

19
double calc(PDD x) {
20
    double sum = 0;
21
    for (int i = 1; i <= n; i++) sum += dis(p[i], x);
22
    ans = min(ans, sum);
23
    return sum;
24
}
25

26
void SA() {
27
    double T = 1e4;
28
    PDD cur = (PDD) {rand(0, 1e4), rand(0, 1e4)};
29
    while (T > 1e-4) {
30
        PDD now = (PDD) {rand(cur.first - T, cur.first + T), rand(cur.second - T, cur.second + T)};
31
        double d = calc(now) - calc(cur);
32
        if (exp(-d / T) > rand(0, 1)) cur = now;
33
        T *= 0.99;
34
    }
35
}
36

37
int main() {
38
    ios::sync_with_stdio(false);
39
    cin.tie(nullptr);
40
    cout.tie(nullptr);
41

42
    srand(time(nullptr));
43
    cin >> n;
44
    for (int i = 1; i<= n; i++) cin >> p[i].first >> p[i].second;
45
    double st = clock();
46
    while (clock() - st <= 985) SA();
47
    cout << (int) round(ans) << endl;
48
    return 0;
49
}

1
#include <bits/stdc++.h>
2
#define N 55
3
using namespace std;
4

5
typedef pair<int, int> PII;
6

7
random_device rd;
8

9
PII p[N];
10
int n, m;
11
int ans;
12

13
int calc() {
14
    int sum = 0;
15
    for (int i = 1; i <= m; i++) {
16
        sum += (p[i].first + p[i].second);
17
        if (i <= n) {
18
            if (p[i].first == 10) sum += (p[i + 1].first + p[i + 1].second);
19
            else if (p[i].first + p[i].second == 10) sum += p[i + 1].first;
20
        }
21
    }
22
    ans = max(ans, sum);
23
    return sum;
24
}
25

26
void SA() {
27
    double T = 1e4;
28
    while (T > 1e-5) {
29
        int a = calc();
30
        unsigned x = rd() % m + 1, y = rd() % m + 1;
31
        swap(p[x], p[y]);
32
        if (n + (p[n].first == 10) == m) {
33
            int b = calc();
34
            if (exp((b - a) / T) < (double) rd() / random_device::max()) swap(p[x], p[y]);
35
        } else swap(p[x], p[y]);
36
        T *= 0.99;
37
    }
38
}
39

40
int main() {
41
    ios::sync_with_stdio(false);
42
    cin.tie(nullptr);
43
    cout.tie(nullptr);
44

45
    cin >> n;
46
    double st = clock();
47
    for (int i = 1; i <= n; i++) cin >> p[i].first >> p[i].second;
48
    if (p[n].first == 10) {
49
        m = n + 1;
50
        cin >> p[n + 1].first >> p[n + 1].second;
51
    } else m = n;
52
    while ((clock() - st) / CLOCKS_PER_SEC < 0.85) SA();
53
    cout << ans << endl;
54
    return 0;
55
}

1
#include <bits/stdc++.h>
2

3
#define N 25
4
#define M 10
5
using namespace std;
6

7
int seq[N], grp[M];
8
double ans = 1e9;
9
random_device rd;
10
int n, m;
11

12
double rand(double l, double r) {
13
    return (double) rd() / random_device::max() * (r - l) + l;
14
}
15

16
double calc() {
17
    memset(grp, 0, sizeof grp);
18

19
    double ret = 0;
20
    for (int i = 1; i <= n; i++) {
21
        int t = 1;
22
        for (int j = 1; j <= m; j++) {
23
            if (grp[j] < grp[t]) t = j;
24
        }
25
        grp[t] += seq[i];
26
    }
27
    double avr = 0;
28
    for (int i = 1; i <= m; i++) avr += (double) grp[i] / m;
29
    for (int i = 1; i <= m; i++) ret += (grp[i] - avr) * (grp[i] - avr);
30
    ret = sqrt(ret / m);
31
    ans = min(ans, ret);
32
    return ret;
33
}
34

35
void SA() {
36
    shuffle(seq + 1, seq + 1 + n, mt19937(rd()));
37
    double T = 1e6;
38
    while (T > 1e-6) {
39
        double a = calc();
40
        int x = (int) rand(1, n), y = (int) rand(1, n);
41
        swap(seq[x], seq[y]);
42
        double b = calc();
43
        if (exp((a - b) / T) < rand(0, 1)) swap(seq[x], seq[y]);
44
        T *= 0.99;
45
    }
46
}
47

48
int main() {
49
    ios::sync_with_stdio(false);
50
    cin.tie(nullptr);
51
    cout.tie(nullptr);
52

53
    cin >> n >> m;
54
    for (int i = 1; i <= n; i++) cin >> seq[i];
55
    double st = clock();
56
    while ((clock() - st) / CLOCKS_PER_SEC < 0.85) SA();
57
    cout << fixed << setprecision(2) << ans << endl;
58
    return 0;
59
}