이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#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 fi first
#define se second
#define REP(i, n) for (auto i = 0; i < (n); ++i)
#define FOR(i, a, b) for (auto i = (a); i <= (b); ++i)
#define FORD(i, a, b) for (auto i = (a); i >= (b); --i)
#define FORE(i, a, b) for (auto i = (a); i < (b); ++i)
#define MASK(x) (1LL << (x))
#define BIT(x, i) (((x) >> (i)) & 1)
#define ALL(x) (x).begin(), (x).end()
#define left ___left
#define right ___right
#define __builtin_popcount __builtin_popcountll
const int MAX = 1e5 + 5;
int n, q, a[MAX];
int ask (int l, int r) {
cout << "? " << l << " " << r << endl;
int x; cin >> x; return x;
}
void you_make_it(void) {
cin >> n >> q;
deque <int> dq;
fill(a + 1, a + n + 1, -1);
for (int i = 1; i <= n; ++i) {
if(i > 1 and !dq.empty()) {
if(ask(dq.back(), i)) {
a[dq.back()] = 0;
a[i] = 1;
dq.pop_back();
} else {
dq.push_back(i);
}
} else {
dq.push_back(i);
}
}
for (int i = 0; i < dq.size() / 2; ++i) {
a[i] = 1;
a[dq[dq.size() - i - 1]] = 0;
}
cout << "! ";
for (int i = 1; i <= n; ++i) {
assert(a[i] != -1);
cout << (a[i] ? "(" : ")");
}
}
signed main() {
#ifdef LOCAL
freopen("TASK.inp", "r", stdin);
freopen("TASK.out", "w", stdout);
#endif // LOCAL
auto start_time = chrono::high_resolution_clock::now();
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int test = 1;
// cin >> test;
for (int i = 0; i < test; ++i) {
you_make_it();
// cout << '\n';
}
auto end_time = chrono::high_resolution_clock::now();
cerr << "\nExecution time : " << chrono::duration_cast <chrono::milliseconds> (end_time - start_time).count() << "[ms]" << endl;
return (0 ^ 0);
}
// Dream it. Wish it. Do it.
컴파일 시 표준 에러 (stderr) 메시지
zagrade.cpp: In function 'void you_make_it()':
zagrade.cpp:48:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::deque<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
48 | for (int i = 0; i < dq.size() / 2; ++i) {
| ~~^~~~~~~~~~~~~~~
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |