# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
484296 | EntropyX | Deda (COCI17_deda) | C++17 | 1092 ms | 7856 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>
#define _ ios_base::sync_with_stdio(0);cin.tie(0);
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define iiordered_set tree<pll, null_type,less<pll>, rb_tree_tag,tree_order_statistics_node_update>
using namespace std;
//Bit Functions
#define gcd __gcd
#define lsb __builtin_ffs
#define ldz __builtin_clz
#define tlz __builtin_ctz
#define stc __builtin_popcount
#define prtb(n) cout << bitset<20>(n) << "\n";
//Debugging
#define error(args...) { string _s = #args; replace(_s.begin(), _s.end(), ',', ' '); stringstream _ss(_s); istream_iterator<string> _it(_ss); err(_it, args); }
#define what_is(x) cerr << #x << " is " << x << endl;
void err(istream_iterator<string> it) {}
template<typename T, typename... Args>
void err(istream_iterator<string> it, T a, Args... args) {
cerr << *it << " = " << a << endl;
err(++it, args...);
}
//STL Declarations
#define vi vector<int>
#define vvi vector<vi>
#define vl vector<long long int>
#define vvl vector<vl>
#define vb vector<bool>
#define pii pair<int,int>
#define fr first
#define sc second
#define u_s unordered_set
#define ump unordered_map
#define ins insert
#define p_q(x) priority_queue<x>
//STL Functions
#define mt make_tuple
#define eb emplace_back
#define rep(i, begin, end) for (__typeof(end) i = (begin) - ((begin) > (end)); i != (end) - ((begin) > (end)); i += 1 - 2 * ((begin) > (end)))
#define muq make_unique
#define all(x) x.begin(),x.end()
#define rot(vec,k) rotate(vec.begin(), vec.begin() + k, vec.end());
#define bs(vec,key) binary_search(all(vec), key)
#define parti(vec,p) partition_point(all(vec), p) - vec.begin()
#define srt(cnt) sort(all(cnt))
#define lb(cnt,x) lower_bound(all(cnt),x)
#define ub(cnt,x) upper_bound(all(cnt),x)
#define mxm(cnt) *max_element(all(cnt))
#define mnm(cnt) *min_element(all(cnt))
#define mxmptr(cnt) max_element(all(cnt))
#define mnmptr(cnt) min_element(all(cnt))
#define rev(cnt) reverse(all(cnt))
#define accum(cnt) accumulate(all(cnt),0)
#define look(cnt) for(auto c:cnt) cout<<c<<" "; cout<<"\n";
#define pre(x,cont) find(all(cont),x)!=cont.end()
#define pb push_back
//Input Functions
template<class T> istream& operator >> (istream &is , vector<T> &v) { for(T &a : v) is >> a; return is; }
template<class T> ostream& operator << (ostream &os , const vector<T> &v) { for(const T &t : v) os << t<<" "; return os << endl; }
template<class T, class U> ostream& operator << (ostream &os , const pair<T, U> &v) { return os << v.first << " " << v.second ; }
typedef long long int ll;
ll mod = 10000000007;
//Generalised Sum Function
int sum() { return 0; }
template<typename T, typename... Args>
T sum(T a, Args... args) { return a + sum(args...); }
vector<int> seive(int N){
vector<bool> visited(N+1,false);
vi pr;
for(int i=2;i<=N;i++){
if(!visited[i]){
int j = i;
pr.pb(j);
while(j<=N){visited[j] = true;j+=i;}}}
return pr;
}
ll ceil(ll a,ll b){
if(b<0)a=-a,b=-b;
if(a>=0)return (a+b-1)/b;
return a/b;
}
long long bpow(long long a, long long b, long long m) {
a %= m;
long long res = 1;
while (b > 0) {
if (b & 1)res = res * a % m;
a = a * a % m;
b >>= 1;
}
return res;
}
ll inverse(ll a,ll m=mod)
{
return bpow(a,m-2,m);
}
vvl matmul(const vvl &a,const vvl &b,ll M=mod)
{
int n=a.size(),m=a[0].size(),l=b[0].size();
assert(m==b.size());
vvl c(n,vl(l,0));
rep(i,0,n)
rep(j,0,l)
rep(k,0,m)
{
c[i][j]=(c[i][j]+a[i][k]*b[k][j])%M;
}
return c;
}
vvl matpow(vvl a,ll p,ll M=mod)
{
assert(a.size()==a[0].size());
int n=a.size();
vvl res(n,vl(n,0));
rep(i,0,n) res[i][i]=1;
while(p>0)
{
if(p&1) res=matmul(res,a,M);
a=matmul(a,a,M);
p>>=1;
}
return res;
}
const ll COMBINATION_SIZE = 300005;
const ll MOD = 1e9+7;
struct Combination {
long long fac[COMBINATION_SIZE], inv[COMBINATION_SIZE];
bool built = 0;
void build(){
assert(MOD >= COMBINATION_SIZE);
fac[0] = 1;
for(int i = 1; i < COMBINATION_SIZE; i++) {
fac[i] = fac[i - 1] * i % MOD;
}
inv[COMBINATION_SIZE - 1] = inverse(fac[COMBINATION_SIZE - 1], MOD);
for(int i = COMBINATION_SIZE - 2; i >= 0; i--) {
inv[i] = inv[i + 1] * (i + 1) % MOD;
}
}
long long C(int x, int y){
if(y < 0 || y > x) {
return 0;
}
if(!built) {
built = 1;
build();
}
return fac[x] * inv[y] % MOD * inv[x-y] % MOD;
}
} comb;
void setIO(string s) { // the argument is the filename without the extension
freopen((s+".in").c_str(),"r",stdin);
freopen((s+".out").c_str(),"w",stdout);
}
int main(){ _
int n,q;cin >> n >> q;
vi segtree(4*n+10,INT_MAX);
function<void(int,int,int,int,int)> upd = [&](int node,int L,int R,int idx,int val){
if(L == R){
segtree[node] = val;
}
else{
int mid = (L+R)/2;
if(mid>=idx)
upd(node*2,L,mid,idx,val);
else
upd(node*2+1,mid+1,R,idx,val);
segtree[node] = min(segtree[node*2],segtree[node*2+1]);
}
};
function<int(int,int,int,int,int)> find = [&](int node,int L,int R,int l,int r){
if(l<=L && R<=r){
return segtree[node];
}
else if(r<L || R<l){
return INT_MAX;
}
else{
int mid = (L+R)/2;
return min(find(node*2,L,mid,l,r),find(node*2+1,mid+1,R,l,r));
}
};
rep(i,0,q){
char c;cin >> c;
if(c == 'M'){
int x,a;cin >> x >> a;
upd(1,0,n,a,x);
}
else{
int y,b;cin >> y >> b;
int l = b;
int r = n;
if(find(1,0,n,b,r)>y){
cout << "-1\n";
}
else if(find(1,0,n,b,l)<=y){
cout << b << "\n";
}
else{
while(r-l>1){
int mid = (l+r)/2;
if(find(1,0,n,b,mid)<=y){
r = mid;
}
else{
l = mid;
}
}
cout << r << "\n";
}
}
}
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |