-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathcase-generator.cpp
More file actions
185 lines (166 loc) · 5.91 KB
/
case-generator.cpp
File metadata and controls
185 lines (166 loc) · 5.91 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
#include <algorithm>
#include <chrono>
#include <fstream>
#include <iostream>
#include <random>
#include <string>
#include <vector>
enum Strategy {
kAlwaysNext,
kConnected,
kFullRandom,
kNextOrBegin,
kPermutation,
kSingleLoop,
};
struct RandomGenerator {
RandomGenerator(const std::vector<long long>& sequence)
: seed(sequence.begin(), sequence.end()), engine(seed) {}
long long Integer(long long l, long long r) {
std::uniform_int_distribution<long long> distribution(l, r);
return distribution(engine);
}
long long CoinToss(long long a, long long b) {
std::uniform_int_distribution<int> distribution(0, 1);
return distribution(engine) ? a : b;
}
void Permutation(std::vector<long long>& arr) {
std::shuffle(arr.begin(), arr.end(), engine);
}
std::seed_seq seed;
std::mt19937_64 engine;
};
bool IsValidPermutation(const std::vector<long long>& arr) {
for (int i = 0; i < arr.size(); ++i)
if (arr[i] == i + 1) return false;
return true;
}
struct TestMetadata {
std::string filename;
Strategy strategy;
int n, score;
};
struct Testcase {
Testcase(const TestMetadata& metadata, RandomGenerator& random)
: arr(metadata.n) {
switch (metadata.strategy) {
case kAlwaysNext:
arr[metadata.n - 1] = 1;
for (int i = 0; i < metadata.n - 1; ++i) arr[i] = i + 2;
break;
case kConnected: {
std::vector<long long> permutation(metadata.n);
for (int i = 0; i < metadata.n; ++i) permutation[i] = i;
random.Permutation(permutation);
int k = random.Integer(2, metadata.n - 1);
for (int i = 1; i < k; ++i)
arr[permutation[i - 1]] = permutation[i] + 1;
arr[permutation[k - 1]] = permutation[0] + 1;
for (int i = k; i < metadata.n; ++i)
arr[permutation[i]] = permutation[random.Integer(0, i - 1)] + 1;
break;
}
case kFullRandom:
for (int i = 0; i < metadata.n; ++i)
arr[i] = (i + random.Integer(1, metadata.n - 1)) % metadata.n + 1;
break;
case kNextOrBegin:
arr[0] = 2, arr[metadata.n - 1] = 1;
for (int i = 1; i < metadata.n - 1; ++i)
arr[i] = random.CoinToss(1, i + 2);
break;
case kPermutation:
for (int i = 0; i < metadata.n; ++i) arr[i] = i + 1;
while (!IsValidPermutation(arr)) random.Permutation(arr);
break;
case kSingleLoop: {
std::vector<long long> permutation(metadata.n);
for (int i = 0; i < metadata.n; ++i) permutation[i] = i;
random.Permutation(permutation);
for (int i = 1; i < metadata.n; ++i)
arr[permutation[i - 1]] = permutation[i] + 1;
arr[permutation[metadata.n - 1]] = permutation[0] + 1;
break;
}
}
}
void ToFile(const std::string& filename) {
std::ofstream file(filename);
file << arr.size() << '\n';
for (long long a : arr) file << a << ' ';
file << '\n';
file.close();
}
std::vector<long long> arr;
};
int main() {
const std::vector<TestMetadata> metadata_arr = {
{"sub1.case01", kNextOrBegin, 7, 24},
{"sub1.case02", kNextOrBegin, 8, 0},
{"sub1.case03", kNextOrBegin, 13, 0},
{"sub1.case04", kNextOrBegin, 17, 0},
{"sub1.case05", kNextOrBegin, 23, 0},
{"sub1.case06", kNextOrBegin, 100, 0},
{"sub1.case07", kNextOrBegin, 777, 0},
{"sub1.case08", kNextOrBegin, 919, 0},
{"sub1.case09", kNextOrBegin, 1000, 0},
{"sub1.case10", kNextOrBegin, 1001, 0},
{"sub1.case11", kNextOrBegin, 2024, 0},
{"sub1.case12", kNextOrBegin, 5000, 0},
{"sub1.case13", kNextOrBegin, 100000, 0},
{"sub1.case14", kNextOrBegin, 555555, 0},
{"sub1.case15", kNextOrBegin, 1000000, 0},
{"sub1.case16", kAlwaysNext, 1000000, 0},
{"sub2.case01", kPermutation, 6, 31},
{"sub2.case02", kPermutation, 7, 0},
{"sub2.case03", kPermutation, 8, 0},
{"sub2.case04", kPermutation, 10, 0},
{"sub2.case05", kPermutation, 19, 0},
{"sub2.case06", kPermutation, 57, 0},
{"sub2.case07", kPermutation, 100, 0},
{"sub2.case08", kPermutation, 777, 0},
{"sub2.case09", kPermutation, 1000, 0},
{"sub2.case10", kPermutation, 12345, 0},
{"sub2.case11", kPermutation, 50000, 0},
{"sub2.case12", kPermutation, 100000, 0},
{"sub2.case13", kPermutation, 500000, 0},
{"sub2.case14", kPermutation, 1000000, 0},
{"sub2.case15", kPermutation, 1000000, 0},
{"sub2.case16", kSingleLoop, 6, 0},
{"sub2.case17", kSingleLoop, 1000, 0},
{"sub2.case18", kSingleLoop, 1000000, 0},
{"sub3.case01", kConnected, 8, 45},
{"sub3.case02", kConnected, 777, 0},
{"sub3.case03", kConnected, 1003, 0},
{"sub3.case04", kConnected, 500000, 0},
{"sub3.case05", kConnected, 1000000, 0},
{"sub3.case06", kConnected, 1000000, 0},
{"sub3.case07", kFullRandom, 5, 0},
{"sub3.case08", kFullRandom, 13, 0},
{"sub3.case09", kFullRandom, 69, 0},
{"sub3.case10", kFullRandom, 777, 0},
{"sub3.case11", kFullRandom, 1000, 0},
{"sub3.case12", kFullRandom, 4321, 0},
{"sub3.case13", kFullRandom, 10000, 0},
{"sub3.case14", kFullRandom, 20000, 0},
{"sub3.case15", kFullRandom, 100000, 0},
{"sub3.case16", kFullRandom, 200000, 0},
{"sub3.case17", kFullRandom, 500000, 0},
{"sub3.case18", kFullRandom, 1000000, 0},
{"sub3.case19", kFullRandom, 1000000, 0},
{"sub3.case20", kFullRandom, 1000000, 0},
};
RandomGenerator random({15819763, -87847733, 60784601});
std::ofstream testplan("testplan");
testplan << "sub1.sample 0\n";
testplan << "sub2.sample 0\n";
testplan << "sub1.extra 0\n";
testplan << "sub2.extra 0\n";
testplan << "sub3.extra 0\n";
for (const auto& metadata : metadata_arr) {
Testcase(metadata, random).ToFile("cases/" + metadata.filename + ".in");
testplan << metadata.filename << ' ' << metadata.score << '\n';
}
testplan.close();
return 0;
}