Submission #1266732

#	Time	Username	Problem	Language	Result	Execution time	Memory
1266732		thelegendary08	Tricolor Lights (JOI24_tricolor)	C++17	0 / 100	25 ms	1732 KiB

Anna

#include "Anna.h"
#include<bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define int long long
#define vi vector<int>
#define vvi vector<vector<int>>
#define pii pair<int, int>
#define vpii vector<pair<int, int>>
#define vc vector<char>
#define vb vector<bool>
#define mii map<int,int>
#define f0r(i,n) for(int i=0;i<n;i++)
#define FOR(i,k,n) for(int i=k;i<n;i++)
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define in(a) int a; cin>>a
#define in2(a,b) int a,b; cin>>a>>b
#define in3(a,b,c) int a,b,c; cin>>a>>b>>c
#define in4(a,b,c,d) int a,b,c,d; cin>>a>>b>>c>>d
#define vin(v,n); vi v(n); f0r(i,n){cin>>v[i];}
#define out(a) cout<<a<<'\n'
#define out2(a,b) cout<<a<<' '<<b<<'\n'
#define out3(a,b,c) cout<<a<<' '<<b<<' '<<c<<'\n'
#define out4(a,b,c,d) cout<<a<<' '<<b<<' '<<c<<' '<<d<<'\n'
#define pout(a) cout<<a.first<<' '<<a.second<<'\n'
#define vout(v) for(auto u : v){cout<<u<<' ';} cout<<endl
#define dout(a) cout<<a<<' '<<#a<<endl
#define dout2(a,b) cout<<a<<' '<<#a<<' '<<b<<' '<<#b<<endl
#define yn(x); if(x){cout<<"YES"<<'\n';}else{cout<<"NO"<<'\n';}
const int leg = 1e9 + 7;
const int mod = 998244353;
using namespace std;
namespace {
	int l = 130; 
	vector<char>crs = {'R','G','B'};
	string gen(vi &v, string s){
		vector<char>ret(v.size() + 1, 'X'); 
		int n = v.size(); 
		vi same; 
		f0r(i, n){
			if(v[i] == 1){
				for(auto ch : crs){
					if(s[i] != ch && s[i+1] != ch){
						ret[i] = ch; ret[i+1] = ch; break;
					}
				}
				same.pb(i); 
			}
		}
		
		f0r(i, same.size()){
			int cur = same[i] - 1; 
			while(cur >= 0 && (i == 0 || cur >= same[i-1] + 2)){
				for(auto ch : crs){
					if(s[cur] != ch && ret[cur+1] != ch){
						ret[cur] = ch; break; 
					}
				}
				cur--; 
			}
		}
		string r = ""; for(auto u : ret)r += u;
		return r; 
	}
}

std::pair<std::string, signed> anna(signed N, std::string S) {
	vi v; 
	f0r(i,N)v.pb(0); v.pb(1);
	for(int i = l - 3; i >= 4; i-=2){
		f0r(j,i)v.pb(0);
		f0r(j,l-i){
			if(j % 2 == 0)v.pb(1); 
			else v.pb(0);
		}
	}
	string ret = gen(v, S);
  	if(N < l){
  		return mp(ret.substr(0, N), N);
  	}
  	else{
  		return mp(ret.substr(0, N), l);
  	}
}

Bruno

#include "Bruno.h"
#include<bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define int long long
#define vi vector<int>
#define vvi vector<vector<int>>
#define pii pair<int, int>
#define vpii vector<pair<int, int>>
#define vc vector<char>
#define vb vector<bool>
#define mii map<int,int>
#define f0r(i,n) for(int i=0;i<n;i++)
#define FOR(i,k,n) for(int i=k;i<n;i++)
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define in(a) int a; cin>>a
#define in2(a,b) int a,b; cin>>a>>b
#define in3(a,b,c) int a,b,c; cin>>a>>b>>c
#define in4(a,b,c,d) int a,b,c,d; cin>>a>>b>>c>>d
#define vin(v,n); vi v(n); f0r(i,n){cin>>v[i];}
#define out(a) cout<<a<<'\n'
#define out2(a,b) cout<<a<<' '<<b<<'\n'
#define out3(a,b,c) cout<<a<<' '<<b<<' '<<c<<'\n'
#define out4(a,b,c,d) cout<<a<<' '<<b<<' '<<c<<' '<<d<<'\n'
#define pout(a) cout<<a.first<<' '<<a.second<<'\n'
#define vout(v) for(auto u : v){cout<<u<<' ';} cout<<endl
#define dout(a) cout<<a<<' '<<#a<<endl
#define dout2(a,b) cout<<a<<' '<<#a<<' '<<b<<' '<<#b<<endl
#define yn(x); if(x){cout<<"YES"<<'\n';}else{cout<<"NO"<<'\n';}
const int leg = 1e9 + 7;
const int mod = 998244353;
using namespace std;
namespace {

signed N,l;
}  // namespace

void init(signed N, signed l) {
  ::N = N; ::l=l;
}

signed bruno(std::string u) {
	if(u.size() == N)return 1; 
	vi v; 
	f0r(i, l-1){
		v.pb(u[i] == u[i+1]);
	}
	int sum = 0; f0r(i, l-1)sum += v[i]; 
	if(sum == 0)return 1; 
	int ans = 1 + (l - 2) * (sum - 1);
	int f = -1; 
	f0r(i, l-2){
		if(v[i] == v[i+1]){
			f = i; break; 
		}
	}
	
	if(f != 0){
		return ans + sum * 2 - 2 - f; 
	}
	else{
		int L = 0; 
		f0r(i, l-1){
			if(v[i] == 0)L++; 
			else break; 
		}
		return ans + sum * 2 - 2 + (l - (sum*2-1) - L);
	}
}

• Subtask 1: 0 / 5
• Subtask 2: 0 / 5
• Subtask 3: 0 / 5
• Subtask 4: 0 / 15
• Subtask 5: 0 / 70