이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include "swaps.h"
#include "bits/stdc++.h"
using namespace std;
void solve(int N, int V) {
// TODO implement this function
for(int i=1; i<=9; i++) {
for(int j=(1 << ((int) log2(N))); j>=1; j>>=1) {
int count = 0;
for(int k=1; k<=N; k+=(j<<1)) {
for(int l=k; l<k+j; l++) {
if((k<<1) + (j<<1) - 1 - l <= N) {
count++;
schedule(l, k + k+(j<<1)-1 - l);
}
}
}
if(!count) continue;
vector<int> uni = visit();
}
}
vector<int> identity;
for(int i=1; i<=N; i++) identity.push_back(i);
answer(identity);
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |