| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1351452 | ezzzay | Secret Permutation (RMI19_permutation) | C++20 | 0 ms | 420 KiB |
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#include "permutation.h"
void fun(vector<int> ans, vector<int> vis, vector<int>d, vector<int>v, int idx){
int n=v.size();
if(n==idx+1){
if(d[idx]== abs(ans.back()-ans[0])){
answer(ans);
}
return;
}
int c1=d[idx]+ans[idx];
int c2=ans[idx]-d[idx];
if(c1<=n and vis[c1]==0){
ans[idx+1]=c1;
vis[c1]=1;
fun(ans,vis,d,v,idx+1);
ans[idx+1]=vis[c1]=0;
}
if(c2>=1 and vis[c2]==0){
ans[idx+1]=c2;
vis[c2]=1;
fun(ans,vis,d,v,idx+1);
ans[idx+1]=vis[c2]=0;
}
}
void solve(int n){
vector<int>v;
for(int i=1;i<=n;i++)v.pb(i);
vector<int>ans(n),d(n),vis(n+1);
int s=0;
for(int i=0;i<n;i++){
int g=v[0];
v.erase(v.begin());
v.pb(g);
d[i]= query(v);
s+=d[i];
}
s/=n-1;
for(int i=0;i<n;i++)d[i]=s-d[i];
for(int i=1;i<=n;i++){
ans[0]=i;vis[i]=1;
fun(ans,vis,d,v,0);
ans[0]=vis[i]=0;
}
}컴파일 시 표준 에러 (stderr) 메시지
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
