Correctoutput

#include <vector>
#include <iostream>
#include <unordered_map>
#include <queue>
#include <limits.h>
#include <string>
using namespace std;

class Edge {
public:
	int edge_node1_id;  //node* edge_node1
	int edge_node2_id;  //node* edge_node2

	int edge_id; //边的编号
	int edge_d; //边的d大小

	vector<int> tunnelleft;

	Edge(int a, int b, int d,int id,int p); // 构造函数，两个点，和一条d

    void addEdge();
};

//类的非const静态变量需要全局定义

Edge::Edge(int a, int b, int d,int id,int p) :edge_node1_id(a), edge_node2_id(b), edge_d(d) {
	//确定通道的size
    edge_id = id;
	tunnelleft.resize(p);
}

void Edge::addEdge(){
    for(int ii:tunnelleft){
        ii=ii+1;
    }
}

class Graph{
    int P;
    int id;
    vector<vector<int>> adj; //邻接表
    vector<unordered_map< int, Edge*> > Edge_classfy_bynodeid;

    Graph(int p,int n,int iid=0){
        P = p;
        id = iid;
        Edge_classfy_bynodeid.resize(n);
    }

    void addgraphedge(int a,int b,int d);
};

void Graph::addgraphedge(int a,int b,int d){
    if(  Edge_classfy_bynodeid[a].find(b) != Edge_classfy_bynodeid[a].end()){
        Edge_classfy_bynodeid[a][b]->addEdge();
    }
    Edge* edge = new Edge(a,b,d,id++,P);
    Edge_classfy_bynodeid[a][b] = edge;
    Edge_classfy_bynodeid[b][a] = edge;
}

void addcost(vector<long long int> &costall,long long int bigger){
    long long int st = 1;
    for(int _=0;_<60;_++){
        st = st<<1;
    }
    while(bigger > st){
        costall.insert(costall.begin(),st);
        bigger -= st;
    }

    if(costall[0] < st){
        costall[0] += bigger;
    }
    else{
        costall.insert(costall.begin(),st);
    }

}


vector<int> getint(string a){
    vector<int> ans;
    int size;
    int n=0;
    for(auto ii:a){
        switch(ii){
            case ' ': size+=1;
            ans.push_back(n);
            n=0;
            break;

            case '1':

            case '2':

            case '3':
            
            case '4':

            case '5':
            
            case '6':

            case '7':

            case '8':

            case '9':

            case '0': n=n*10 + (ii-'0');
        }
        if(size == 3){
            break;
        }
    }
    return ans;
}


int main(){
    int size;
    int size_cost = 1000000;
    int amplifier_cost = 100;
    cin>>size;
    vector<long long int> costall = {0};
    addcost(costall,size*size_cost);
    int nul1,nul2;
    for(int ii=0;ii<size;ii++){
        cin>>nul1>>nul2;
    }
    cin.ignore(INT_MAX, '\n');
    string neline;
    while( getline(cin,neline) ){
        vector<int> cal = getint(neline);
        addcost(costall,cal[1]);
        addcost(costall,cal[2]*amplifier_cost);
        for(auto ii:costall){
            cout<<ii;
        }
        cout<<endl;
    }
}