oj.uz

Submission #1063121

# Submission time Handle Problem Language Result Execution time Memory
1063121 2024-08-17T14:24:50 Z beaconmc A Light Inconvenience (CEOI23_light) C++17
0 / 100
 1 ms 428 KB 
#include "light.h"

#include <bits/stdc++.h>
 
typedef long long ll;
#define FOR(i,x,y) for(ll i=x; i<y; i++)
#define FORNEG(i,x,y) for(ll i=x; i>y; i--)
 
using namespace std;

ll n, maxi;
vector<ll> prevs;

void prepare(){
	n = 1;
	maxi = n;
}

pair<long long, std::vector<long long>> join(long long p){
	n += p;
	set<ll> stuff;
	stuff.insert(1);

	maxi = max(maxi, n);
	if (n==maxi){
		FOR(i,1,70){
			stuff.insert(n-(1<<i)+2);
		}
	}
	else{
		ll diff = maxi-n;
		FOR(i,1,70){
			stuff.insert(maxi-(1<<i)+2);
			stuff.insert(maxi-(1<<i)+2 + diff);
		}
	}
	vector<ll> real;
	for (auto&i : stuff) if (1<=i && i<=n) real.push_back(i);
	prevs = real;
	return {p, real};


}

std::pair<long long, std::vector<long long>> leave(long long p){
	n -= p;
	set<ll> stuff;
	stuff.insert(1);
	stuff.insert(n);

	ll diff = maxi-n;


	FOR(i,1,70){
		stuff.insert(maxi-(1<<i)+2);
		stuff.insert(maxi-(1<<i)+2 + diff);
	}



	FOR(i,1,70){
		ll temp = n - (1<<i)+2;

		if (lower_bound(prevs.begin(), prevs.end(), temp) !=  lower_bound(prevs.begin(), prevs.end(), temp-p)){
			
			stuff.insert(n - (1<<i)+2);
		}
	}



	vector<ll> real;
	for (auto&i : stuff) if (1<=i && i<=n) real.push_back(i);


	prevs = real;

	return {p, real};

}

Subtask #0
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Correct

Subtask #1
0.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Correct
2 Incorrect 0 ms 428 KB Not correct
3 Halted 0 ms 0 KB -

Subtask #2
0.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Correct
2 Incorrect 0 ms 344 KB Not correct
3 Halted 0 ms 0 KB -

Subtask #3
0.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Correct
2 Incorrect 0 ms 344 KB Not correct
3 Halted 0 ms 0 KB -

Subtask #4
0.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Correct
2 Incorrect 0 ms 344 KB Not correct
3 Halted 0 ms 0 KB -

Subtask #5
0.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Correct
2 Incorrect 0 ms 344 KB Not correct
3 Halted 0 ms 0 KB -

Subtask #6
0.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Correct
2 Incorrect 0 ms 344 KB Not correct
3 Halted 0 ms 0 KB -

Subtask #7
0.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Correct
2 Incorrect 1 ms 428 KB Not correct
3 Halted 0 ms 0 KB -