| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1328457 | huoi | Mađioničar (COI22_madionicar) | C++17 | 473 ms | 344 KiB |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define INF 1e18
void solve() {
int n;
cin >> n;
int ans = 1;
for (int i = 1; i < n; i++) {
int l = i - 1, r = i + 1, yes = 1;
while (l >= 1 && r <= n) {
cout << "? " << l << " " << r << endl;
cin >> yes;
if (!yes) break;
ans = max(ans, r - l + 1);
l--, r++;
}
}
cout << "! " << ans << endl;
}
int32_t main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
solve();
return 0;
}
| # | 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... | ||||
