# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
381325 | 2021-03-25T06:10:17 Z | kartel | Zagrade (COI20_zagrade) | C++14 | 926 ms | 1120 KB |
#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() { // mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());; ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); // in("toys.in"); // out("toys.out"); // in("input.txt"); // out("output.txt"); // cerr.precision(9); cerr << fixed; // clock_t tStart = clock(); int n, q; cin >> n >> q; int last = 1; string ans = ""; vector <int> op; op.pb(1); ans += "("; for (int i = 2; i < n; i++) { if (!sz(op)) { op.pb(i); ans += "("; continue; } bool is = get(op.back(), i); if (!is) { ans += "("; op.pb(i); } else { ans += ")"; op.pop_back(); } } ans += ")"; cout << "! " << ans << endl; } /* 7 4 6 7 2 3 1 5 */
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 364 KB | Output is correct |
2 | Correct | 6 ms | 364 KB | Output is correct |
3 | Correct | 8 ms | 364 KB | Output is correct |
4 | Correct | 8 ms | 364 KB | Output is correct |
5 | Correct | 9 ms | 364 KB | Output is correct |
6 | Correct | 10 ms | 364 KB | Output is correct |
7 | Correct | 11 ms | 364 KB | Output is correct |
8 | Correct | 9 ms | 364 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 364 KB | Mismatch at position 1. Expected ), found ( |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 364 KB | Output is correct |
2 | Correct | 419 ms | 768 KB | Output is correct |
3 | Correct | 873 ms | 876 KB | Output is correct |
4 | Correct | 653 ms | 704 KB | Output is correct |
5 | Correct | 926 ms | 920 KB | Output is correct |
6 | Correct | 781 ms | 768 KB | Output is correct |
7 | Correct | 897 ms | 872 KB | Output is correct |
8 | Correct | 889 ms | 1120 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 384 KB | Mismatch at position 1. Expected ), found ( |
2 | Halted | 0 ms | 0 KB | - |