Submission #381400

#	Time	Username	Problem	Language	Result	Execution time	Memory
381400		Vimmer	Zagrade (COI20_zagrade)	C++14	14 / 100	3081 ms	17064 KiB

zagrade

#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 200500
#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 n, q;

unordered_map <int, int> mp[N];

int ask(int l, int r)
{
    if (mp[l].find(r) != mp[l].end())
        return mp[l][r];

    q--;

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

    pri("?" _ l _ r);

    int x;

    cin >> x;

    mp[l][r] = 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 = 1; i <= n; i++)
        ans[i] = 'a';

    int kl = n;

    for (int i = 1; i <= n; i++)
    {
        if (i == n && kl > 0)
        {
            i = 0;

            continue;
        }

        if (ans[i] != 'a') continue;

        for (int j = i + 1; j <= n; j += 2)
        {
            if (ans[j] != 'a') continue;

            if (ask(i, j))
            {
                kl -= 2;

                ans[i] = '(';

                ans[j] = ')';
            }

            break;
        }
    }

    cout << "! ";

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

    cout << endl;
}

• Subtask 1: 14 / 14
• Subtask 2: 0 / 7
• Subtask 3: 0 / 57
• Subtask 4: 0 / 22