oj.uz

Submission #685391

# Submission time Handle Problem Language Result Execution time Memory
685391 2023-01-24T09:31:34 Z annie2018 Secret Permutation (RMI19_permutation) C++17
0 / 100
 1 ms 208 KB 
#include <bits/stdc++.h>
#include "permutation.h"
using namespace std;
vector <int> ans;
void check2(vector<int>&q, int n)
{
    vector<int> a(n);
    for (int i=1; i<=n; i++)
        a[i-1]=i;
    do
    {
        bool mark = 1;
        for (int i=0; i<n-1; i++)
            if (abs(a[i]-a[i+1])!=q[i]) mark = 0;
        if (abs(a[0]-a[n-1]) != q[n - 1]) mark = 0;
        if (mark){
            /*for (int i = 0; i < n; i++)
                cout << a[i] << ' ';
            cout << "\n";*/
            ans = a;
            return;
        }
    }while (next_permutation(a.begin(), a.end()));
}

void solve(int n) {

    vector<int> v;
    for (int i=1; i<=n; i++)
        v.push_back(i);
    vector<int> q(n);
    for(int i=0;i<n;i++){
        q[i] = query(v);
        rotate(v.begin(),v.begin()+1,v.end());
    }
   // rotate(v.begin(),v.begin()+1,v.end());
    int sum=0;
    for(int i=0;i<n;i++){
        sum+=q[i];
    }
    sum/=(n-1);
    for(int i=0;i<n;i++) q[i]=(sum-q[i]);
    rotate(q.begin(),q.begin()+1,q.end());
    /*for (int i = 0; i < n; i++)
        cout << q[i] << ' ';
    cout << "\n";*/
    ans.assign(n, 0);
    check2(q, n);
    answer(ans);
}

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]
   15 |   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]
   48 |   fscanf(stdin, "%d", &N);
      |   ~~~~~~^~~~~~~~~~~~~~~~~

Subtask #1
0.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Incorrect 1 ms 208 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Incorrect 1 ms 208 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Incorrect 1 ms 208 KB Output isn't correct
3 Halted 0 ms 0 KB -