Submission #1159991

#	Time	Username	Problem	Language	Result	Execution time	Memory
1159991		steveonalex	Zagrade (COI20_zagrade)	C++20	71 / 100	262 ms	5524 KiB

zagrade

#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
 
#define MASK(i) (1ULL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()
 
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
ll gcd(ll a, ll b){return __gcd(a, b);}
ll lcm(ll a, ll b){return a / gcd(a, b) * b;}
 
ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ull mask){return __builtin_popcountll(mask);}
int ctz(ull mask){return __builtin_ctzll(mask);}
int logOf(ull mask){return 63 - __builtin_clzll(mask);}
 
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
//mt19937_64 rng(1);
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}
double rngesus_d(double l, double r){
    double wow = (double) ((ull) rng()) / ((ull)(0-1));
    return wow * (r - l) + l;
}
 
template <class T1, class T2>
    bool maximize(T1 &a, T2 b){
        if (a < b) {a = b; return true;}
        return false;
    }
 
template <class T1, class T2>
    bool minimize(T1 &a, T2 b){
        if (a > b) {a = b; return true;}
        return false;
    }
 
template <class T>
    void printArr(T container, string separator = " ", string finish = "\n", ostream &out = cout){
        for(auto item: container) out << item << separator;
        out << finish;
    }
 
template <class T>
    void remove_dup(vector<T> &a){
        sort(ALL(a));
        a.resize(unique(ALL(a)) - a.begin());
    }

int ask(int i, int j){
    cout << "? " << i << " " << j << endl;
    int ans; cin >> ans;
    return ans;
}

void solve(){
    int n, q; cin >> n >> q;
    set<int> S;
    for(int i = 1; i <= n; ++i) S.insert(i);

    vector<int> ans(n+1, -1);

    int cnt[2]; cnt[0] = cnt[1] = n/2;
    for(int i = 1; i <= n; ++i){
        auto it = S.lower_bound(i);
        if (it == S.begin()) continue;

        it--;

        int j = *it;
        int cur = ask(j, i);
        if (cur){
            S.erase(j); S.erase(i);
            ans[j] = 0;
            ans[i] = 1;
            cnt[0]--;
            cnt[1]--;
        }
    }

    for(int i = 1; i <= n; ++i) if (ans[i] == -1){
        if (cnt[0] > 0){
            ans[i] = 0;
            cnt[0]--;
        }
        else{
            ans[i] = 1;
        }
    }

    string output_string;
    for(int i = 1; i <= n; ++i){
        if (ans[i] == 0) output_string.push_back('(');
        else output_string.push_back(')');
    }

    cout << "! " << output_string << endl;
}

int main(void){
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    clock_t start = clock();

    solve();


    cerr << "Time elapsed: " << clock() - start << "ms!\n";
    return 0;
}

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