| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 250220 |
2020-07-17T08:42:03 Z |
leaked |
Deda (COCI17_deda) |
C++14 |
|
120 ms |
4600 KB |
#include<bits/stdc++.h>
using namespace std;
//#include<ext/pb_ds/assoc_container.hpp>
//#include<ext/pb_ds/tree_policy.hpp>
//////
// #pragma GCC optimize("unroll-loops")
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize("-O3")
// #pragma GCC optimize("no-stack-protector")
// #pragma GCC optimize("fast-math")
////#define LOCAL
#define sim template < class c
#define ris return * this
#define dor > debug & operator <<
#define eni(x) sim > typename \
enable_if<sizeof dud<c>(0) x 1, debug&>::type operator<<(c i) {
sim > struct rge { c b, e; };
sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
sim > auto dud(c* x) -> decltype(cout << *x, 0);
sim > char dud(...);
struct debug {
#ifndef LOCAL
~debug() { cout << endl; }
eni(!=) cout << boolalpha << i; ris; }
eni(==) ris << range(begin(i), end(i)); }
sim, class b dor(pair < b, c > d) {
ris << "(" << d.first << ", " << d.second << ")";
}
sim dor(rge<c> d) {
*this << "[";
for (auto it = d.b; it != d.e; ++it)
*this << ", " + 2 * (it == d.b) << *it;
ris << "]";
}
#else
sim dor(const c&) { ris; }
#endif
};
#define imie(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
#define fi first
#define f first
#define se second
#define s second
#define vi_a vector<int>a;
#define p_b push_back
////////////////////////////////???????????????CHECK THIS OUT???????????????//////////////////////////////
#define ll long long
//#define ull unsigned long long
typedef unsigned long long ull;
////////////////////////////////???????????????CHECK THIS OUT???????????????//////////////////////////////
#define ld long double
#define pll pair<ll,ll>
#define pii pair<int,int>
#define m_p make_pair
#define fast_io cin.tie(0);cout.tie(0);ios_base::sync_with_stdio(0);
#define all(x) x.begin(),x.end()
#define getfiles ifstream cin("input.txt");ofstream cout("output.txt");
#define pw(x) (1ll << x)
#define sz(x) (ll)x.size()
#define endl "\n"
#define rall(x) x.rbegin(),x.rend()
#define len(a) (ll)a.size()
#define rep(x,l,r) for(ll x=l;x<r;x++)
//using namespace __gnu_pbds;
ld eps = (ld)1 / 1e6;
const ld pi=3.14159265359;
ll inf = 1e18,mod1=1e9+7;
ll sqr(ll a) { return a * a; }
ll qb(ll a) { return a * a * a; }
ll gcd(ll a, ll b) { return !a ? b : gcd(b % a, a); }
void binary(ll val,int to) {for(int i=0;i<to;i++) cerr<<(pw(i) & val ? 1 : 0); cerr<<endl;}
ll binpow(ll a, ll b, ll mod) { return b ? (b % 2 ? (a * (sqr(binpow(a, b / 2, mod)) % mod)) % mod : sqr(binpow(a, b / 2, mod)) % mod) : 1; }
ll binmult(ll a, ll b, ll mod) { return b ? (b % 2 ? (2 * binmult(a, b / 2, mod) + a) % mod : (2 * binmult(a, b / 2, mod)) % mod) : 0; }
/////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
const ll R=1e4;
const ll tx[4]={1,0,-1,0};
const ll ty[4]={0,1,0,-1};
const char rev_to[4]={'E','W','N','S'};
const char o[4]={'S','P','R'};
const int N=2e5+3;
const int M=1e9+7;
//typedef tree<pii,null_type,less<pii>,rb_tree_tag,tree_order_statistics_node_update> st;
vector<int>tree(4*N,1e9+5);
int n,q;
void upd(int indx,int val,int v,int tl,int tr){
if(tl==tr && tl==indx){
tree[v]=val;return;
}
if(tl>indx || tr<indx) return;
int tm=(tl+tr)>>1;
upd(indx,val,2*v,tl,tm);
upd(indx,val,2*v+1,tm+1,tr);
tree[v]=min(tree[2*v],tree[2*v+1]);
}
int get(int l,int r,int v,int tl,int tr){
if(l<=tl && tr<=r) return tree[v];
if(tl>r || tr<l) return 1e9+5;
int tm=(tl+tr)>>1;
return min(get(l,r,2*v,tl,tm),get(l,r,2*v+1,tm+1,tr));
}
int pos(int l,int val,int v,int tl,int tr){
if(tl==tr){
if(tree[v]<=val) return tl;
else return -2;
}
if(tr<l) return -2;
if(tree[v]>val) return -2;
int tm=(tl+tr)>>1;
int f=(tm>=l ? pos(l,val,2*v,tl,tm) : -2);
if(f!=-2){
return f;
}
else{
return pos(l,val,2*v+1,tm+1,tr);
}
}
signed main()
{
fast_io;
cin>>n>>q;
char tp;
int ps,val;
while(q--){
cin>>tp>>val>>ps;
if(tp=='M'){
upd(ps-1,val,1,0,n-1);
}
else{
cout<<pos(ps-1,val,1,0,n-1)+1<<endl;
}
}
return 0;
}
/*
2 0 2 0 1
*/
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
3456 KB |
Output is correct |
| 2 |
Correct |
2 ms |
3456 KB |
Output is correct |
| 3 |
Correct |
4 ms |
3456 KB |
Output is correct |
| 4 |
Correct |
95 ms |
4600 KB |
Output is correct |
| 5 |
Correct |
110 ms |
4216 KB |
Output is correct |
| 6 |
Correct |
113 ms |
4344 KB |
Output is correct |
| 7 |
Correct |
120 ms |
4600 KB |
Output is correct |
