Submission #52526

#	Time	Username	Problem	Language	Result	Execution time	Memory
52526		hamzqq9	Deda (COCI17_deda)	C++14	20 / 140	281 ms	17028 KiB

deda

#include<bits/stdc++.h>
#define lf double
#define ll long long
#define ull unsigned ll
#define ii pair<int,int>
#define li pair<ll,int>
#define iii pair<int,ii>
#define iiii pair<ii,ii>
#define iiii2 pair<int,iii>
#define lii pair<ll,ii>
#define lolo pair<ll,ll>
#define heap priority_queue
#define mp make_pair
#define st first
#define nd second
#define pb push_back
#define pf push_front
#define ppb pop_back
#define ppf pop_front
#define all(x) x.begin(),x.end()
#define len(x) strlen(x)
#define sz(x) (int) x.size()
#define orta ((bas+son)/2)
#define min3(x,y,z) min(min(x,y),z)
#define max3(x,y,z) max(max(x,y),z)
#define umin(x,y) x=min(x,y)
#define umax(x,y) x=max(x,y)
#define dbgs(x) cerr<<(#x)<<" --> "<<(x)<<" "
#define dbg(x) cerr<<(#x)<<" --> "<<(x)<<endl;getchar()
#define MOD 1000000007
#define inf 1050000001
#define N 200005
#define LOG 19
#define magic 100
#define KOK 350
#define EPS 0.000000000001
#define pw(x) 1ll*((1ll)<<(x))
#define PI 3.1415926535
using namespace std;

int n,q,x,y,S[N*4];

int get(int node,int bas,int son,int x,int y,int val) {

	if(bas>y || son<x) return inf;

	if(bas>=x && son<=y) {

		if(S[node]>val) return inf;

		if(bas==son) return bas;

		if(S[node*2]<=val) return get(node*2,bas,orta,x,y,val);

		if(S[node*2+1]<=val) return get(node*2+1,orta+1,son,x,y,val);

	}

	int res=get(node*2,bas,orta,x,y,val);

	if(res!=inf) return res;

	return get(node*2+1,orta+1,son,x,y,val);

}

void up(int node,int bas,int son,int x,int val) {

	if(bas>x || son<x) return ;

	if(bas==x && son==x) {

		S[node]=val;

		return ;

	}

	up(node*2,bas,orta,x,val);
	up(node*2+1,orta+1,son,x,val);

	umin(S[node],min(S[node*2],S[node*2+1]));

}

void build(int node,int bas,int son) {

	if(bas==son) {

		S[node]=inf;

		return ;

	}

	build(node*2,bas,orta);
	build(node*2+1,orta+1,son);

}

int main() {

	#if 0
	freopen("input.txt","r",stdin);
 	#endif

	scanf("%d %d",&n,&q);

	build(1,1,n);

	while(q--) {

		char type;

		scanf(" %c %d %d",&type,&x,&y);

		if(type=='M') {

			up(1,1,n,y,x);

		}
		else {

			int res=get(1,1,n,y,n,x);

			if(res==inf) res=-1;

			printf("%d\n",res);

		}

	}

}

Compilation message (stderr)

deda.cpp: In function 'int main()':
deda.cpp:107:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d",&n,&q);
  ~~~~~^~~~~~~~~~~~~~~
deda.cpp:115:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf(" %c %d %d",&type,&x,&y);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 20 / 140