Submission #797018

#	Time	Username	Problem	Language	Result	Execution time	Memory
797018		cig32	Mađioničar (COI22_madionicar)	C++17	38 / 100	1562 ms	1560 KiB

Main

#include "bits/stdc++.h"
using namespace std;
#define int long long
const int MAXN = 3e5 + 10;
const int MOD = 1e9 + 7;
mt19937_64 rng((int)std::chrono::steady_clock::now().time_since_epoch().count());
int rnd(int x, int y) {
  int u = uniform_int_distribution<int>(x, y)(rng); return u;
}
int bm(int b, int p) {
  if(p==0) return 1 % MOD;
  int r = bm(b, p >> 1);
  if(p&1) return (((r*r) % MOD) * b) % MOD;
  return (r*r) % MOD;
}
int inv(int b) { 
  return bm(b, MOD-2);
}
int fastlog(int x) {
  return (x == 0 ? -1 : 64 - __builtin_clzll(x) - 1);
}
void printcase(int i) { cout << "Case #" << i << ": "; }
int qc=0;
string s;
int isp(int l, int r) {
  qc++;
  cout << "? " << l << ' ' << r << endl;
  int x; cin >> x; return x;
}
void solve(int tc) {
  int n;
  cin >> n;
  int s[n+1];
  int nw = 2;
  deque<int>dq;
  int ans=0;
  for(int i=1;i<=n;i++){
    while(dq.size()) {
      int l = dq.back() / 2, r = (dq.back() + 1) / 2;
      l -= (i - r);
      r = i;
      if(l >= 1 && isp(l, r)) {
        break;
      }
      else {
        dq.pop_back();
      }
    }
    if(i == 1) s[i] = 1;
    else if(dq.size()) {
      int l = dq.back() / 2, r = (dq.back() + 1) / 2;
      l -= (i - r);
      r = i;
      s[i] = s[l];
      if(s[i] == s[i-1]) {
        dq.push_front(2*i-1);
      }
    }
    else {
      if(isp(i-1, i)) {
        dq.push_front(2*i-1);
        s[i] = s[i-1];
      }
      else {
        s[i] = nw++;
      }
    }
    dq.push_front(2*i);
    int l = dq.back() / 2, r = (dq.back() + 1) / 2;
    l -= (i - r);
    r = i;
    ans = max(ans, r-l+1);
  }
  cout << "! " << ans << endl;
  //cerr << "Nr of queries = " << qc << endl;
}
int32_t main() {
  //ios::sync_with_stdio(0); cin.tie(0);
  int t = 1; //cin >> t;
  for(int i=1; i<=t; i++) solve(i);
}
// 勿忘初衷

• Subtask 1: 13 / 13
• Subtask 2: 25 / 25
• Subtask 3: 0 / 25
• Subtask 4: 0 / 37