Submission #1174114

#TimeUsernameProblemLanguageResultExecution timeMemory
1174114LucaIlieA Light Inconvenience (CEOI23_light)C++20
0 / 100
0 ms408 KiB
#include "light.h"
#include <bits/stdc++.h>

using namespace std;

long long slaves;

void prepare(){
	slaves = 1;
}

pair<long long, vector<long long>> join( long long p ) {
	slaves += p;
    vector<long long> light;
    for ( int l = 0; (1LL << l) < slaves; l++ )
        light.push_back( slaves - (1 << l) + 1 );
    light.push_back( 1 );
    reverse( light.begin(), light.end() );
    return { p, light };
}

pair<long long, vector<long long>> leave( long long p ) {
    slaves -= p;
    vector<long long> light;
    for ( int l = 0; (1LL << l) < slaves; l++ )
        light.push_back( slaves - (1 << l) + 1 );
    light.push_back( 1 );
    reverse( light.begin(), light.end() );
    return { p, light };
}

#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...