oj.uz

답안 #1041775

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1041775 2024-08-02T08:06:06 Z 이종영(#11053) A Light Inconvenience (CEOI23_light) C++17
5 / 100
 277 ms 428 KB 
#include "light.h"
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
ll n;
vector<ll> V,R;
void prepare(){
	n=1;
	V.push_back(1);
}
std::pair<ll, std::vector<ll>> join(ll p){
	n+=p;
	vector<ll> NV=V;
	NV.push_back(1);
	NV.push_back(2);
	NV.push_back(n);
	sort(NV.begin(),NV.end());
	NV.resize(unique(NV.begin(),NV.end())-NV.begin());
	V.clear();
	V.push_back(1);
	V.push_back(NV[0]);
	V.push_back(NV[1]);
	for(int i=2;i<(int)NV.size();i++){
		while(NV[i]>5*V.end()[-1]+V.end()[-3]){
			V.push_back(5*V.end()[-1]+V.end()[-3]);
		}
		if(i+1<(int)NV.size()&&NV[i+1]<=5*V.end()[-1]+V.end()[-3]) continue;
		V.push_back(NV[i]);
	}
	reverse(V.begin(),V.end());
	V.pop_back();
	reverse(V.begin(),V.end());
	R=V;
	for(ll &x: R) x=n+1-x;
	reverse(R.begin(),R.end());
	assert(R.size()<=150);
	return {5*p,R};
}
std::pair<ll, std::vector<ll>> leave(ll p){
	n-=p;
	if(n==1){
		V=R={1};
		return {5*p,R};
	}
	if(n==2){
		V=R={1,2};
		return {5*p,R};
	}
	reverse(V.begin(),V.end());
	while(V.back()<=p) V.pop_back();
	for(ll &x: V) x-=p;
	V.push_back(1);
	V.push_back(2);
	V.push_back(n);
	reverse(V.begin(),V.end());
	sort(V.begin(),V.end());
	V.resize(unique(V.begin(),V.end())-V.begin());
	/*cout<<p<<": ";
	for(ll x: V) cout<<x<<" ";
	cout<<"\n";*/
	vector<ll> NV=V;
	V.clear();
	V.push_back(1);
	V.push_back(NV[0]);
	V.push_back(NV[1]);
	for(int i=2;i<(int)NV.size();i++){
		while(NV[i]>5*V.end()[-1]+V.end()[-3]){
			V.push_back(5*V.end()[-1]+V.end()[-3]);
		}
		if(i+1<(int)NV.size()&&NV[i+1]<=5*V.end()[-1]+V.end()[-3]) continue;
		V.push_back(NV[i]);
	}
	reverse(V.begin(),V.end());
	V.pop_back();
	reverse(V.begin(),V.end());
	R=V;
	for(ll &x: R) x=n+1-x;
	reverse(R.begin(),R.end());
	assert(R.size()<=150);
	return {5*p,R};
}

Subtask #0
0.0 / 0.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 228 ms 428 KB Output is correct
3 Correct 266 ms 344 KB Output is correct
4 Correct 222 ms 344 KB Output is correct
5 Correct 233 ms 344 KB Output is correct
6 Correct 245 ms 344 KB Output is correct
7 Correct 249 ms 340 KB Output is correct
8 Correct 241 ms 344 KB Output is correct
9 Correct 226 ms 344 KB Output is correct
10 Correct 254 ms 344 KB Output is correct
11 Correct 242 ms 412 KB Output is correct

Subtask #2
0.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Incorrect 3 ms 344 KB Not correct
3 Halted 0 ms 0 KB -

Subtask #3
0.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Incorrect 3 ms 344 KB Not correct
3 Halted 0 ms 0 KB -

Subtask #4
0.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Incorrect 3 ms 344 KB Not correct
3 Halted 0 ms 0 KB -

Subtask #5
0.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Incorrect 3 ms 344 KB Not correct
3 Halted 0 ms 0 KB -

Subtask #6
0.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Incorrect 3 ms 344 KB Not correct
3 Halted 0 ms 0 KB -

Subtask #7
0.0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 1 ms 344 KB Partially correct
2 Partially correct 271 ms 344 KB Partially correct
3 Partially correct 250 ms 344 KB Partially correct
4 Partially correct 251 ms 344 KB Partially correct
5 Partially correct 205 ms 344 KB Partially correct
6 Partially correct 218 ms 344 KB Partially correct
7 Partially correct 227 ms 344 KB Partially correct
8 Partially correct 277 ms 344 KB Partially correct
9 Partially correct 255 ms 344 KB Partially correct
10 Partially correct 233 ms 344 KB Partially correct
11 Partially correct 240 ms 412 KB Partially correct
12 Incorrect 3 ms 344 KB Not correct
13 Halted 0 ms 0 KB -