Submission #965441

#	Time	Username	Problem	Language	Result	Execution time	Memory
965441		emptypringlescan	Ancient Machine (JOI21_ancient_machine)	C++17	0 / 100	1461 ms	262144 KiB

Anna

#include "Anna.h"
#include <bits/stdc++.h>
using namespace std;
unordered_map<long long,int> um;
int cnt;
void brute(int lvl, int cur, int prev){
	if(lvl>=40){
		um[cur]=cnt;
		cnt++;
		return;
	}
	if(prev==0){
		brute(lvl+1,cur,0);
		brute(lvl+2,1<<lvl|cur,0);
	}
	else brute(lvl+1,cur,0);
}
void Anna(int N, vector<char> S){
	brute(0,0,0);
	
}

Bruno

#include "Bruno.h"
#include <bits/stdc++.h>
using namespace std;
unordered_map<long long,int> um;
int cnt;
void brute(int lvl, int cur, int prev){
	if(lvl>=40){
		um[cur]=cnt;
		cnt++;
		return;
	}
	if(prev==0){
		brute(lvl+1,cur,0);
		brute(lvl+2,1<<lvl|cur,0);
	}
	else brute(lvl+1,cur,0);
}
void Bruno(int N, int L, vector<int> S){
	brute(0,0,0);
	
}

• Subtask 1: 0 / 5
• Subtask 2: 0 / 95