Submission #13,033

2025-01-04 23:23:10

cpp17

Accepted 50/50

112ms

1080 KiB

#include<bits/stdc++.h>
using namespace std;


int main(){
    int n,m,x,y; cin >> n >> m;
    vector<int> hossz(pow(2,n));
    vector<int> suly(pow(2,n),1);
    for (int i=1;i<n;i++){
        for (int j=pow(2,i-1);j<pow(2,i);j++){
            hossz[j]=n-i;
        }
    }
    for (int i=0;i<m;i++){
        cin>>x>>y; suly[x]=y;
        while (x!=1){
            hossz[x/2]=max(hossz[x/2*2]+suly[x/2*2],hossz[x/2*2+1]+suly[x/2*2+1]);x=x/2;
        }
        cout << hossz[1] <<"\n";
    }
}

	Sum	Test	Verdict		Time	Memory
base	50/50
		1	Accepted	0/0	1ms	320 KiB
		2	Accepted	0/0	104ms	964 KiB
		3	Accepted	2/2	3ms	320 KiB
		4	Accepted	2/2	3ms	320 KiB
		5	Accepted	2/2	3ms	320 KiB
		6	Accepted	2/2	3ms	320 KiB
		7	Accepted	3/3	3ms	320 KiB
		8	Accepted	3/3	2ms	320 KiB
		9	Accepted	3/3	3ms	320 KiB
		10	Accepted	3/3	3ms	320 KiB
		11	Accepted	2/2	112ms	1080 KiB
		12	Accepted	2/2	108ms	972 KiB
		13	Accepted	2/2	108ms	952 KiB
		14	Accepted	2/2	108ms	1056 KiB
		15	Accepted	2/2	109ms	1080 KiB
		16	Accepted	2/2	105ms	968 KiB
		17	Accepted	2/2	112ms	1004 KiB
		18	Accepted	2/2	104ms	1080 KiB
		19	Accepted	2/2	104ms	1076 KiB
		20	Accepted	3/3	104ms	1080 KiB
		21	Accepted	3/3	108ms	948 KiB
		22	Accepted	3/3	108ms	1080 KiB
		23	Accepted	3/3	104ms	956 KiB