oj.uz

답안 #1027036

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1027036 2024-07-18T19:05:15 Z VMaksimoski008 Mađioničar (COI22_madionicar) C++17
0 / 100
 1329 ms 13016 KB 
#include <bits/stdc++.h>

#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
//#define int long long

using namespace std;

using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

const int mod = 1e9 + 7;
const int LOG = 20;
const int maxn = 1e5 + 5;

map<pii, int> mp;

int query(int l, int r) {
    if(mp.count({ l, r })) return mp[{ l, r }];
    cout << "? " << l << " " << r << endl;
    int x;
    cin >> x;
    return mp[{ l, r }] = x;
}

signed main() {
    int n;
    cin >> n;

    int l=2, r=n/2, ans=1;
    while(l <= r) {
        int mid = (l + r) / 2, ok = 0;
        int len = 2 * mid + 1;
        for(int i=1; i+len-1<=n; i++) {
            if(query(i, i+len-1)) {
                ok = 1;
                break;
            }
        }

        if(ok) ans = len, l = mid + 1;
        else r = mid - 1;
    }

    l=1, r=n/2;
    int ans2=0;
    while(l <= r) {
        int mid = (l + r) / 2, ok = 0;
        int len = 2 * mid;
        for(int i=1; i+len-1<=n; i++) {
            if(query(i, i+len-1)) {
                ok = 1;
                break;
            }
        }

        if(ok) ans = len, l = mid + 1;
        else r = mid - 1;
    }

    cout << "! " << max(ans, ans2) << endl;
    return 0;
}

Subtask #1
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 835 ms 8900 KB Output is correct
2 Incorrect 804 ms 9248 KB L = 4, expected 7
3 Halted 0 ms 0 KB -

Subtask #2
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 835 ms 8900 KB Output is correct
2 Incorrect 804 ms 9248 KB L = 4, expected 7
3 Halted 0 ms 0 KB -

Subtask #3
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1329 ms 13016 KB Execution killed with signal 13
2 Halted 0 ms 0 KB -

Subtask #4
0 / 37.0

# 결과 실행 시간 메모리 Grader output
1 Correct 835 ms 8900 KB Output is correct
2 Incorrect 804 ms 9248 KB L = 4, expected 7
3 Halted 0 ms 0 KB -