oj.uz

Submission #405997

# Submission time Handle Problem Language Result Execution time Memory
405997 2021-05-17T06:19:18 Z zaneyu A Difficult(y) Choice (BOI21_books) C++14
0 / 100
 2 ms 308 KB 
/*input
3 5
1 4 4 3 4
1 4 1 4 2
1 4 4 4 3

*/


#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include "books.h"
using namespace std;
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> indexed_set;
//#pragma GCC optimize("O2","unroll-loops","no-stack-protector")
//order_of_key #of elements less than x
// find_by_order kth element
using ll=long long;
using ld=long double;
using pii=pair<int,int>;
#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()
#define SORT_UNIQUE(c)(sort(c.begin(),c.end()),c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
const ll INF64=4e18;
const int INF=0x3f3f3f3f;
const ll MOD=998244353;
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)
inline ll mult(ll a,ll b){
    if(a<0) a+=MOD;
    if(b<0) b+=MOD;
    if(a>=MOD) a%=MOD;
    if(b>=MOD) b%=MOD;
    return(a*b)%MOD;
}
inline 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;
}
const int maxn=1e5+5;
ll pref[maxn];
int k;
map<int,int> mp;
ll query(int x){
    if(mp.count(x)) return mp[x];
    return mp[x]=skim(x);
}
ll get(int i){
    ll ans=0;
    REP(j,k) ans+=query(i-j);
    return ans;
}
void solve(int n, int K, ll A, int s) {
    k=K;
    int l=k,r=n;
    while(l<r){
        int mid=(l+r)/2;
        if(get(mid)>=A) r=mid;
        else l=mid+1;
    }
    vector<int> v;
    if(get(l)<=2*A){
        REP(j,k) v.pb(l-j);
        answer(v);
        return;
    }
    l=1,r=n;
    while(l<r){
        int mid=(l+r)/2;
        if(query(mid)>A) r=mid;
        else l=mid+1;
    }
    if(l<k){
        impossible();
        return;
    }
    ll ans=query(l);
    v={l};
    REP1(i,k-1) ans+=query(i),v.pb(i);
    if(ans<=2*A){
        answer(v);
    }
    else{
        impossible();
    }
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 200 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 200 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 308 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 308 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 308 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 308 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #7
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 308 KB Incorrect
2 Halted 0 ms 0 KB -