oj.uz

Submission #965414

# Submission time Handle Problem Language Result Execution time Memory
965414 2024-04-18T13:10:00 Z emptypringlescan Ancient Machine (JOI21_ancient_machine) C++17
0 / 100
 30 ms 8328 KB 
#include "Anna.h"
#include <bits/stdc++.h>
using namespace std;

void Anna(int N, vector<char> S){
	bool st=true;
	vector<int> old;
	for(int i=0; i<N; i++){
		if(st&&S[i]=='X') old.push_back(0),st=false;
		else if(st||S[i]=='Z') old.push_back(1);
		else old.push_back(0);
	}
	for(int i=0; i<3; i++) old.push_back(0);
	for(int i=0; i<N; i+=3){
		int x=old[i]<<2|old[i+1]<<1|old[i+2];
		if(x==0) Send(0),Send(0);
		else if(x==0b001||x==0b011||x==0b111) Send(0),Send(1);
		else if(x==0b010||x==0b110) Send(1),Send(0);
		else Send(1),Send(1);
	}
}

#include "Bruno.h"
#include <bits/stdc++.h>
using namespace std;
void Bruno(int N, int L, std::vector<int> b) {
	vector<int> A;
	for(int i=0; i<L; i+=2){
		int x=b[i]<<1|b[i+1];
		if(x==0) A.push_back(0),A.push_back(0),A.push_back(0);
		else if(x==1) A.push_back(0),A.push_back(0),A.push_back(1);
		else if(x==2) A.push_back(0),A.push_back(1),A.push_back(0);
		else A.push_back(1),A.push_back(0),A.push_back(0);
	}
	stack<int> st;
	for(int i=0; i<N; i++){
		if(A[i]==0&&i!=N-1) st.push(i);
		else{
			while(st.size()>1){
				Remove(st.top());
				st.pop();
			}
			Remove(i);
		}
	}
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 1048 KB Wrong Answer [5]
2 Halted 0 ms 0 KB -

Subtask #2
0 / 95.0

# Verdict Execution time Memory Grader output
1 Incorrect 30 ms 8328 KB Wrong Answer [5]
2 Halted 0 ms 0 KB -