Submission #412911

#TimeUsernameProblemLanguageResultExecution timeMemory
412911couplefireZagrade (COI20_zagrade)C++17
100 / 100
1105 ms1272 KiB
#include <bits/stdc++.h> #define in(x) freopen(x, "r", stdin) #define out(x) freopen(x, "w", stdout) //#include <time.h> //#include <ext/pb_ds/assoc_container.hpp> //#include <ext/pb_ds/tree_policy.hpp> //#pragma GCC optimize("Ofast") //#pragma GCC optimize("unroll-loops") //#pragma GCC optimize("-O3") #define F first #define S second #define pb push_back #define M ll(1e9 + 7) //#define M ll(998244353) #define sz(x) (int)x.size() #define re return #define oo ll(1e18) #define el '\n' #define pii pair <int, int> #define all(x) (x).begin(), (x).end() #define arr_all(x, n) (x + 1), (x + 1 + n) #define vi vector<int> #define eps (ld)1e-9 using namespace std; typedef long long ll; //using namespace __gnu_pbds; //typedef tree <ll, null_type, less_equal <ll> , rb_tree_tag, tree_order_statistics_node_update> ordered_set; typedef double ld; typedef unsigned long long ull; typedef short int si; bool get(int l, int r) { int x; cout << "? " << l << " " << r << endl; cin >> x; return x; } int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n, q; cin >> n >> q; int last = 1; string ans = ""; for (int i = 1; i <= n; i++) { ans += "X"; } vector <int> op; int ccl = n / 2; for (int i = 1; i <= n; i++) { if (!sz(op)) { op.pb(i); continue; } bool is = get(op.back(), i); if (!is) { op.pb(i); } else { ans[op.back() - 1] = '('; ans[i - 1] = ')'; ccl--; op.pop_back(); } } for (int i = 0; i < n; i++) { if (ans[i] == 'X') { if (!ccl) { ans[i] = '('; } else { ans[i] = ')'; ccl--; } } } cout << "! " << ans << endl; }

Compilation message (stderr)

zagrade.cpp: In function 'int main()':
zagrade.cpp:46:9: warning: unused variable 'last' [-Wunused-variable]
   46 |     int last = 1;
      |         ^~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...