oj.uz

Submission #523082

# Submission time Handle Problem Language Result Execution time Memory
523082 2022-02-07T02:49:15 Z amunduzbaev Ancient Machine (JOI21_ancient_machine) C++17
0 / 100
 54 ms 11044 KB 
#include "Anna.h"
#include "bits/stdc++.h"
using namespace std;

#define ar array

void Anna(int n, vector<char> s) {
	vector<int> res(n);
	ar<int, 3> last {n, n, n};
	vector<ar<int, 3>> par(n + 1); par[n] = last;
	vector<ar<int, 3>> rap(n); 
	for(int i=n-1;~i;i--){
		last[s[i] - 'X'] = i;
		par[i] = last;
	}
	
	last[0] = last[1] = last[2] = -1;
	for(int i=0;i<n;i++){
		last[s[i] - 'X'] = i;
		rap[i] = last;
	}
	
	int i = par[0][0];
	vector<int> tt, tmp;
	if(i < n){
		int j = i; tt.push_back(i);
		while(j < n){
			j = par[j][1];
			int l = par[j][2];
			if(l < n){
				tt.push_back(j);
				tt.push_back(l);
			} j = l;
		}
	} i = rap[n - 1][2];
	if(~i){
		int j = i; tmp.push_back(i);
		while(~j){
			j = rap[j][1];
			if(~j){
				int l = rap[j][0];
				if(~l){
					tmp.push_back(j);
					tmp.push_back(l);
				} j = l;
			}
		}
	}
	
	if(tmp.size() <= tt.size()){
		for(auto x : tt) res[x] = 1;
		Send(0);
	} else {
		for(auto x : tmp) res[x] = 1;
		Send(1);
	}
	
	//~ for(int i=0;i<n;i++) cout<<res[i]<<" ";
	//~ cout<<endl;
	for(int i=0;i<n;i++){
		Send(res[i]);
	}
}

#include "Bruno.h"
#include "bits/stdc++.h"
using namespace std;

void Bruno(int n, int l, vector<int> a) {
	vector<int> res, tot;
	int is = a[0]; 
	a.erase(a.begin(), a.begin() + 1);
	for(int i=0;i<n;i++){
		if(a[i]) tot.push_back(i);
	}
	auto add = [&](int l, int r){
		for(int i=l;i<=r;i++){
			//~ cout<<i<<endl;
			Remove(i);
		}
	};
	if((int)tot.size() >= 3){
		assert((int)tot.size()&1);
		if(!is){
			add(0, tot[0] - 1);
			int last = tot[0];
			for(int i=1;i<(int)tot.size();i+=2){
				add(last + 1, tot[i] - 1);
				add(tot[i] + 1, tot[i+1] - 1);
				Remove(tot[i]);
				//~ cout<<tot[i]<<endl;
				Remove(tot[i+1]);
				//~ cout<<tot[i+1]<<endl;
				last = tot[i+1];
			}
			Remove(tot[0]);
			//~ cout<<tot[0]<<endl;
			add(last + 1, n - 1);
		} else {
			reverse(tot.begin(), tot.end());
			add(tot[0] + 1, n - 1);
			int last = tot[0];
			for(int i=1;i<(int)tot.size();i+=2){
				add(tot[i] + 1, last - 1);
				add(tot[i+1] + 1, tot[i] - 1);
				Remove(tot[i]);
				Remove(tot[i+1]);
				last = tot[i+1];
			} Remove(tot[0]);
			add(0, last - 1);
		}
	} else {
		add(0, n - 1);
	}
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 620 KB Output is correct
2 Correct 0 ms 492 KB Output is correct
3 Correct 0 ms 492 KB Output is correct
4 Correct 0 ms 492 KB Output is correct
5 Incorrect 0 ms 484 KB Wrong Answer [6]
6 Halted 0 ms 0 KB -

Subtask #2
0 / 95.0

# Verdict Execution time Memory Grader output
1 Partially correct 54 ms 10600 KB Partially correct
2 Partially correct 51 ms 11044 KB Partially correct
3 Incorrect 53 ms 10972 KB Wrong Answer [6]
4 Halted 0 ms 0 KB -