oj.uz

답안 #1034852

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1034852 2024-07-25T20:13:17 Z TB_ Zagrade (COI20_zagrade) C++17
100 / 100
 594 ms 2084 KB 
#include <bits/stdc++.h>
using namespace std;

// #undef _GLIBCXX_DEBUG                // disable run-time bound checking, etc
// #pragma GCC optimize("Ofast,inline") // Ofast = O3,fast-math,allow-store-data-races,no-protect-parens
// #pragma GCC optimize ("unroll-loops")

// #pragma GCC target("bmi,bmi2,lzcnt,popcnt")                      // bit manipulation
// #pragma GCC target("movbe")                                      // byte swap
// #pragma GCC target("aes,pclmul,rdrnd")                           // encryption
// #pragma GCC target("avx,avx2,f16c,fma,sse3,ssse3,sse4.1,sse4.2") // SIMD

// #include <bits/extc++.h>
// using namespace __gnu_pbds;
// template<class T>using ordered_set = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;
// template<class T>using ordered_multiset = tree<T, null_type, less_equal<T>, rb_tree_tag,tree_order_statistics_node_update>;

#define ll long long
#define INF ((ll)(1e9+7))
#define fo(i, n) for(ll i=0;i<((ll)n);i++)
#define deb(x) cout << #x << " = " << (x) << endl;
#define deb2(x, y) cout << #x << " = " << (x) << ", " << #y << " = " << (y) << endl
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define LSOne(S) ((S) & (-S))
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
inline int readint(){ int v = 0; char c; while((c = getchar()) != EOF && c != ' ' && c != '\n'){ v *= 10; v += c - '0'; } return v; }
inline int readintsigned() { int v = 0; int sign = 1; char c = getchar(); if (c == '-') { sign = -1; } else { v += c - '0'; } while ((c = getchar()) != EOF && c != ' ' && c != '\n') { v *= 10; v += c - '0'; } return v * sign; }
inline string readstring() { string s; char c; while ((c = getchar()) != EOF && c != '\n' && c != ' ') { s.push_back(c); } return s; }
template <class result_t=std::chrono::milliseconds,class clock_t=std::chrono::steady_clock,class duration_t = std::chrono::milliseconds>
auto since(std::chrono::time_point<clock_t, duration_t> const& start){return std::chrono::duration_cast<result_t>(clock_t::now() - start);}
typedef pair<int, int> pii;
typedef pair<ll, ll> pl;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<pii> vpii;
typedef vector<pl> vpl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef vector<vpii> vvpii;
typedef vector<vpl> vvpl;



int main() {
    // cout << fixed << setprecision(20);
    // auto start = std::chrono::steady_clock::now(); // since(start).count()
    cin.tie(0)->sync_with_stdio(0);

    int n, q;
    cin >> n >> q;
    string ans(n, '-');
    vl open = {1};
    ll am = n/2;
    fo(i, n-1){
        // deb(ans.size());
        if(!open.size()){
            open.pb(i+2);
            continue;
        }
        cout << "? " << open[open.size()-1] << " " << i+2 << endl;
        ll res;
        cin >> res;
        if(res){
            ans[open[open.size()-1]-1] = '(';
            ans[i+1] = ')';
            am--;
            open.pop_back();
        }else open.pb(i+2);
    }
    fo(i, n){
        if(ans[i] == '-'){
            if(am){
                ans[i] = ')';
                am--;
            }
            else ans[i] = '(';
        }
    }
    cout << "! " << ans << endl;

    return 0;
}

Subtask #1
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 2 ms 344 KB Output is correct
3 Correct 4 ms 344 KB Output is correct
4 Correct 5 ms 344 KB Output is correct
5 Correct 4 ms 344 KB Output is correct
6 Correct 6 ms 344 KB Output is correct
7 Correct 4 ms 448 KB Output is correct
8 Correct 4 ms 344 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 4 ms 456 KB Output is correct
3 Correct 5 ms 344 KB Output is correct
4 Correct 4 ms 600 KB Output is correct
5 Correct 5 ms 344 KB Output is correct
6 Correct 4 ms 344 KB Output is correct
7 Correct 6 ms 456 KB Output is correct
8 Correct 5 ms 340 KB Output is correct

Subtask #3
57.0 / 57.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 258 ms 524 KB Output is correct
3 Correct 582 ms 524 KB Output is correct
4 Correct 535 ms 524 KB Output is correct
5 Correct 552 ms 528 KB Output is correct
6 Correct 528 ms 528 KB Output is correct
7 Correct 524 ms 1304 KB Output is correct
8 Correct 590 ms 524 KB Output is correct

Subtask #4
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 596 KB Output is correct
2 Correct 534 ms 2084 KB Output is correct
3 Correct 557 ms 1384 KB Output is correct
4 Correct 594 ms 1736 KB Output is correct
5 Correct 565 ms 1424 KB Output is correct
6 Correct 543 ms 1636 KB Output is correct
7 Correct 535 ms 1500 KB Output is correct
8 Correct 557 ms 788 KB Output is correct