oj.uz

답안 #1042702

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1042702 2024-08-03T09:50:56 Z Unforgettablepl Tricolor Lights (JOI24_tricolor) C++17
5 / 100
 86 ms 30900 KB 
#include "Anna.h"
#include <bits/stdc++.h>
using namespace std;

namespace {

string calc(vector<int> arr,string S){
	int N = S.size();
	string res(N,'$');
	for(int i=0;i<N-1;i++){
		if(arr[i])continue;
		{
			vector<bool> present(3);
			if(S[i]=='R')present[0]=true;
			else if(S[i]=='G')present[1]=true;
			else if(S[i]=='B')present[2]=true;
			if(S[i+1]=='R')present[0]=true;
			else if(S[i+1]=='G')present[1]=true;
			else if(S[i+1]=='B')present[2]=true;
			if(!present[0])res[i]=res[i+1]='R';
			else if(!present[1])res[i]=res[i+1]='G';
			else if(!present[2])res[i]=res[i+1]='B';
		}
		for(int j=i-1;j>=0;j--){
			if(arr[j]!=1)break;
			vector<bool> present(3);
			if(S[j]=='R')present[0]=true;
			else if(S[j]=='G')present[1]=true;
			else if(S[j]=='B')present[2]=true;
			if(res[j+1]=='R')present[0]=true;
			else if(res[j+1]=='G')present[1]=true;
			else if(res[j+1]=='B')present[2]=true;
			if(!present[0])res[j]='R';
			else if(!present[1])res[j]='G';
			else if(!present[2])res[j]='B';
		}
		for(int j=i+2;j<N;j++){
			if(arr[j-1]!=1)break;
			vector<bool> present(3);
			if(S[j]=='R')present[0]=true;
			else if(S[j]=='G')present[1]=true;
			else if(S[j]=='B')present[2]=true;
			if(res[j-1]=='R')present[0]=true;
			else if(res[j-1]=='G')present[1]=true;
			else if(res[j-1]=='B')present[2]=true;
			if(!present[0])res[j]='R';
			else if(!present[1])res[j]='G';
			else if(!present[2])res[j]='B';	
		}
	}
	for(int i=0;i<N;i++){
		if(res[i]=='$'){
			if(S[i]=='R')res[i]='B';
			else if(S[i]=='B')res[i]='G';
			else if(S[i]=='G')res[i]='R';
		}
		for(int j=i+1;j<N;j++){
			if(arr[j-1]!=1)break;
			vector<bool> present(3);
			if(S[j]=='R')present[0]=true;
			else if(S[j]=='G')present[1]=true;
			else if(S[j]=='B')present[2]=true;
			if(res[j-1]=='R')present[0]=true;
			else if(res[j-1]=='G')present[1]=true;
			else if(res[j-1]=='B')present[2]=true;
			if(!present[0])res[j]='R';
			else if(!present[1])res[j]='G';
			else if(!present[2])res[j]='B';	
		}
	}
	return res;
}


vector<int> generateDe(int n){
	vector<int> debrujin;
	n--;
	for(int i=1;i<=n;i++)debrujin.emplace_back(1);
	vector<pair<bool,bool>> visited(1<<n);
	function<void(int)> dfs = [&](int x){
		if(!visited[x].first){
			debrujin.emplace_back(0);
			visited[x].first=true;
			dfs((x<<1)&((1<<n)-1));
		}
		if(!visited[x].second){
			debrujin.emplace_back(1);
			visited[x].second=true;
			dfs(((x<<1)&((1<<n)-1))+1);
		}
	};
	dfs(0);
	return debrujin;
}

}

pair<string, int> anna(int N, string S) {
	if(N<=56){
		string res;
		for(int i=0;i<N;i++){
			if(S[i]=='R')res.insert(res.end(),'B');
			else if(S[i]=='B')res.insert(res.end(),'G');
			else if(S[i]=='G')res.insert(res.end(),'R');
		}
		return {res,N};
	}
	auto debrujin = generateDe(18);
	vector<int> res(N+6,2);
	int itr = 0;
	for(int i=1;i<N;i+=3){
		if(debrujin[itr++]==0){
			res[i]=0;
			res[i+1]=1;
		} else {
			res[i-1]=res[i]=res[i+1]=1;
		}
	}
	return {calc(res,S),56};
}
#include "Bruno.h"
#include <bits/stdc++.h>
using namespace std;

namespace {

int N;
int l;

vector<int> generateDe(int n){
	vector<int> debrujin;
	n--;
	for(int i=1;i<=n;i++)debrujin.emplace_back(1);
	vector<pair<bool,bool>> visited(1<<n);
	function<void(int)> dfs = [&](int x){
		if(!visited[x].first){
			debrujin.emplace_back(0);
			visited[x].first=true;
			dfs((x<<1)&((1<<n)-1));
		}
		if(!visited[x].second){
			debrujin.emplace_back(1);
			visited[x].second=true;
			dfs(((x<<1)&((1<<n)-1))+1);
		}
	};
	dfs(0);
	return debrujin;
}

vector<int> debrujin;

}  // namespace

void init(int N, int l) {
	::N = N;
	::l = l;
	debrujin = generateDe(18);
}

int bruno(string u) {
	if(N<=56)return 1;
	vector<int> res(l-1);
	for(int i=0;i<l-1;i++)res[i]=u[i]!=u[i+1];
	bool found = false;
	int offset = 0;
	for(int i=0;i<l-2;i++){
		if(res[i])continue;
		if(res[i+1]==0)offset=(i+1)%3;
		else offset = i%3;
		found = true;
		break;
	}
	assert(found);
	vector<int> myseq;
	for(int i=offset;i<l-1;i+=3){
		if(myseq.size()==18)break;
		myseq.emplace_back(res[i]);
	}
	assert(myseq.size()==18);
	for(int i=0;i<N;i++){
		bool works = true;
		for(int j=0;j<18;j++){
			if(myseq[j]!=debrujin[i+j]){works=false;break;}
		}
		if(!works)continue;
		assert(i*3+2-offset<=N);
		return i*3+2-offset;
	}
	assert(false);
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 34 ms 15996 KB Output is correct
2 Correct 34 ms 15996 KB Output is correct
3 Correct 37 ms 16020 KB Output is correct
4 Correct 35 ms 15996 KB Output is correct
5 Correct 55 ms 30620 KB Output is correct
6 Correct 56 ms 30816 KB Output is correct
7 Correct 53 ms 30748 KB Output is correct
8 Correct 80 ms 30620 KB Output is correct
9 Correct 35 ms 16008 KB Output is correct
10 Correct 37 ms 16004 KB Output is correct
11 Correct 36 ms 15932 KB Output is correct
12 Correct 58 ms 16044 KB Output is correct
13 Correct 35 ms 15936 KB Output is correct
14 Correct 36 ms 16000 KB Output is correct
15 Correct 57 ms 16004 KB Output is correct
16 Correct 37 ms 15940 KB Output is correct
17 Correct 37 ms 16012 KB Output is correct
18 Correct 43 ms 16000 KB Output is correct
19 Correct 41 ms 15996 KB Output is correct
20 Correct 38 ms 15996 KB Output is correct
21 Correct 38 ms 15964 KB Output is correct
22 Correct 59 ms 16000 KB Output is correct
23 Correct 37 ms 15996 KB Output is correct
24 Correct 40 ms 15996 KB Output is correct
25 Correct 52 ms 30736 KB Output is correct
26 Correct 64 ms 30624 KB Output is correct
27 Correct 52 ms 30772 KB Output is correct
28 Correct 78 ms 30744 KB Output is correct
29 Correct 76 ms 30748 KB Output is correct
30 Correct 52 ms 30720 KB Output is correct
31 Correct 86 ms 30724 KB Output is correct
32 Correct 60 ms 30740 KB Output is correct
33 Correct 53 ms 30604 KB Output is correct
34 Correct 35 ms 16028 KB Output is correct
35 Correct 60 ms 15996 KB Output is correct
36 Correct 54 ms 30872 KB Output is correct
37 Correct 53 ms 30748 KB Output is correct
38 Correct 76 ms 30604 KB Output is correct
39 Correct 79 ms 30872 KB Output is correct
40 Correct 55 ms 30620 KB Output is correct
41 Correct 56 ms 30740 KB Output is correct
42 Correct 60 ms 30752 KB Output is correct

Subtask #2
0.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 34 ms 15996 KB Output is correct
2 Correct 34 ms 15996 KB Output is correct
3 Correct 37 ms 16020 KB Output is correct
4 Correct 35 ms 15996 KB Output is correct
5 Correct 55 ms 30620 KB Output is correct
6 Correct 56 ms 30816 KB Output is correct
7 Correct 53 ms 30748 KB Output is correct
8 Correct 80 ms 30620 KB Output is correct
9 Correct 35 ms 16008 KB Output is correct
10 Correct 37 ms 16004 KB Output is correct
11 Correct 36 ms 15932 KB Output is correct
12 Correct 58 ms 16044 KB Output is correct
13 Correct 35 ms 15936 KB Output is correct
14 Correct 36 ms 16000 KB Output is correct
15 Correct 57 ms 16004 KB Output is correct
16 Correct 37 ms 15940 KB Output is correct
17 Correct 37 ms 16012 KB Output is correct
18 Correct 43 ms 16000 KB Output is correct
19 Correct 41 ms 15996 KB Output is correct
20 Correct 38 ms 15996 KB Output is correct
21 Correct 38 ms 15964 KB Output is correct
22 Correct 59 ms 16000 KB Output is correct
23 Correct 37 ms 15996 KB Output is correct
24 Correct 40 ms 15996 KB Output is correct
25 Correct 52 ms 30736 KB Output is correct
26 Correct 64 ms 30624 KB Output is correct
27 Correct 52 ms 30772 KB Output is correct
28 Correct 78 ms 30744 KB Output is correct
29 Correct 76 ms 30748 KB Output is correct
30 Correct 52 ms 30720 KB Output is correct
31 Correct 86 ms 30724 KB Output is correct
32 Correct 60 ms 30740 KB Output is correct
33 Correct 53 ms 30604 KB Output is correct
34 Correct 35 ms 16028 KB Output is correct
35 Correct 60 ms 15996 KB Output is correct
36 Correct 54 ms 30872 KB Output is correct
37 Correct 53 ms 30748 KB Output is correct
38 Correct 76 ms 30604 KB Output is correct
39 Correct 79 ms 30872 KB Output is correct
40 Correct 55 ms 30620 KB Output is correct
41 Correct 56 ms 30740 KB Output is correct
42 Correct 60 ms 30752 KB Output is correct
43 Incorrect 78 ms 30620 KB Wrong Answer [5]
44 Halted 0 ms 0 KB -

Subtask #3
0.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 34 ms 15996 KB Output is correct
2 Correct 34 ms 15996 KB Output is correct
3 Correct 37 ms 16020 KB Output is correct
4 Correct 35 ms 15996 KB Output is correct
5 Correct 55 ms 30620 KB Output is correct
6 Correct 56 ms 30816 KB Output is correct
7 Correct 53 ms 30748 KB Output is correct
8 Correct 80 ms 30620 KB Output is correct
9 Correct 35 ms 16008 KB Output is correct
10 Correct 37 ms 16004 KB Output is correct
11 Correct 36 ms 15932 KB Output is correct
12 Correct 58 ms 16044 KB Output is correct
13 Correct 35 ms 15936 KB Output is correct
14 Correct 36 ms 16000 KB Output is correct
15 Correct 57 ms 16004 KB Output is correct
16 Correct 37 ms 15940 KB Output is correct
17 Correct 37 ms 16012 KB Output is correct
18 Correct 43 ms 16000 KB Output is correct
19 Correct 41 ms 15996 KB Output is correct
20 Correct 38 ms 15996 KB Output is correct
21 Correct 38 ms 15964 KB Output is correct
22 Correct 59 ms 16000 KB Output is correct
23 Correct 37 ms 15996 KB Output is correct
24 Correct 40 ms 15996 KB Output is correct
25 Correct 52 ms 30736 KB Output is correct
26 Correct 64 ms 30624 KB Output is correct
27 Correct 52 ms 30772 KB Output is correct
28 Correct 78 ms 30744 KB Output is correct
29 Correct 76 ms 30748 KB Output is correct
30 Correct 52 ms 30720 KB Output is correct
31 Correct 86 ms 30724 KB Output is correct
32 Correct 60 ms 30740 KB Output is correct
33 Correct 53 ms 30604 KB Output is correct
34 Correct 35 ms 16028 KB Output is correct
35 Correct 60 ms 15996 KB Output is correct
36 Correct 54 ms 30872 KB Output is correct
37 Correct 53 ms 30748 KB Output is correct
38 Correct 76 ms 30604 KB Output is correct
39 Correct 79 ms 30872 KB Output is correct
40 Correct 55 ms 30620 KB Output is correct
41 Correct 56 ms 30740 KB Output is correct
42 Correct 60 ms 30752 KB Output is correct
43 Incorrect 78 ms 30620 KB Wrong Answer [5]
44 Halted 0 ms 0 KB -

Subtask #4
0.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 34 ms 15996 KB Output is correct
2 Correct 34 ms 15996 KB Output is correct
3 Correct 37 ms 16020 KB Output is correct
4 Correct 35 ms 15996 KB Output is correct
5 Correct 55 ms 30620 KB Output is correct
6 Correct 56 ms 30816 KB Output is correct
7 Correct 53 ms 30748 KB Output is correct
8 Correct 80 ms 30620 KB Output is correct
9 Correct 35 ms 16008 KB Output is correct
10 Correct 37 ms 16004 KB Output is correct
11 Correct 36 ms 15932 KB Output is correct
12 Correct 58 ms 16044 KB Output is correct
13 Correct 35 ms 15936 KB Output is correct
14 Correct 36 ms 16000 KB Output is correct
15 Correct 57 ms 16004 KB Output is correct
16 Correct 37 ms 15940 KB Output is correct
17 Correct 37 ms 16012 KB Output is correct
18 Correct 43 ms 16000 KB Output is correct
19 Correct 41 ms 15996 KB Output is correct
20 Correct 38 ms 15996 KB Output is correct
21 Correct 38 ms 15964 KB Output is correct
22 Correct 59 ms 16000 KB Output is correct
23 Correct 37 ms 15996 KB Output is correct
24 Correct 40 ms 15996 KB Output is correct
25 Correct 52 ms 30736 KB Output is correct
26 Correct 64 ms 30624 KB Output is correct
27 Correct 52 ms 30772 KB Output is correct
28 Correct 78 ms 30744 KB Output is correct
29 Correct 76 ms 30748 KB Output is correct
30 Correct 52 ms 30720 KB Output is correct
31 Correct 86 ms 30724 KB Output is correct
32 Correct 60 ms 30740 KB Output is correct
33 Correct 53 ms 30604 KB Output is correct
34 Correct 35 ms 16028 KB Output is correct
35 Correct 60 ms 15996 KB Output is correct
36 Correct 54 ms 30872 KB Output is correct
37 Correct 53 ms 30748 KB Output is correct
38 Correct 76 ms 30604 KB Output is correct
39 Correct 79 ms 30872 KB Output is correct
40 Correct 55 ms 30620 KB Output is correct
41 Correct 56 ms 30740 KB Output is correct
42 Correct 60 ms 30752 KB Output is correct
43 Incorrect 78 ms 30620 KB Wrong Answer [5]
44 Halted 0 ms 0 KB -

Subtask #5
0.0 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Correct 57 ms 16072 KB Output is correct
2 Correct 36 ms 15996 KB Output is correct
3 Correct 36 ms 15928 KB Output is correct
4 Correct 39 ms 15968 KB Output is correct
5 Partially correct 64 ms 30900 KB Partially correct
6 Partially correct 59 ms 30620 KB Partially correct
7 Partially correct 54 ms 30632 KB Partially correct
8 Partially correct 55 ms 30620 KB Partially correct
9 Incorrect 66 ms 30632 KB Wrong Answer [5]
10 Halted 0 ms 0 KB -