149852025-02-10 19:34:20iSamu7598Bináris fa magassága (50 pont)cpp17Time limit exceeded 20/50600ms680 KiB
#include <iostream>
#include <cmath>
using namespace std;
int n, k;
int v[70000];

void valtozas (int melyik, int valto){
v[melyik]=v[melyik]+valto;
if(2*melyik<pow(2, n)){
    valtozas(2*melyik, valto);
    valtozas(2*melyik+1, valto);
}
}

int main()
{
    cin>>n>>k;

    v[1]=0;
    for(int i=2; i<=pow(2, n); i++){
        v[i]=v[i/2]+1;

    }
int melyik, mennyi;
for(int i=1; i<=k; i++){
    cin>>melyik>>mennyi;
    int valto=mennyi-(v[melyik]-v[melyik/2]);
    valtozas(melyik, valto);
    int maxi=0;
    for(int i=1; i<pow(2, n); i++){
    maxi=max(maxi, v[i]);
}
cout<<maxi<<endl;
}


    return 0;
}
SubtaskSumTestVerdictTimeMemory
base20/50
1Accepted0/01ms316 KiB
2Time limit exceeded0/0584ms576 KiB
3Accepted2/23ms316 KiB
4Accepted2/23ms316 KiB
5Accepted2/23ms316 KiB
6Accepted2/23ms316 KiB
7Accepted3/34ms316 KiB
8Accepted3/37ms412 KiB
9Accepted3/312ms316 KiB
10Accepted3/312ms316 KiB
11Time limit exceeded0/2598ms564 KiB
12Time limit exceeded0/2600ms680 KiB
13Time limit exceeded0/2598ms564 KiB
14Time limit exceeded0/2583ms564 KiB
15Time limit exceeded0/2577ms680 KiB
16Time limit exceeded0/2600ms564 KiB
17Time limit exceeded0/2600ms680 KiB
18Time limit exceeded0/2582ms564 KiB
19Time limit exceeded0/2582ms564 KiB
20Time limit exceeded0/3600ms564 KiB
21Time limit exceeded0/3600ms564 KiB
22Time limit exceeded0/3579ms564 KiB
23Time limit exceeded0/3583ms564 KiB