Submission #1007124

---

Source Code Expand

#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<algorithm>
#include<cmath>
#include<set>
#include<deque>
using namespace std;
const int ma = 1000009;
int ans[1000010];


int main(){
    int N;
    int64_t A[100001];
    cin>>N;
    for(int i=1;i<N;i++){
        cin>>A[i];
    }
    int sum=0;
    for(int i=3;i<N;i++){
        sum += A[i];
    }
    deque<int> dq;
    for(int i=0;i<=ma;i++){
        dq.push_back(i);
    }
    for(int i=3;i<N;i++){
        int z;
        deque<int> tmp1;
        deque<int> tmp2;
        z=dq.front(); dq.pop_front();
        for(int j=1;j<=A[i];j++){
            int x=dq.front(); dq.pop_front();
            tmp1.push_back(x);
            tmp2.push_back(x);
        }
        for(int j=0;j<A[i];j++){
            int x=tmp1.back(); tmp1.pop_back();
            dq.push_front(x);
        }
        dq.push_front(z);
        for(int j=0;j<A[i];j++){
            int x=tmp2.front(); tmp2.pop_front();
            dq.push_front(x);
        }
    }
    for(int i=0;i<=ma;i++){
        ans[i]=dq.front();
        dq.pop_front();
    }
    int M;
    cin>>M;
    int s = A[1]-A[2];
    for(int i=0;i<M;i++){
        int x;
        cin>>x;
        if(x>ma){
            cout<< x - sum + s <<endl;
        }else{
            cout<<ans[x]+s <<endl;
        }
    }
    
    
    return 0;
}

Submission Info

Judge Result