제출 #144571

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
144571		SamAnd	Zagonetka (COI18_zagonetka)	C++17	0 / 100	11 ms	376 KiB

zagonetka

#include <bits/stdc++.h>
using namespace std;
const int N = 102;

int n;
int a[N];

int b[N][N];

int minu[N], maxu[N];

bool stg(int a[], int i)
{
    for (int j = 1; j <= n; ++j)
    {
        if (b[i][j])
        {
            if (b[i][j] == -1 && a[i] > a[j])
                return false;
            if (b[i][j] == 1 && a[i] < a[j])
                return false;
        }
    }
    return true;
}

int main()
{
    cin >> n;
    for (int i = 1; i <= n; ++i)
        cin >> a[i];
    for (int i = 1; i <= n; ++i)
    {
        for (int j = i + 1; j <= n; ++j)
        {
            swap(a[i], a[j]);
            cout << "query";
            for (int k = 1; k <= n; ++k)
                cout << ' ' << a[i];
            cout << endl;
            swap(a[i], a[j]);
            int x;
            cin >> x;
            if (x == 0)
            {
                if (a[i] < a[j])
                {
                    b[i][j] = -1;
                    b[j][i] = 1;
                }
                if (a[i] > a[j])
                {
                    b[i][j] = 1;
                    b[j][i] = -1;
                }
            }
        }
    }
    for (int i = 1; i <= n; ++i)
        minu[i] = a[i];
    while (1)
    {
        bool z = false;
        for (int i = 1; i <= n; ++i)
        {
            for (int j = i + 1; j <= n; ++j)
            {
                if (minu[i] > minu[j])
                {
                    swap(minu[i], minu[j]);
                    if (stg(minu, i) && stg(minu, j))
                    {
                        z = true;
                        continue;
                    }
                    swap(minu[i], minu[j]);
                }
            }
        }
        if (!z)
            break;
    }
    for (int i = 1; i <= n; ++i)
        maxu[i] = a[i];
    while (1)
    {
        bool z = false;
        for (int i = 1; i <= n; ++i)
        {
            for (int j = i + 1; j <= n; ++j)
            {
                if (maxu[i] < maxu[j])
                {
                    swap(maxu[i], maxu[j]);
                    if (stg(maxu, i) && stg(maxu, j))
                    {
                        z = true;
                        continue;
                    }
                    swap(maxu[i], maxu[j]);
                }
            }
        }
        if (!z)
            break;
    }
    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;
    return 0;
}

• Subtask 1: 0 / 9
• Subtask 2: 0 / 18
• Subtask 3: 0 / 22
• Subtask 4: 0 / 51