oj.uz

Submission #712419

# Submission time Handle Problem Language Result Execution time Memory
712419 2023-03-18T18:43:02 Z noedit Zagrade (COI20_zagrade) C++17
0 / 100
 3000 ms 1320 KB 
#include <bits/stdc++.h>
//#include <quadmath.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//#define sz(x) (int)x.size()
//#define sqr(x) x*x
//#pragma GCC optimize("-O3")
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,sse4.1,sse4.2,popcnt,abm,mmx,avx,avx2,tune=native")
#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("no-stack-protector")
#pragma GCC optimize("fast-math")
using namespace std;
//using namespace __gnu_pbds;

#define int long long
//#define ld long double
//template <class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long ll;

bool ask(int l, int r)
{
    cout << "? " << l << " " << r << endl;
    int b;
    cin >> b;
    return b;
}

const int MAXN = 1e5 + 10;

bool check[MAXN];
char ans[MAXN];

void solve()
{
    int n, k;
    cin >> n >> k;
    int res = 0;
    queue<pair<int, int> > q;
    for (int i = 1; i < n; i++)
    {
        check[i] = ask(i, i + 1);
        if (check[i])
        {
            res++;
            ans[i] = '(';
            ans[i + 1] = ')';
            q.push({i, i + 1});
        }
    }
    if (res == 0)
    {
        for (int i = 1; i <= n / 2; i++) ans[i] = ')';
        for (int i = n / 2 + 1; i <= n; i++) ans[i] = '(';
    }
    else
    {
        while (!q.empty())
        {
            auto [l, r] = q.front();
            q.pop();
            if (l - 1 >= 1 && r + 1 <= n)
            {
                ans[l - 1] = '(';
                ans[r + 1] = ')';
                q.push({l - 1, r + 1});
            }
        }
    }
    cout << "! ";
    for (int i = 1; i <= n; i++) cout << ans[i];
}

signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int t;
    t = 1;
    //cin >> t;
    while (t--)
    {
        solve();
    }
    return 0;
}
/*
4 2 4
3 1 1 10
9 2 2 4
7 2 5 7
4 1 8 10
5 3
5 6
5 9
1 10
*/

/*
2 1 3
1 1 1 4
1 1 2 6
1 3
1 5
1 7
*/

/*
1 1 1
100000000 1 1 1
1 1
*/

/*
4 4
1 2 1 3
1 1
1 2
1 3
1 4
*/

Subtask #1
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Incorrect 8 ms 336 KB Mismatch at position 2. Expected ), found (
3 Halted 0 ms 0 KB -

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 4 ms 324 KB Output is correct
3 Incorrect 10 ms 332 KB Mismatch at position 3. Expected ), found (
4 Halted 0 ms 0 KB -

Subtask #3
0 / 57.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Execution timed out 3034 ms 1320 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #4
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 605 ms 588 KB Output is correct
3 Execution timed out 3057 ms 852 KB Time limit exceeded
4 Halted 0 ms 0 KB -