Submission #53881303

---

Source Code Expand

#include<iostream>
#include<vector>
#include<map>
#include<set>
#include<cassert>
#include<unordered_map>
#include<unordered_set>
#include<functional>
#include<queue>
#include<stack>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<sstream>
#include<iomanip>
#include<cstdio>
#include<cstdlib>
#include<numeric>
#include<random>
#include<chrono>
#include<bitset>
//#include<ext/pb_ds/assoc_container.hpp>
//#include<ext/pb_ds/tree_policy.hpp>
using namespace std;
//using namespace __gnu_pbds;

#define all(x) (x).begin(), (x).end()
#define pb push_back
#define eb emplace_back
#define xx first
#define yy second
#define sz(x) (int)(x).size()
#define gc getchar
#define IO ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define mp make_pair
#define ins insert
#define chkmn(x,y) (x)=min((x), (y))
#define chkmx(x,y) (x)=max((x), (y))
#define rep(i,a,b) for(int i=a;i<b;i++)

#ifndef ONLINE_JUDGE
#  define LOG(x) (cerr << #x << " = " << (x) << endl)
#else
#  define LOG(x) ((void)0)
#endif

using ll = long long;
using ull = unsigned long long ;
using ld = long double ;
using str = string;
//using ordered_set=tree<pair<int,int>, null_type, less<pair<int,int>>, rb_tree_tag, tree_order_statistics_node_update>;

const double PI=acos(-1);
const ll INF = 1LL<<62;
const ll MINF = -(1LL<<62);

template<typename T> T getint() {
    T val=0;
    char c;
    
    bool neg=false;
    while((c=gc()) && !(c>='0' && c<='9')) {
        neg|=c=='-';
    }

    do {
        val=(val*10)+c-'0';
    } while((c=gc()) && (c>='0' && c<='9'));

    return val*(neg?-1:1);
}

//mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); uniform_int_distribution<int>(0, n-1)(rng)

int a[1<<18];
int n,l,r;
int ask(int i, int j) {
    cout<<"? "<<i<<" "<<j<<"\n"<<flush;
    int res=0;
    #ifdef LOCAL
    for(int k=(1<<i)*j;k<(1<<i)*(j+1);++k) res=(res+a[k])%100;
    #else
    cin>>res;
    if(res==-1) exit(0);
    #endif
    return res;
}

void answer(int ans) {
    cout<<"! "<<ans<<"\n";
    #ifdef LOCAL
    int res=0;
    for(int i=l;i<=r;++i) {
        (res+=a[i])%=100;
    }
    assert(res==ans);
    
    #endif
}
 

int main() {
    IO;
    cin>>n>>l>>r;
    #ifdef LOCAL
    for(int i=0;i<(1<<n);++i) a[i]=rand()%100;
    #endif
    int ans=0;
    auto calc=[](auto self, int L, int R, int i, int j) -> pair<int,int> {
        //~ LOG(L);
        //~ LOG(R);
        //~ LOG(i);
        //~ LOG(j);
        if(i<=L && R<=j) {
            return {1,0};
        }
        if(R<i || j<L) return {0,-1};
        int direct=self(self, L, (L+R)/2, i, j).xx+self(self, (L+R)/2+1, R, i, j).xx;
        int transp=1;
        transp+=self(self, L, (L+R)/2, L, i-1).xx;
        transp+=self(self, (L+R)/2+1, R, L, i-1).xx;
        transp+=self(self, L,(L+R)/2,j+1,R).xx;
        transp+=self(self, (L+R)/2+1,R,j+1,R).xx;
        
        if(direct<transp) return {direct, 0};
        else return {transp, 1};
    };
    auto solve=[&ans](auto self, auto calc, int L, int R, int i, int j, int n, int coeff) {
        if(i<=L && R<=j) {
            int res=ask(n, L/(1<<n));
            (ans+=coeff*res)%=100;
            return ;
        }
        if(R<i || j<L) return ;
        if(calc(calc, L, R, i, j).yy==0) {
            self(self, calc, L, (L+R)/2, i, j, n-1, coeff);
            self(self, calc, (L+R)/2+1, R, i, j, n-1, coeff);
        }else {
            int res=ask(n, L/(1<<n));
            (ans+=coeff*res)%=100;
            self(self, calc, L, (L+R)/2, L, i-1, n-1, -coeff);
            self(self, calc, (L+R)/2+1, R, j+1, R, n-1, -coeff);
        }
    };
    solve(solve, calc, 0,(1<<n)-1, l, r, n,1);
    if(ans<0) ans+=100;
    answer(ans);
    return 0;
}

Submission Info

Judge Result