| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 1091058 | Abito | Floppy (RMI20_floppy) | C++17 | 26 ms | 6044 KiB | 
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#include "floppy.h"
#define pb push_back
using namespace std;
void read_array(int subtask_id, const std::vector<int> &v) {
    stack<int> s;
    int n=v.size(),b[n];
    string ans="";
    for (int i=n-1;i>=0;i--){
		 b[i]=0;
		 while (!s.empty() && v[s.top()]<v[i]) s.pop();
		 if (!s.empty()) b[i]=s.top();
		 s.push(i);
	 }
	 for (int i=0;i<n;i++){
		 for (int j=0;j<14;j++){
			 if (b[i]&(1<<j)) ans+='1';
			 else ans+='0';
		 }
	 }
	 //for (int i=0;i<n;i++) cout<<b[i]<<' ';cout<<endl;
	 save_to_floppy(ans);
	 return;
}
std::vector<int> solve_queries(int subtask_id, int n,
        const std::string &bits,
        const std::vector<int> &L, const std::vector<int> &R) {
	vector<int> ans;
	int c[n];
	for (int i=0;i<n;i++){
		c[i]=0;
		for (int j=i*14;j<(i+1)*14;j++){
			if (bits[j]=='1') c[i]|=(1<<(j-i*14));
		}
	}
	for (int i=0;i<L.size();i++){
		int l=L[i],r=R[i];
		while (true){
			if (c[l]==0 || c[l]>r) break;
			l=c[l];
		}
		ans.pb(l);
	}
	//for (auto u:ans) cout<<u<<' ';cout<<endl;
	return ans;
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
