제출 #1070015

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1070015		NeroZein	A Light Inconvenience (CEOI23_light)	C++17	5 / 100	609 ms	1048576 KiB

light

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

const int LOG = 63;

int sz;
int cnt;
bool flag; 
vector<long long> indices;

void prepare(){
	cnt = 0;
	sz = 1; 
	indices.push_back(1); 
}

pair<long long, vector<long long>> join(long long p){
	cnt++;
	sz += p; 
	vector<long long> nindices;
	for (int i = 1; i < sz; i += 5) {
		nindices.push_back(i); 
	}
	nindices.push_back(sz);
	indices = nindices;
	return {5 * p, indices}; 
}

pair<long long, vector<long long>> leave(long long p){// I just need to make sure after one leave I'm able to keep the rightmost lit
	cnt++;
	sz -= p; 
	vector<long long> nindices;
	for (int i = 1; i < sz; i += 5) {
		nindices.push_back(i); 
	}
	nindices.push_back(sz);
	indices = nindices;
	return {5 * p, indices}; 
}

• Subtask 0: 0 / 0
• Subtask 1: 0 / 5
• Subtask 2: 5 / 5
• Subtask 3: 0 / 10
• Subtask 4: 0 / 5
• Subtask 5: 0 / 10
• Subtask 6: 0 / 5
• Subtask 7: 0 / 60