Submission #381344

#	Time	Username	Problem	Language	Result	Execution time	Memory
381344		ne4eHbKa	Zagrade (COI20_zagrade)	C++17	0 / 100	1 ms	364 KiB

zagrade

#include <bits/stdc++.h>
using namespace std;
#ifndef _LOCAL
//#pragma GCC optimize("O3,Ofast")
#else
#pragma GCC optimize("O0")
#endif
template<typename t> inline void umin(t &a, const t b) {a = min(a, b);}
template<typename t> inline void umax(t &a, const t b) {a = max(a, b);}
typedef pair<int, int> pii;
typedef long long ll;
typedef long double ld;
typedef int8_t byte;
ll time() {return chrono::system_clock().now().time_since_epoch().count();}
mt19937 rnd(time());
#define ft first
#define sd second
#define len(f) int((f).size())
#define bnd(f) (f).begin(), (f).end()
#define _ <<' '<<
const int inf = 1e9 + 5;
const ll inf64 = 4e18 + 5;
const int md = 998244353;
namespace MD {
    void add(int &a, const int b) {if((a += b) >= md) a -= md;}
    void sub(int &a, const int b) {if((a -= b) < 0) a += md;}
    int prod(const int a, const int b) {return ll(a) * b % md;}
};

signed main() {
    ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
    int n, q;
    cin >> n >> q;
    int f[n];
    int k = 0;
    char ans[n];
    for(int i = 0; i < n; ++i) {
        f[k++] = i;
        if(k > 1) {
            cout << "? " << f[k - 2] + 1 _ f[k - 1] + 1 << endl;
            int res; cin >> res;
            if(res) {
                ans[f[k - 2]] = '(';
                ans[f[k - 1]] = ')';
                k -= 2;
            }
        }
    }
    for(int i = 0; i < k; ++i)
        ans[f[i]] = i + i < k ? '(' : ')';
    for(int i = 0; i < n; ++i) 
        cout << ans[i];
}

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