| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 947020 | thunopro | Floppy (RMI20_floppy) | C++14 | 0 ms | 0 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>
using namespace std ;
#define maxn 200009
#define ll long long
#define fi first
#define se second
#define pb push_back
#define left id<<1
#define right id<<1|1
#define re exit(0);
#define _lower(x) lower_bound(v.begin(),v.end(),x)-v.begin()
#define TIME 1.0*clock()/CLOCKS_PER_SEC
const int mod = 1e9+7;
const int INF = 1e9;
typedef vector<int> vi;
typedef pair<int,int> pii;
typedef vector<pii> vii;
typedef vector<ll> vl;
void add ( int &a , int b )
{
a += b ;
if ( a > mod ) a -= mod ;
if ( a < 0 ) a += mod ;
}
template <typename T> void chkmin ( T &a , T b ) { if ( a > b ) a = b ; }
template <typename T> void chkmax ( T &a , T b ) { if ( a < b ) a = b ; }
int _pow ( int a , int n )
{
if ( n == 0 ) return 1 ;
int res = _pow (a,n/2) ;
if ( n % 2 ) return 1ll*res*res%mod*a%mod ;
else return 1ll*res*res%mod ;
}
void rf ()
{
freopen ("bai1.inp","r",stdin) ;
}
#include "floppy.h"
void read_array ( int subtask_id , vi v )
{
vi q ;
string bits = "" ;
for ( auto x : v )
{
while ( !q.empty() && q.back() < x )
{
q . pop_back() ;
bits += '0' ;
}
q . pb (x) ;
bits += '1' ;
}
save_to_floppy (bits) ;
}
vi solve_queries ( int subtask_id , int n , string bits , vi a , vi b )
{
int m = a.size () ;
vector<vector<int>> queries (n) ;
for ( int i = 0 ; i < m ; i ++ )
{
queries [b[i]] . pb (i) ;
}
int idx = -1 ;
vi q , res (m) ;
for ( char b : bits )
{
if ( b == '1' )
{
q . pb (++idx) ;
for ( auto i : queries [idx] )
{
res [i] = *lower_bound (q.begin(),q.end(),a[i]) ;
}
}
else q.pop_back() ;
}
return res ;
}