oj.uz

Submission #144580

# Submission time Handle Problem Language Result Execution time Memory
144580 2019-08-17T08:47:03 Z SamAnd Zagonetka (COI18_zagonetka) C++17
9 / 100
 3000 ms 376 KB 
#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 qry(int a[])
{
    cout << "query";
    for (int k = 1; k <= n; ++k)
        cout << ' ' << a[k];
    cout << endl;
    int x;
    cin >> x;
    return x;
}

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]);
            if (qry(a) == 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;
                }
            }
            swap(a[i], a[j]);
        }
    }*/
    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;
    return 0;
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 2 ms 248 KB Output is correct
3 Correct 3 ms 376 KB Output is correct
4 Correct 3 ms 248 KB Output is correct
5 Correct 7 ms 248 KB Output is correct
6 Correct 10 ms 376 KB Output is correct
7 Correct 9 ms 248 KB Output is correct

Subtask #2
0 / 18.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3050 ms 248 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 22.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3049 ms 248 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 51.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3003 ms 248 KB Time limit exceeded
2 Halted 0 ms 0 KB -