# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
638494 | TranGiaHuy1508 | Permutation (APIO22_perm) | C++17 | 2 ms | 340 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
namespace {
vector<int> primes = {2, 3, 5, 7};
deque<int> q;
int lim;
void mult(int x){
if (x == 7){
q.push_back(lim + 3);
q.push_back(lim + 1);
q.push_back(lim);
q.push_back(lim + 2);
lim += 4;
return;
}
else if (x == 5){
q.push_back(lim + 2);
q.push_back(lim);
q.push_back(lim + 1);
lim += 3;
return;
}
for (int i = lim + x - 2; i >= lim; i--){
q.push_back(i);
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |