oj.uz

Submission #1073133

# Submission time Handle Problem Language Result Execution time Memory
1073133 2024-08-24T09:47:16 Z edogawa_something A Light Inconvenience (CEOI23_light) C++17
0 / 100
 1 ms 344 KB 
#include "light.h"
#include <vector>
#include<bits/stdc++.h>
using namespace std;
int cnt;
vector<long long>v;
void prepare(){
	cnt = 1;
	v.push_back(1);
}

std::pair<long long, std::vector<long long>> join(long long p){
		cnt+=p;
		vector<long long> vv;
		vv.push_back(1);
		for(auto &it:v)
		it+=p;
		for(long long i=1;1;) {
			long long res=1;
			for(auto it:v) {
				if((2ll*i+p)>=it)
					res=max(res,min(it,2ll*i));
			}
			if(res>=cnt) {
				vv.push_back(cnt);
				break;
			}
			else
				vv.push_back(res);
			i=res;
		}
	v=vv;
	vector<long long>ans;
	for(auto it:v)
		ans.push_back(cnt-it+1);
	sort(ans.begin(),ans.end());
		return {p,v};
}

std::pair<long long, std::vector<long long>> leave(long long p){
	cnt-=p;
	vector<long long> vv,vvv;
	vvv=v;
	v.clear();
	for(auto it:vvv) {
		if(it-p>0)
			v.push_back(it-p);
	}
	vv.push_back(1);
	for(long long i=1;1;) {
		long long res=1;
		for(auto it:v) {
			if((2ll*i+p)>=it)
				res=max(res,min(it,2ll*i));
		}
		if(res>=cnt) {
			vv.push_back(cnt);
			break;
		}
		vv.push_back(res);
		i=res;
	}
	v=vv;
	vector<long long>ans;
	if(cnt==1)
		v.clear(),v.push_back(1);
	for(auto it:v)
		ans.push_back(cnt-it+1);
	sort(ans.begin(),ans.end());
	return {p,v};
}

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 1 ms 344 KB Correct
2 Incorrect 0 ms 344 KB Not correct
3 Halted 0 ms 0 KB -

Subtask #2
0.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 1 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 1 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 1 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 1 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 0 ms 344 KB Correct
2 Incorrect 1 ms 344 KB Not correct
3 Halted 0 ms 0 KB -