oj.uz

Submission #641139

# Submission time Handle Problem Language Result Execution time Memory
641139 2022-09-16T04:57:01 Z andecaandeci Zagrade (COI20_zagrade) C++17
100 / 100
 861 ms 1520 KB 
#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define db double
#define pairll pair<ll,ll>
#define lpairll pair<ll,pairll>

#define repp(i,a,b) for (ll i = a; i <= b; i++)
#define repz(i,a,b) for (ll i = a; i < b; i++)
#define repm(i,a,b) for (ll i = a; i >= b; i--)
#define fr first
#define sc second
#define mp make_pair
#define pb push_back

const ll N = 1e5+5, MOD = 1e9+7;
ll tc = 1, n, m, fnd[N];
ll x, y, k;
string s, s1, s2, ye = "YES", no = "NO";
char cr[N];

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

int main(){
  ios_base::sync_with_stdio(0);
  cin.tie(NULL);
  cout.tie(NULL);
  cin >> n >> k;
  vector<ll> ntbgt;
  ntbgt.pb(1);
  cr[1] = '(';
  repp(i,2,n){
    ll a1;
    if (ntbgt.size() && ask(ntbgt.back(),i)){
      cr[i] = ')';
      ntbgt.pop_back();
    }
    else{
      cr[i] = '(';
      ntbgt.pb(i);
    }
  }
  ll sz = ntbgt.size()/2;
  repz(i,0,sz){
    cr[ntbgt[i]] = ')';
  }
  cout << "! ";
  for (ll i = 1; i <= n; i++){
    cout << cr[i];
  }
  cout << endl;
}

Compilation message

zagrade.cpp: In function 'int main()':
zagrade.cpp:37:8: warning: unused variable 'a1' [-Wunused-variable]
   37 |     ll a1;
      |        ^~

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 5 ms 208 KB Output is correct
3 Correct 8 ms 208 KB Output is correct
4 Correct 8 ms 208 KB Output is correct
5 Correct 10 ms 208 KB Output is correct
6 Correct 10 ms 216 KB Output is correct
7 Correct 9 ms 208 KB Output is correct
8 Correct 9 ms 208 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 10 ms 332 KB Output is correct
3 Correct 12 ms 328 KB Output is correct
4 Correct 8 ms 336 KB Output is correct
5 Correct 7 ms 208 KB Output is correct
6 Correct 11 ms 336 KB Output is correct
7 Correct 10 ms 328 KB Output is correct
8 Correct 4 ms 208 KB Output is correct

Subtask #3
57.0 / 57.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 419 ms 340 KB Output is correct
3 Correct 674 ms 464 KB Output is correct
4 Correct 836 ms 572 KB Output is correct
5 Correct 856 ms 520 KB Output is correct
6 Correct 525 ms 532 KB Output is correct
7 Correct 787 ms 1060 KB Output is correct
8 Correct 856 ms 640 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 554 ms 1520 KB Output is correct
3 Correct 580 ms 704 KB Output is correct
4 Correct 828 ms 1024 KB Output is correct
5 Correct 829 ms 740 KB Output is correct
6 Correct 742 ms 1128 KB Output is correct
7 Correct 705 ms 888 KB Output is correct
8 Correct 861 ms 600 KB Output is correct