oj.uz

Submission #1042821

# Submission time Handle Problem Language Result Execution time Memory
1042821 2024-08-03T12:36:31 Z Unforgettablepl Tricolor Lights (JOI24_tricolor) C++17
30 / 100
 207 ms 46500 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(0);
	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<=61){
		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=0;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),61};
}
#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(0);
	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;
map<int,int> lookup;

}  // namespace

void init(int N, int l) {
	::N = N;
	::l = l;
	debrujin = generateDe(18);
	for(int i=0;i<N;i++){
		int curr = 0;
		for(int j=0;j<20;j++){
			if(debrujin[i+j])curr|=(1<<j);
		}
		lookup[curr]=i;
	}
}

int bruno(string u) {
	if(N<=61)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()==20)break;
		myseq.emplace_back(res[i]);
	}
	int curr = 0;
	for(int i=0;i<20;i++){
		if(myseq[i])curr|=(1<<i);
	}
	return lookup[curr]*3+1-offset;
	assert(false);
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 16008 KB Output is correct
2 Correct 37 ms 15960 KB Output is correct
3 Correct 39 ms 15900 KB Output is correct
4 Correct 57 ms 15876 KB Output is correct
5 Correct 40 ms 15948 KB Output is correct
6 Correct 76 ms 30624 KB Output is correct
7 Correct 59 ms 30788 KB Output is correct
8 Correct 74 ms 30624 KB Output is correct
9 Correct 39 ms 15944 KB Output is correct
10 Correct 40 ms 16092 KB Output is correct
11 Correct 60 ms 15916 KB Output is correct
12 Correct 65 ms 15968 KB Output is correct
13 Correct 42 ms 15920 KB Output is correct
14 Correct 67 ms 15932 KB Output is correct
15 Correct 60 ms 15932 KB Output is correct
16 Correct 72 ms 15888 KB Output is correct
17 Correct 40 ms 15964 KB Output is correct
18 Correct 64 ms 15972 KB Output is correct
19 Correct 60 ms 15912 KB Output is correct
20 Correct 50 ms 15932 KB Output is correct
21 Correct 45 ms 16004 KB Output is correct
22 Correct 63 ms 15960 KB Output is correct
23 Correct 58 ms 15984 KB Output is correct
24 Correct 62 ms 15924 KB Output is correct
25 Correct 58 ms 15816 KB Output is correct
26 Correct 59 ms 15992 KB Output is correct
27 Correct 42 ms 15996 KB Output is correct
28 Correct 85 ms 30596 KB Output is correct
29 Correct 71 ms 30556 KB Output is correct
30 Correct 57 ms 30704 KB Output is correct
31 Correct 67 ms 30696 KB Output is correct
32 Correct 62 ms 30448 KB Output is correct
33 Correct 63 ms 30688 KB Output is correct
34 Correct 37 ms 16000 KB Output is correct
35 Correct 41 ms 15932 KB Output is correct
36 Correct 57 ms 16004 KB Output is correct
37 Correct 79 ms 30836 KB Output is correct
38 Correct 61 ms 30740 KB Output is correct
39 Correct 60 ms 30724 KB Output is correct
40 Correct 61 ms 30620 KB Output is correct
41 Correct 60 ms 30800 KB Output is correct
42 Correct 62 ms 30712 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 16008 KB Output is correct
2 Correct 37 ms 15960 KB Output is correct
3 Correct 39 ms 15900 KB Output is correct
4 Correct 57 ms 15876 KB Output is correct
5 Correct 40 ms 15948 KB Output is correct
6 Correct 76 ms 30624 KB Output is correct
7 Correct 59 ms 30788 KB Output is correct
8 Correct 74 ms 30624 KB Output is correct
9 Correct 39 ms 15944 KB Output is correct
10 Correct 40 ms 16092 KB Output is correct
11 Correct 60 ms 15916 KB Output is correct
12 Correct 65 ms 15968 KB Output is correct
13 Correct 42 ms 15920 KB Output is correct
14 Correct 67 ms 15932 KB Output is correct
15 Correct 60 ms 15932 KB Output is correct
16 Correct 72 ms 15888 KB Output is correct
17 Correct 40 ms 15964 KB Output is correct
18 Correct 64 ms 15972 KB Output is correct
19 Correct 60 ms 15912 KB Output is correct
20 Correct 50 ms 15932 KB Output is correct
21 Correct 45 ms 16004 KB Output is correct
22 Correct 63 ms 15960 KB Output is correct
23 Correct 58 ms 15984 KB Output is correct
24 Correct 62 ms 15924 KB Output is correct
25 Correct 58 ms 15816 KB Output is correct
26 Correct 59 ms 15992 KB Output is correct
27 Correct 42 ms 15996 KB Output is correct
28 Correct 85 ms 30596 KB Output is correct
29 Correct 71 ms 30556 KB Output is correct
30 Correct 57 ms 30704 KB Output is correct
31 Correct 67 ms 30696 KB Output is correct
32 Correct 62 ms 30448 KB Output is correct
33 Correct 63 ms 30688 KB Output is correct
34 Correct 37 ms 16000 KB Output is correct
35 Correct 41 ms 15932 KB Output is correct
36 Correct 57 ms 16004 KB Output is correct
37 Correct 79 ms 30836 KB Output is correct
38 Correct 61 ms 30740 KB Output is correct
39 Correct 60 ms 30724 KB Output is correct
40 Correct 61 ms 30620 KB Output is correct
41 Correct 60 ms 30800 KB Output is correct
42 Correct 62 ms 30712 KB Output is correct
43 Correct 66 ms 30700 KB Output is correct
44 Correct 53 ms 30740 KB Output is correct
45 Correct 66 ms 30772 KB Output is correct
46 Correct 63 ms 30668 KB Output is correct
47 Correct 60 ms 30596 KB Output is correct
48 Correct 55 ms 30724 KB Output is correct
49 Correct 68 ms 30564 KB Output is correct
50 Correct 67 ms 30572 KB Output is correct
51 Correct 57 ms 30788 KB Output is correct
52 Correct 59 ms 30700 KB Output is correct
53 Correct 59 ms 30624 KB Output is correct

Subtask #3
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 16008 KB Output is correct
2 Correct 37 ms 15960 KB Output is correct
3 Correct 39 ms 15900 KB Output is correct
4 Correct 57 ms 15876 KB Output is correct
5 Correct 40 ms 15948 KB Output is correct
6 Correct 76 ms 30624 KB Output is correct
7 Correct 59 ms 30788 KB Output is correct
8 Correct 74 ms 30624 KB Output is correct
9 Correct 39 ms 15944 KB Output is correct
10 Correct 40 ms 16092 KB Output is correct
11 Correct 60 ms 15916 KB Output is correct
12 Correct 65 ms 15968 KB Output is correct
13 Correct 42 ms 15920 KB Output is correct
14 Correct 67 ms 15932 KB Output is correct
15 Correct 60 ms 15932 KB Output is correct
16 Correct 72 ms 15888 KB Output is correct
17 Correct 40 ms 15964 KB Output is correct
18 Correct 64 ms 15972 KB Output is correct
19 Correct 60 ms 15912 KB Output is correct
20 Correct 50 ms 15932 KB Output is correct
21 Correct 45 ms 16004 KB Output is correct
22 Correct 63 ms 15960 KB Output is correct
23 Correct 58 ms 15984 KB Output is correct
24 Correct 62 ms 15924 KB Output is correct
25 Correct 58 ms 15816 KB Output is correct
26 Correct 59 ms 15992 KB Output is correct
27 Correct 42 ms 15996 KB Output is correct
28 Correct 85 ms 30596 KB Output is correct
29 Correct 71 ms 30556 KB Output is correct
30 Correct 57 ms 30704 KB Output is correct
31 Correct 67 ms 30696 KB Output is correct
32 Correct 62 ms 30448 KB Output is correct
33 Correct 63 ms 30688 KB Output is correct
34 Correct 37 ms 16000 KB Output is correct
35 Correct 41 ms 15932 KB Output is correct
36 Correct 57 ms 16004 KB Output is correct
37 Correct 79 ms 30836 KB Output is correct
38 Correct 61 ms 30740 KB Output is correct
39 Correct 60 ms 30724 KB Output is correct
40 Correct 61 ms 30620 KB Output is correct
41 Correct 60 ms 30800 KB Output is correct
42 Correct 62 ms 30712 KB Output is correct
43 Correct 66 ms 30700 KB Output is correct
44 Correct 53 ms 30740 KB Output is correct
45 Correct 66 ms 30772 KB Output is correct
46 Correct 63 ms 30668 KB Output is correct
47 Correct 60 ms 30596 KB Output is correct
48 Correct 55 ms 30724 KB Output is correct
49 Correct 68 ms 30564 KB Output is correct
50 Correct 67 ms 30572 KB Output is correct
51 Correct 57 ms 30788 KB Output is correct
52 Correct 59 ms 30700 KB Output is correct
53 Correct 59 ms 30624 KB Output is correct
54 Correct 57 ms 30612 KB Output is correct
55 Correct 59 ms 30624 KB Output is correct
56 Correct 66 ms 30620 KB Output is correct
57 Correct 63 ms 30624 KB Output is correct
58 Correct 63 ms 30592 KB Output is correct
59 Correct 70 ms 30780 KB Output is correct
60 Correct 61 ms 30644 KB Output is correct
61 Correct 53 ms 30732 KB Output is correct
62 Correct 66 ms 30620 KB Output is correct
63 Correct 68 ms 30612 KB Output is correct
64 Correct 56 ms 30536 KB Output is correct
65 Correct 58 ms 30648 KB Output is correct
66 Correct 73 ms 30620 KB Output is correct
67 Correct 72 ms 30820 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 16008 KB Output is correct
2 Correct 37 ms 15960 KB Output is correct
3 Correct 39 ms 15900 KB Output is correct
4 Correct 57 ms 15876 KB Output is correct
5 Correct 40 ms 15948 KB Output is correct
6 Correct 76 ms 30624 KB Output is correct
7 Correct 59 ms 30788 KB Output is correct
8 Correct 74 ms 30624 KB Output is correct
9 Correct 39 ms 15944 KB Output is correct
10 Correct 40 ms 16092 KB Output is correct
11 Correct 60 ms 15916 KB Output is correct
12 Correct 65 ms 15968 KB Output is correct
13 Correct 42 ms 15920 KB Output is correct
14 Correct 67 ms 15932 KB Output is correct
15 Correct 60 ms 15932 KB Output is correct
16 Correct 72 ms 15888 KB Output is correct
17 Correct 40 ms 15964 KB Output is correct
18 Correct 64 ms 15972 KB Output is correct
19 Correct 60 ms 15912 KB Output is correct
20 Correct 50 ms 15932 KB Output is correct
21 Correct 45 ms 16004 KB Output is correct
22 Correct 63 ms 15960 KB Output is correct
23 Correct 58 ms 15984 KB Output is correct
24 Correct 62 ms 15924 KB Output is correct
25 Correct 58 ms 15816 KB Output is correct
26 Correct 59 ms 15992 KB Output is correct
27 Correct 42 ms 15996 KB Output is correct
28 Correct 85 ms 30596 KB Output is correct
29 Correct 71 ms 30556 KB Output is correct
30 Correct 57 ms 30704 KB Output is correct
31 Correct 67 ms 30696 KB Output is correct
32 Correct 62 ms 30448 KB Output is correct
33 Correct 63 ms 30688 KB Output is correct
34 Correct 37 ms 16000 KB Output is correct
35 Correct 41 ms 15932 KB Output is correct
36 Correct 57 ms 16004 KB Output is correct
37 Correct 79 ms 30836 KB Output is correct
38 Correct 61 ms 30740 KB Output is correct
39 Correct 60 ms 30724 KB Output is correct
40 Correct 61 ms 30620 KB Output is correct
41 Correct 60 ms 30800 KB Output is correct
42 Correct 62 ms 30712 KB Output is correct
43 Correct 66 ms 30700 KB Output is correct
44 Correct 53 ms 30740 KB Output is correct
45 Correct 66 ms 30772 KB Output is correct
46 Correct 63 ms 30668 KB Output is correct
47 Correct 60 ms 30596 KB Output is correct
48 Correct 55 ms 30724 KB Output is correct
49 Correct 68 ms 30564 KB Output is correct
50 Correct 67 ms 30572 KB Output is correct
51 Correct 57 ms 30788 KB Output is correct
52 Correct 59 ms 30700 KB Output is correct
53 Correct 59 ms 30624 KB Output is correct
54 Correct 57 ms 30612 KB Output is correct
55 Correct 59 ms 30624 KB Output is correct
56 Correct 66 ms 30620 KB Output is correct
57 Correct 63 ms 30624 KB Output is correct
58 Correct 63 ms 30592 KB Output is correct
59 Correct 70 ms 30780 KB Output is correct
60 Correct 61 ms 30644 KB Output is correct
61 Correct 53 ms 30732 KB Output is correct
62 Correct 66 ms 30620 KB Output is correct
63 Correct 68 ms 30612 KB Output is correct
64 Correct 56 ms 30536 KB Output is correct
65 Correct 58 ms 30648 KB Output is correct
66 Correct 73 ms 30620 KB Output is correct
67 Correct 72 ms 30820 KB Output is correct
68 Correct 62 ms 30532 KB Output is correct
69 Correct 63 ms 30628 KB Output is correct
70 Correct 64 ms 30640 KB Output is correct
71 Correct 80 ms 30692 KB Output is correct
72 Correct 85 ms 30628 KB Output is correct
73 Correct 80 ms 30700 KB Output is correct
74 Correct 62 ms 30788 KB Output is correct
75 Correct 60 ms 30624 KB Output is correct
76 Correct 65 ms 30628 KB Output is correct
77 Correct 64 ms 30704 KB Output is correct
78 Correct 61 ms 30620 KB Output is correct
79 Correct 91 ms 30584 KB Output is correct

Subtask #5
0.0 / 70.0

# Verdict Execution time Memory Grader output
1 Correct 57 ms 16216 KB Output is correct
2 Correct 39 ms 15996 KB Output is correct
3 Correct 39 ms 15996 KB Output is correct
4 Correct 37 ms 15996 KB Output is correct
5 Partially correct 41 ms 15928 KB Partially correct
6 Partially correct 66 ms 30716 KB Partially correct
7 Partially correct 57 ms 30728 KB Partially correct
8 Partially correct 56 ms 30644 KB Partially correct
9 Partially correct 83 ms 30532 KB Partially correct
10 Partially correct 56 ms 30728 KB Partially correct
11 Partially correct 84 ms 30760 KB Partially correct
12 Partially correct 77 ms 30624 KB Partially correct
13 Partially correct 61 ms 30732 KB Partially correct
14 Partially correct 62 ms 30740 KB Partially correct
15 Incorrect 207 ms 46500 KB Wrong Answer [5]
16 Halted 0 ms 0 KB -