oj.uz

Submission #1107213

# Submission time Handle Problem Language Result Execution time Memory
1107213 2024-11-01T02:34:27 Z thieunguyenhuy Zagrade (COI20_zagrade) C++17
71 / 100
 783 ms 1448 KB 
#include <bits/stdc++.h>
using namespace std;

#define popcount(n) (__builtin_popcountll((n)))
#define clz(n) (__builtin_clzll((n)))
#define ctz(n) (__builtin_ctzll((n)))
#define lg(n) (63 - __builtin_clzll((n)))
#define BIT(n, i) (((n) >> (i)) & 1ll)
#define MASK(i) (1ll << (i))
#define FLIP(n, i) ((n) ^ (1ll << (i)))
#define ON(n, i) ((n) | MASK(i))
#define OFF(n, i) ((n) & ~MASK(i))

#define Int __int128
#define fi first
#define se second

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
typedef pair<long long, int> pli;
typedef pair<int, long long> pil;
typedef vector<pair<int, int>> vii;
typedef vector<pair<long long, long long>> vll;
typedef vector<pair<long long, int>> vli;
typedef vector<pair<int, long long>> vil;

template <class T1, class T2>
bool maximize(T1 &x, T2 y) {
    if (x < y) {
        x = y;
        return true;
    }
    return false;
}
template <class T1, class T2>
bool minimize(T1 &x, T2 y) {
    if (x > y) {
        x = y;
        return true;
    }
    return false;
}

template <class T>
void remove_duplicate(vector<T> &ve) {
    sort (ve.begin(), ve.end());
    ve.resize(unique(ve.begin(), ve.end()) - ve.begin());
}

mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
template <class T> T random(T l, T r) {
    return uniform_int_distribution<T>(l, r)(rng);
}
template <class T> T random(T r) {
    return rng() % r;
}

const int N = 1e6 + 5;
const int MOD = 1e9 + 7;
const int inf = 1e9;
const ll INF = 1e18;

int n, q, asked = 0;

int ask(int l, int r) {
    assert(++asked <= q);
    cout << "? " << l << ' ' << r << endl;
    int ret; cin >> ret; return ret;
}

signed main() {
    ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);

    cin >> n >> q;

    string ans(n, '('); for (int i = 0; i < n / 2; ++i) ans[i] = ')';

    stack<int> st;
    for (int i = 1; i <= n; ++i) {
        if (st.empty()) st.emplace(i);
        else {
            if (ask(st.top(), i)) {
                ans[st.top() - 1] = '(', ans[i - 1] = ')';
                st.pop();
            }
            else st.emplace(i);
        }
    }

    cout << "! " << ans << endl;
    cerr << '\n'; return 0;
}

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 4 ms 336 KB Output is correct
3 Correct 7 ms 460 KB Output is correct
4 Correct 7 ms 336 KB Output is correct
5 Correct 7 ms 336 KB Output is correct
6 Correct 7 ms 460 KB Output is correct
7 Correct 6 ms 336 KB Output is correct
8 Correct 6 ms 336 KB Output is correct

Subtask #2
0 / 7.0

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

Subtask #3
57.0 / 57.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 377 ms 548 KB Output is correct
3 Correct 783 ms 548 KB Output is correct
4 Correct 775 ms 552 KB Output is correct
5 Correct 758 ms 548 KB Output is correct
6 Correct 754 ms 544 KB Output is correct
7 Correct 754 ms 1448 KB Output is correct
8 Correct 760 ms 560 KB Output is correct

Subtask #4
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 727 ms 1320 KB Output is correct
3 Incorrect 736 ms 1076 KB Mismatch at position 49727. Expected (, found )
4 Halted 0 ms 0 KB -