제출 #1062995

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1062995		beaconmc	A Light Inconvenience (CEOI23_light)	C++17	0 / 100	3068 ms	344 KiB

light

#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;

int n;

void prepare(){
	n = 1;
}

pair<long long, std::vector<long long>> join(long long p){
	n += p;
	set<ll> stuff;
	stuff.insert(1);
	FOR(i, 1, n+1){
		ll sus = n+1 - i;
		bool flag = 0;
		FOR(j,0,30) if ((1<<j) == sus) flag = 1;
		if (flag) stuff.insert(i); 
	}
	vector<ll> real;
	for (auto&i : stuff) real.push_back(i);
	

	return {p, real};


}

std::pair<long long, std::vector<long long>> leave(long long p){
	n -= p;
	set<ll> stuff;
	stuff.insert(1);
	FOR(i, 1, n+1){
		ll sus = n+1 - i;
		bool flag = 0;
		FOR(j,0,30) if ((1<<j) == sus) flag = 1;
		if (flag) stuff.insert(i); 
	}
	vector<ll> real;
	for (auto&i : stuff) real.push_back(i);
	

	return {p, real};
}

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