oj.uz

Submission #821495

# Submission time Handle Problem Language Result Execution time Memory
821495 2023-08-11T10:53:40 Z stefanopulos Zagrade (COI20_zagrade) C++17
100 / 100
 1185 ms 1756 KB 
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <bits/stdc++.h>
 
using namespace std;
using namespace __gnu_pbds;
 
typedef long long ll;
typedef long double ldb;
 
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<ldb,ldb> pdd;

#define ff(i,a,b) for(int i = a; i <= b; i++)
#define fb(i,b,a) for(int i = b; i >= a; i--)
#define trav(a,x) for(auto& a : x)
 
#define sz(a) (int)(a).size()
#define fi first
#define se second
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
 
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

template<typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

// os.order_of_key(k) the number of elements in the os less than k
// *os.find_by_order(k)  print the k-th smallest number in os(0-based)

const int mod = 1000000007;
const int inf = 1e9 + 5;
const int mxN = 100005; 

int n, q;

int L[mxN];
int R[mxN];

int res[mxN];

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


int main(){
    cin.tie(0)->sync_with_stdio(0);

    cin >> n >> q;

    ff(i,1,n){
        L[i] = i - 1;
        R[i] = i + 1;
    }

    int l = 1; int br = 0;
    while(1){
        
        bool ok = 0;
        ff(i,l,n - 1){
            if(!res[i] && R[i] <= n && ask(i, R[i])){
                res[i] = 1; res[R[i]] = 2; br += 2;

                int j = R[i];
                R[L[i]] = R[j];
                L[R[j]] = L[i];
                l = max(1, L[i]);

                ok = 1; 
                break;
            }
        }

        if(!ok)break;

    }

    int ost = (n - br) / 2;
    ff(i,1,n){
        if(res[i])continue;
        if(ost > 0)res[i] = 2, ost -= 1;
        else res[i] = 1;
    }

    cout << "! ";
    ff(i,1,n)cout << (res[i] == 1 ? '(' : ')');
    cout << endl;

    return 0;
}
/*



// probati bojenje sahovski
*/

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 4 ms 336 KB Output is correct
3 Correct 5 ms 336 KB Output is correct
4 Correct 5 ms 348 KB Output is correct
5 Correct 7 ms 336 KB Output is correct
6 Correct 5 ms 340 KB Output is correct
7 Correct 9 ms 352 KB Output is correct
8 Correct 7 ms 336 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 9 ms 344 KB Output is correct
3 Correct 9 ms 336 KB Output is correct
4 Correct 9 ms 340 KB Output is correct
5 Correct 9 ms 384 KB Output is correct
6 Correct 7 ms 348 KB Output is correct
7 Correct 4 ms 336 KB Output is correct
8 Correct 3 ms 340 KB Output is correct

Subtask #3
57.0 / 57.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 1185 ms 1476 KB Output is correct
3 Correct 483 ms 1456 KB Output is correct
4 Correct 566 ms 1412 KB Output is correct
5 Correct 549 ms 1428 KB Output is correct
6 Correct 640 ms 1452 KB Output is correct
7 Correct 553 ms 1508 KB Output is correct
8 Correct 542 ms 1588 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 645 ms 1468 KB Output is correct
3 Correct 514 ms 1480 KB Output is correct
4 Correct 594 ms 1576 KB Output is correct
5 Correct 668 ms 1484 KB Output is correct
6 Correct 668 ms 1756 KB Output is correct
7 Correct 767 ms 1544 KB Output is correct
8 Correct 650 ms 1444 KB Output is correct