oj.uz

Submission #578652

# Submission time Handle Problem Language Result Execution time Memory
578652 2022-06-17T12:42:42 Z zaneyu Floppy (RMI20_floppy) C++14
100 / 100
 113 ms 18024 KB 
#include <stdlib.h>
#include <string.h>

#include "floppy.h"
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
//order_of_key #of elements less than x
// find_by_order kth element
typedef long long int ll;
#define ld long double
#define pii pair<ll,int>
typedef tree<pii, null_type, less<pii>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
#define f first
#define s second
#define pb push_back
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define FILL(n,x) memset(n,x,sizeof(n))
#define ALL(_a) _a.begin(),_a.end()
#define sz(x) (int)x.size()
const ll maxn=1e5+5;
const ll maxlg=__lg(maxn)+2;
const ll INF64=4e18;
const int INF=0x3f3f3f3f;
const ll MOD=1e9+7;
const ld PI=acos(-1);
const ld eps=1e-9;
#define lowb(x) x&(-x)
#define MNTO(x,y) x=min(x,(__typeof__(x))y)
#define MXTO(x,y) x=max(x,(__typeof__(x))y)
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#define GET_POS(c,x) (lower_bound(c.begin(),c.end(),x)-c.begin())
template<typename T1,typename T2>
ostream& operator<<(ostream& out,pair<T1,T2> P){
    out<<P.f<<' '<<P.s;
    return out;
}
template<typename T>
ostream& operator<<(ostream& out,vector<T> V){
    REP(i,sz(V)) out<<V[i]<<((i!=sz(V)-1)?" ":"");
    return out;
}
int mult(ll a,ll b){
    if(a<0) a+=MOD;
    return (a*b)%MOD;
}
ll mypow(ll a,ll b){
    if(b<=0) return 1;
    ll res=1LL;
    while(b){
        if(b&1) res=mult(res,a);
        a=mult(a,a);
        b>>=1;
    }
    return res;
}
void read_array(int subtask_id, const std::vector<int> &v) {
    int n=sz(v);
    vector<int> vv;
    string s="";
    REP(i,n){
        while(sz(vv) and v[vv.back()]<v[i]){
            s.pb('1');
            vv.pop_back();
        }
        vv.pb(i);
        s.pb('0');
    }
    save_to_floppy(s);
}
vector<pii> qq[maxn];
std::vector<int> solve_queries(int subtask_id, int n,
        const std::string &bits,
        const std::vector<int> &a, const std::vector<int> &b) {
    int p=0;
    vector<int> vv;
    vector<int> ans(sz(a));
    REP(i,sz(b)) qq[b[i]].pb({a[i],i});
    REP(i,n){
        while(bits[p]=='1') vv.pop_back(),++p;
        ++p;
        vv.pb(i);
        for(auto x:qq[i]){
            ans[x.s]=*lower_bound(ALL(vv),x.f);
        }
    }
    return ans;
}

Compilation message

stub.cpp: In function 'void run2()':
stub.cpp:101:30: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  101 |     if (query_answers.size() != M) {
      |         ~~~~~~~~~~~~~~~~~~~~~^~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 5408 KB Output is correct
2 Correct 6 ms 5416 KB Output is correct
3 Correct 4 ms 5416 KB Output is correct
4 Correct 4 ms 5416 KB Output is correct
5 Correct 5 ms 5420 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 7468 KB Output is correct
2 Correct 23 ms 8240 KB Output is correct
3 Correct 25 ms 8336 KB Output is correct
4 Correct 27 ms 8472 KB Output is correct
5 Correct 24 ms 8192 KB Output is correct

Subtask #3
72.0 / 72.0

# Verdict Execution time Memory Grader output
1 Correct 100 ms 14480 KB Output is correct
2 Correct 113 ms 17904 KB Output is correct
3 Correct 92 ms 17880 KB Output is correct
4 Correct 96 ms 18024 KB Output is correct
5 Correct 97 ms 17968 KB Output is correct