oj.uz

Submission #640293

# Submission time Handle Problem Language Result Execution time Memory
640293 2022-09-14T06:00:30 Z christinelynn Zagrade (COI20_zagrade) C++17
57 / 100
 1589 ms 716 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<ll> vll;
const ll mod=1e9+7;
const ll maxn=1e5+5;
const int INF=1e9+5;
#define ok ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define fi first
#define se second
#define pb push_back
#define ub upper_bound
#define lb lower_bound
#define endl '\n'
int bk, ttp, jwb, rem;
map<int, int> mp;
stack<int> st;
ll n, q;
char ans[maxn];
int main() {
    ok
    cin >> n >> q;
    if(q==(n*n)/4) {
        rem=0;
        for(int i=1; i<n; i++) {
            for(int j=i+1; j<=n; j+=2) {
                cout << "? " << i << " " << j << endl;
                cout.flush();
                cin >> jwb;
                if(jwb==1) {
                    mp[i]=1;
                    mp[j]=2;
                }
            }
        }
        for(int i=1; i<=n; i++) {
            if(!mp.count(i)) {
                rem++;
            }
        }
        rem/=2;
        for(int i=1; i<=n; i++) {
            if(rem && !mp.count(i)) {
                mp[i]=2;
                rem--;
            } else if(!mp.count(i)) mp[i]=1;
        }
        cout << "! ";
        for(int i=1; i<=n; i++) {
            if(mp[i]==1) cout << '(';
            else cout << ')';
        }
        cout << endl;
        return 0;
    }
    for(int i=1; i<=n; i++) {
        if(st.empty()) {
            ans[i]='(';
            st.push(i);
            continue;
        }
        cout << "? " << st.top() << " " << i << endl;
        cout.flush();
        cin >> jwb;
        if(jwb==1) {
            ans[i]=')';
            st.pop();
        } else {
            ans[i]='(';
            st.push(i);
        }
    }
    cout << "! ";
    for(int i=1; i<=n; i++) {
        cout << ans[i];
    }
    cout << endl;
    return 0;
}

Subtask #1
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Runtime error 1465 ms 344 KB Execution killed with signal 13
3 Halted 0 ms 0 KB -

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Runtime error 1589 ms 300 KB Execution killed with signal 13
3 Halted 0 ms 0 KB -

Subtask #3
57.0 / 57.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 413 ms 484 KB Output is correct
3 Correct 895 ms 632 KB Output is correct
4 Correct 484 ms 580 KB Output is correct
5 Correct 775 ms 588 KB Output is correct
6 Correct 792 ms 620 KB Output is correct
7 Correct 846 ms 716 KB Output is correct
8 Correct 849 ms 488 KB Output is correct

Subtask #4
0 / 22.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 208 KB Mismatch at position 1. Expected ), found (
2 Halted 0 ms 0 KB -