oj.uz

답안 #259544

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
259544 2020-08-08T02:01:36 Z dantoh000 Secret Permutation (RMI19_permutation) C++14
0 / 100
 0 ms 256 KB 
#include <bits/stdc++.h>
#include "permutationc.h"
using namespace std;
int N;
int d[257];
int vis[257];
int P[257];
bool findperm(int id){
    if (id == N) return true;
    int last = P[id-1];
    int dif = d[id];
    //printf("%d: %d +- %d\n",id,last,dif);
    int cur = last+dif;
    if (cur >= 1 && cur <= N && !vis[cur]){
        P[id] = cur;
        vis[cur] = 1;
        if (findperm(id+1)) return true;
        vis[cur] = 0;
        P[id] = 0;
    }
    cur = last-dif;
    if (cur >= 1 && cur <= N && !vis[cur]){
        P[id] = cur;
        vis[cur] = 1;
        if (findperm(id+1)) return true;
        vis[cur] = 0;
        P[id] = 0;
    }
    return false;
}
int Query(vector<int> q){
    int a[N];
    for (int i = 0; i < N; i++){
        a[i] = q[i];
    }
    return query(a);
}
void Answer(vector<int> q){
    int a[N];
    for (int i = 0; i < N; i++){
        a[i] = q[i];
    }
    answer(a);
}
void solve(int _N){
    N = _N;
    vector<int> q;
    for (int i = 1; i <= N; i++){
        q.push_back(i);
    }
    d[N] = Query(q);
    for (int j = N-1; j >= 1; j--){
        q.insert(q.begin(),q.back());
        q.pop_back();
        d[j] = Query(q);
    }
    int sum = 0;
    for (int i = 1; i <= N; i++){
        sum += d[i];
    }
    assert(sum % (N-1) == 0);
    sum /= N-1;
    for (int i = 1; i <= N; i++){
        d[i] = sum-d[i];
        //printf("%d ",d[i]);
        //assert(d[i] == abs(ans[i-1]-ans[i%N]));
    }
    //printf("\n");
    for (int i = 1; i <= N; i++){
        vis[i] = 1;
        P[0] = i;
        if (findperm(1)){
            vector<int> ANS;
            for (int i = 0; i < N; i++) ANS.push_back(P[i]);
            Answer(ANS);
            return;
        }
        vis[i] = 0;
    }
}

Compilation message

stub.cpp: In function 'int query(int*)':
stub.cpp:15:9: warning: ignoring return value of 'int fscanf(FILE*, const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   fscanf(stdin, "%d", &x);
   ~~~~~~^~~~~~~~~~~~~~~~~
stub.cpp: In function 'int main(int, char**)':
stub.cpp:48:9: warning: ignoring return value of 'int fscanf(FILE*, const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   fscanf(stdin, "%d", &N);
   ~~~~~~^~~~~~~~~~~~~~~~~

Subtask #1
0.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 256 KB Output is correct
2 Incorrect 0 ms 256 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 256 KB Output is correct
2 Incorrect 0 ms 256 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 256 KB Output is correct
2 Incorrect 0 ms 256 KB Output isn't correct
3 Halted 0 ms 0 KB -