oj.uz

Submission #381381

# Submission time Handle Problem Language Result Execution time Memory
381381 2021-03-25T07:10:58 Z Vimmer Zagrade (COI20_zagrade) C++14
0 / 100
 3000 ms 1280 KB 
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>

//#pragma GCC optimize("-O3")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("-Ofast")

#define N 100500
#define NN 1005000
#define PB push_back
//#define endl '\n'
#define pri(x) cout << x << endl
#define _ << " " <<
#define all(x) x.begin(), x.end()
#define sz(x) int(x.size())
#define M ll(1e9 + 7)
#define F first
#define S second

using namespace std;
//using namespace __gnu_pbds;

typedef long long ll;
typedef long double ld;
typedef short int si;
typedef unsigned long long ull;

//typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;

//ordered_set se;

void TL()
{
    while (1)
    {

    }
}

int nx[N], ls[N], n, q;

int ask(int l, int r)
{
    q--;

    if (q == -1)
        TL();

    pri("?" _ l _ r);

    int x;

    cin >> x;

    return x;
}


char ans[N];

int main()
{
    ios_base::sync_with_stdio(0); istream::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    //freopen("1.in", "r", stdin);

    cin >> n >> q;

    for (int i = 2; i <= n; i++)
        ls[i] = i - 1;

    nx[n] = ls[1] = -1;

    for (int i = 1; i < n; i++)
        nx[i] = i + 1;

    for (int i = 1; i <= n; i++)
        ans[i] = 'a';

    int beg = 1;

    while (1)
    {
        while (beg <= n && ans[beg] != 'a')
            beg++;

        if (beg > n)
            break;

        int cur = beg;

        int nxt = cur + 1;

        while (nxt <= n && ans[nxt] != 'a')
            nxt++;

        while (1)
        {
            if (ask(cur, nxt))
            {
                ans[cur] = '(';

                ans[nxt] = ')';

                cur = nxt + 1;

                while (cur <= n && ans[cur] != 'a')
                    cur++;

                nxt = cur + 1;

                while (nxt <= n && ans[nxt] != 'a')
                    nxt++;

                if (nxt > n)
                    break;
            }

            cur = nxt;

            nxt++;

            while (nxt <=n && ans[nxt] != 'a')
                nxt++;

            if (nxt > n)
                break;
        }

//        while (cur != -1)
//        {
//            int l = cur, r = nx[cur];
//
//            if (r == -1)
//                break;
//
//            if (l < 1 || n < l)
//                TL();
//
//            if (r < 1 || n < r)
//                TL();
//
//            if (ans[l] == 'a' && ans[r] == 'a' && ask(l, r))
//            {
//                ans[l] = '(';
//
//                ans[r] = ')';
//
//                int lst = ls[l];
//
//                int nxt = nx[r];
//
//                if (lst != -1)
//                    nx[lst] = nxt;
//
//                if (nxt != -1)
//                    ls[nxt] = lst;
//
//                cur = r;
//            }
//            else
//            cur = r;
//        }
    }

    cout << "! ";

    for (int i = 1; i <= n; i++)
        cout << ans[i];

    cout << endl;
}

Subtask #1
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 7 ms 364 KB Output is correct
3 Correct 11 ms 364 KB Output is correct
4 Correct 25 ms 364 KB Output is correct
5 Correct 41 ms 364 KB Output is correct
6 Correct 86 ms 364 KB Output is correct
7 Runtime error 1973 ms 364 KB Execution killed with signal 13
8 Halted 0 ms 0 KB -

Subtask #2
0 / 7.0

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

Subtask #3
0 / 57.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 733 ms 1280 KB Output is correct
3 Execution timed out 3026 ms 1260 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #4
0 / 22.0

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