oj.uz

답안 #144674

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
144674 2019-08-17T11:51:48 Z SamAnd Zagonetka (COI18_zagonetka) C++17
9 / 100
 64 ms 376 KB 
#include <bits/stdc++.h>
using namespace std;
const int N = 102;

int n;
int a[N];

int minu[N], maxu[N];

bool qry(int a[])
{
    cout << "query";
    for (int k = 1; k <= n; ++k)
        cout << ' ' << a[k];
    cout << endl;
    int x;
    cin >> x;
    return x;
}

void endf(int i, int j)
{
    if (a[i] < a[j])
    {
        for (int k = 1; k <= n; ++k)
            minu[k] = k;
        int z = n + 1;
        for (int k = 1; k <= n; ++k)
        {
            if (k == i)
            {
                maxu[j] = --z;
                minu[k] = --z;
                continue;
            }
            if (k == j)
            {
                continue;
            }
            maxu[k] = --z;
        }
    }
    else
    {
        int z = 0;
        for (int k = 1; k <= n; ++k)
        {
            if (k == i)
            {
                minu[j] = ++z;
                minu[k] = ++z;
                continue;
            }
            if (k == j)
            {
                continue;
            }
            minu[k] = ++z;
        }
        for (int k = 1; k <= n; ++k)
            maxu[k] = n - k + 1;
    }
    cout << "end" << endl;
    for (int i = 1; i <= n; ++i)
        cout << minu[i] << ' ';
    cout << endl;
    for (int i = 1; i <= n; ++i)
        cout << maxu[i] << ' ';
    cout << endl;
}

int c[N];
int main()
{
    cin >> n;
    for (int i = 1; i <= n; ++i)
        cin >> a[i];
    if (n <= 6)
    {
        for (int i = 1; i <= n; ++i)
            minu[i] = maxu[i] = a[i];
        sort(a + 1, a + n + 1);
        do
        {
            if (qry(a))
            {
                for (int i = 1; i <= n; ++i)
                {
                    if (a[i] == minu[i])
                        continue;
                    if (a[i] < minu[i])
                    {
                        for (int j = 1; j <= n; ++j)
                            minu[j] = a[j];
                    }
                    break;
                }
                for (int i = 1; i <= n; ++i)
                {
                    if (a[i] == maxu[i])
                        continue;
                    if (a[i] > maxu[i])
                    {
                        for (int j = 1; j <= n; ++j)
                            maxu[j] = a[j];
                    }
                    break;
                }
            }
        } while (next_permutation(a + 1, a + n + 1));
        cout << "end" << endl;
        for (int i = 1; i <= n; ++i)
            cout << minu[i] << ' ';
        cout << endl;
        for (int i = 1; i <= n; ++i)
            cout << maxu[i] << ' ';
        cout << endl;
    }
    else
    {
        int qq = 0;
        for (int i = 1; i <= n; ++i)
        {
            for (int j = i + 1; j <= n; ++j)
            {
                swap(a[i], a[j]);
                if (qry(a) == 0)
                {
                    ++qq;
                    c[i]++;
                    c[j]++;
                }
                swap(a[i], a[j]);
            }
        }
        int ii = -1, jj = -1;
        for (int i = 1; i <= n; ++i)
        {
            if (c[i] == qq)
            {
                if (ii == -1)
                    ii = i;
                else
                    jj = i;
            }
        }
        endf(ii, jj);
    }
    return 0;
}

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 248 KB Output is correct
3 Correct 4 ms 248 KB Output is correct
4 Correct 3 ms 248 KB Output is correct
5 Correct 9 ms 376 KB Output is correct
6 Correct 6 ms 248 KB Output is correct
7 Correct 7 ms 376 KB Output is correct

Subtask #2
0 / 18.0

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

Subtask #3
0 / 22.0

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

Subtask #4
0 / 51.0

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