Submission #790621

#TimeUTC-0UsernameProblemLanguageResultExecution timeMemory
7906212023-07-23 01:35:28tvladm2009Cake 3 (JOI19_cake3)C++17
24 / 100
4048 ms8128 KiB
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
/**const int INF = (int) 1e9;
vector<int> v;
void run(int lvl = 0) {
if (lvl == 4) {
vector<int> cv = v;
sort(cv.begin(), cv.end());
int best = INF;
while (next_permutation(cv.begin(), cv.end())) {
int now = 0;
for (int i = 1; i < (int) cv.size(); i++) {
now += abs(cv[i] - cv[i - 1]);
}
now += abs(cv.back() - cv[0]);
if (now < best) {
best = now;
}
}
cv = v;
sort(cv.begin(), cv.end());
cout << "[";
for (int i = 0; i < (int) v.size(); i++) {
cout << v[i];
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...