oj.uz

Submission #384026

# Submission time Handle Problem Language Result Execution time Memory
384026 2021-03-31T08:19:35 Z shashwatchandra Zagrade (COI20_zagrade) C++17
71 / 100
 1160 ms 872 KB 
/*input

*/
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;

#define int long long 
#define double long double
#define f first
#define s second
#define mp make_pair
#define pb push_back

#define RE(i,n) for (int i = 1; i <= n; i++)
#define REP(i,n) for (int i = 0; i < (int)n; i++)

#define all(v) v.begin(),v.end()
#define print(arr) for (auto it = arr.begin(); it != arr.end(); ++it) cout << *it << " "; cout << endl;

typedef tree<
int,
null_type,
less<int>,
rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;

const int INF = 1e18+1;
const int MOD = 1e9+7;
const double PI = 3.14159265358979323846264338;

int raise(int a,int n,int m = MOD){
  if(n == 0)return 1;
  if(n == 1)return a;
  int x = 1;
    x *= raise(a,n/2,m);
    x %= m;
    x *= x;
    x %= m;
    if(n%2)x*= a;
    x %= m;
    return x;
}

int query(int a,int b){
	cout << "? " << a << " " << b << endl;
	int x;cin >> x;return x;
}

const int N = 1e5+1;
bool ans[N];

void solve(){
  	int n,q;cin >> n >> q;
  	int i = 1;
  	int j = 2;
  	stack<int> open;
  	open.push(1);
  	while(j <= n){
  		int u = open.top();
  		if(query(u,j)){
  			open.pop();
  			ans[j] = 1;
  		}
  		else{
  			open.push(j);
  		}
  		if(open.size()){
  			j++;
  		}
  		else{
  			open.push(j+1);
  			j += 2;
  		}
  	}
  	cout << "! ";
  	RE(i,n){
  		if(ans[i])cout << ')';
  		else cout << '(';
  	}
  	cout << endl;
}

signed main(){
  ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
  //freopen(".in","r",stdin);freopen(".out","w",stdout);
  int t = 1;
  //cin >> t;
  while(t--){
    solve();
  }
  return 0;
}

Compilation message

zagrade.cpp: In function 'void solve()':
zagrade.cpp:58:8: warning: unused variable 'i' [-Wunused-variable]
   58 |    int i = 1;
      |        ^

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 5 ms 364 KB Output is correct
3 Correct 11 ms 364 KB Output is correct
4 Correct 10 ms 364 KB Output is correct
5 Correct 9 ms 364 KB Output is correct
6 Correct 16 ms 364 KB Output is correct
7 Correct 9 ms 364 KB Output is correct
8 Correct 8 ms 364 KB Output is correct

Subtask #2
0 / 7.0

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

Subtask #3
57.0 / 57.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 459 ms 552 KB Output is correct
3 Correct 1004 ms 476 KB Output is correct
4 Correct 1128 ms 452 KB Output is correct
5 Correct 1048 ms 492 KB Output is correct
6 Correct 1160 ms 492 KB Output is correct
7 Correct 987 ms 872 KB Output is correct
8 Correct 1083 ms 492 KB Output is correct

Subtask #4
0 / 22.0

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