제출 #297705

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
297705		cfalas	말 (IOI15_horses)	C++14	0 / 100	1555 ms	111132 KiB

horses

#pragma GCC target("avx")
#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
#include "horses.h"
using namespace std;

#define FORi(i,a,b) for(int i=a;i<b;i++)
#define MOD 1000000007
#define FOR(i,n) FORi(i,0,n)

#define ll long long
#define MID ((l+r)/2)
#define len(x) ((int)((x).size()))

template<typename T>
struct seg_tree{
	struct node{
		T val;
		node* left=NULL;
		node* right=NULL;
		node() {val=0, left=NULL, right=NULL;}
		node(T v) {val=v, right=NULL, left=NULL;}
	};
	static inline node *root=NULL;
	static inline int N;
	const int RAND_VALUE=1;
	seg_tree(int n){N=n, root = new node();}
	seg_tree(){root = new node();}

	inline void merge(node *par){
		par->val = max(par->left->val , par->right->val);
	}

	inline void update_node(node* ind, int val){
		ind->val = val;
	}

	void build(vector<T>& arr, int l=0, int r=N-1, node *ind=root){
		if(l==r) ind->val = arr[l];
		else{
			if(ind->left==NULL) ind->left = new node();
			if(ind->right==NULL) ind->right = new node();
			build(arr,l,MID,ind->left);
			build(arr,MID+1,r,ind->right);

			merge(ind);
		}
	}

	void update(int rl, int rr, int val, int l=0, int r=N-1, node* ind=root){
		if(rl<=l && r<=rr) update_node(ind, val);
		else if(rr<l || r<rl) return;
		else{
			if(ind->left==NULL) ind->left = new node();
			if(ind->right==NULL) ind->right = new node();
			update(rl,rr,val,l,MID,ind->left);
			update(rl,rr,val,MID+1,r,ind->right);
			merge(ind);
		}
	}

	T query(int rl, int rr, int l=0, int r=N-1, node* ind=root){
		if(rl<=l && r<=rr) return ind->val;
		else if(rl>r || l>rr) return RAND_VALUE;
		else{
			if(ind->left==NULL) ind->left = new node();
			if(ind->right==NULL) ind->right = new node();

			T ret=0;
			ret = max(ret, query(rl,rr,l,MID,ind->left));
			ret = max(ret, query(rl,rr,MID+1,r,ind->right));
			return ret;
		}
	}
};

template<typename T>
struct mult_seg_tree{
	struct node{
		T val;
		node* left=NULL;
		node* right=NULL;
		node() {val=0, left=NULL, right=NULL;}
		node(T v) {val=v, right=NULL, left=NULL;}
	};
	static inline node *root=NULL;
	static inline int N;
	const int RAND_VALUE=1;
	mult_seg_tree(int n){N=n, root = new node();}
	mult_seg_tree(){root = new node();}

	inline void merge(node *par){
		par->val = par->left->val * par->right->val;
	}

	inline void update_node(node* ind, int val){
		ind->val = val;
	}

	void build(vector<int>& arr, int l=0, int r=N-1, node *ind=root){
		if(l==r) ind->val = arr[l];
		else{
			if(ind->left==NULL) ind->left = new node();
			if(ind->right==NULL) ind->right = new node();
			build(arr,l,MID,ind->left);
			build(arr,MID+1,r,ind->right);

			merge(ind);
		}
	}

	void update(int rl, int rr, int val, int l=0, int r=N-1, node* ind=root){
		if(rl<=l && r<=rr) update_node(ind, val);
		else if(rr<l || r<rl) return;
		else{
			if(ind->left==NULL) ind->left = new node();
			if(ind->right==NULL) ind->right = new node();
			update(rl,rr,val,l,MID,ind->left);
			update(rl,rr,val,MID+1,r,ind->right);
			merge(ind);
		}
	}

	T query(int rl, int rr, int l=0, int r=N-1, node* ind=root){
		if(rl<=l && r<=rr) return ind->val;
		else if(rl>r || l>rr) return RAND_VALUE;
		else{
			if(ind->left==NULL) ind->left = new node();
			if(ind->right==NULL) ind->right = new node();

			T ret=0;
			ret = max(ret, query(rl,rr,l,MID,ind->left));
			ret = max(ret, query(rl,rr,MID+1,r,ind->right));
			return ret;
		}
	}
};

template<typename T>
struct mult_mod_seg_tree{
	struct node{
		T val;
		T laz;
		int left=-1;
		int right=-1;
		node() {val=0, laz=0, left=-1, right=-1;}
		node(T v) {val=v, laz=0, right=-1, left=-1;}
	};
	vector<node> seg;
	static inline int N;
	const int RAND_VALUE=1;
	mult_mod_seg_tree(int n){N=n, seg.assign(1, node());}
	mult_mod_seg_tree(){seg.assign(1, node());}

	inline node merge(node par, node a, node b){
		node ret;
		ret.left = par.left, ret.right = par.right;
		ret.val = (((ll)a.val * ((ll)b.val))) % MOD;
		return ret;
	}

	inline void update_node(int ind, int val, int l, int r){
		seg[ind].val = val;
	}

	inline void down(node &par, int l, int r){
		/*
		seg[par.left].val += par.laz * (MID-l+1);
		seg[par.right].val += par.laz * (r-MID);

		seg[par.left].laz = par.laz;
		seg[par.right].laz = par.laz;

		par.laz = 0;
		*/
	}

	inline void create_children(int ind){
		node par = seg[ind];
		if(par.left==-1){
			//cout<<"left\n";
			par.left=seg.size(), seg.push_back(node());
		}
		if(par.right==-1) par.right=seg.size(), seg.push_back(node());
		seg[ind] = par;
	}

	void build(vector<T>& arr, int l=0, int r=N-1, int ind=0){
		if(l==r) seg[ind] = node(arr[l]);
		else{
			create_children(ind);
			build(arr,l,MID,seg[ind].left);
			build(arr,MID+1,r,seg[ind].right);

			seg[ind] = merge(seg[ind], seg[seg[ind].left], seg[seg[ind].right]);
		}
	}

	void update(int pos, int val, int l=0, int r=N-1, int ind=0){
		if(l==r && r==pos) update_node(ind, val,l,r);
		else if(pos<l || pos>r || l==r) return;
		else{
			create_children(ind);
			down(seg[ind],l,r);
			update(pos,val,l,MID,seg[ind].left);
			update(pos,val,MID+1,r,seg[ind].right);
			seg[ind] = merge(seg[ind], seg[seg[ind].left], seg[seg[ind].right]);
		}
	}

	node _query(int rl, int rr, int l=0, int r=N-1, int ind=0){
		if(rl<=l && r<=rr) return seg[ind];
		else if(rl>r || l>rr) return RAND_VALUE;
		else{
			create_children(ind);
			down(seg[ind],l,r);
			return merge(seg[ind], _query(rl, rr, l, MID, seg[ind].left), _query(rl,rr,MID+1,r,seg[ind].right));
		}
	}

	T query(int l, int r){
		return _query(l,r).val%MOD;
	}

};

typedef vector<int> vi;
vi x;
vector<int> y;
vector<double> a;
set<int> xx;

clock_t start_timer;
void time_start(){
	start_timer = clock();
}
void time_end(){
	auto endt = clock();
	//cout<<(double)(endt-start_timer) / CLOCKS_PER_SEC<<endl;
}

seg_tree<int> yseg;
mult_seg_tree<double> xsegd;
mult_mod_seg_tree<int> xsegm;
#define FOA(v,qq) for(auto v : qq)
int get_ans(){
	auto it = xx.end();
	it--;
	it--;
	int cnt=0;
	double maxa=0;
	int maxapos=-1, next=-1;

	// O(30)
	auto itt = xx.end();
	ll pp=1;
	auto st = it;
	auto vv = yseg.query(0,yseg.N-1);
	while(itt!=xx.begin() && pp<vv) itt--, pp*=x[*itt], st=itt;

	int f = *itt;
	// O(30logN)
	while(1){
		auto it2 = it;
		it2++;
		// O(logN)
		double c = xsegd.query(f, *it);
		assert(c>0);

		// O(logN)
		c*=(double)yseg.query(*it, *it2-1);
		//cout<<c<<endl;
		if(c>maxa){
			maxa = c;
			maxapos = *it;
			next = *it2;
		}
		cnt++;
		if(it==st) break;
		it--;
	}
	// O(logN)
	int c = xsegm.query(0, maxapos);
	c= ((ll) c * (ll) yseg.query(maxapos, next-1) ) %MOD;
	return c;
}


int init(int N, int X[], int Y[]) {
	time_start();
	x.resize(N+1);
	y.resize(N);
	FOR(i,N) x[i] = X[i], y[i] = Y[i];
	x[N] = 1;

	yseg.N = N;
	yseg.build(y);

	xsegd.N = N;
	xsegd.build(x);

	xsegm.N = N;
	xsegm.build(x);

	FOR(i,N){
		if(x[i]>1) xx.insert(i);
	}
	xx.insert(N);
	xx.insert(0);
	time_end();
	time_start();
	get_ans();
	time_end();
	return get_ans();
}

int cc=0;
int updateX(int pos, int val) {	
	cc++;
	if(x[pos]==val) return get_ans();
	if(val==1 && x[pos]!=1) xx.erase(pos);
	else if(x[pos]==1 && val!=1) xx.insert(pos);
	x[pos] = val;
	xsegd.update(pos, pos, x[pos]);
	xsegm.update(pos, x[pos]);
	int anss = get_ans();
	return anss;
}

int updateY(int pos, int val) {
	cc++;
	yseg.update(pos, pos, val);
	y[pos] = val;
	int anss = get_ans();
	return anss;
}

컴파일 시 표준 에러 (stderr) 메시지

horses.cpp:24:9: warning: inline variables are only available with '-std=c++17' or '-std=gnu++17'
   24 |  static inline node *root=NULL;
      |         ^~~~~~
horses.cpp:25:9: warning: inline variables are only available with '-std=c++17' or '-std=gnu++17'
   25 |  static inline int N;
      |         ^~~~~~
horses.cpp:86:9: warning: inline variables are only available with '-std=c++17' or '-std=gnu++17'
   86 |  static inline node *root=NULL;
      |         ^~~~~~
horses.cpp:87:9: warning: inline variables are only available with '-std=c++17' or '-std=gnu++17'
   87 |  static inline int N;
      |         ^~~~~~
horses.cpp:150:9: warning: inline variables are only available with '-std=c++17' or '-std=gnu++17'
  150 |  static inline int N;
      |         ^~~~~~
horses.cpp: In function 'void time_end()':
horses.cpp:238:7: warning: unused variable 'endt' [-Wunused-variable]
  238 |  auto endt = clock();
      |       ^~~~
horses.cpp: In function 'int get_ans()':
horses.cpp:284:50: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
  284 |  c= ((ll) c * (ll) yseg.query(maxapos, next-1) ) %MOD;
      |                                                  ^
horses.cpp: In instantiation of 'void mult_mod_seg_tree<T>::create_children(int) [with T = int]':
horses.cpp:191:4:   required from 'void mult_mod_seg_tree<T>::build(std::vector<_Tp>&, int, int, int) [with T = int]'
horses.cpp:303:15:   required from here
horses.cpp:182:12: warning: conversion from 'std::vector<mult_mod_seg_tree<int>::node, std::allocator<mult_mod_seg_tree<int>::node> >::size_type' {aka 'long unsigned int'} to 'int' may change value [-Wconversion]
  182 |    par.left=seg.size(), seg.push_back(node());
horses.cpp:184:30: warning: conversion from 'std::vector<mult_mod_seg_tree<int>::node, std::allocator<mult_mod_seg_tree<int>::node> >::size_type' {aka 'long unsigned int'} to 'int' may change value [-Wconversion]
  184 |   if(par.right==-1) par.right=seg.size(), seg.push_back(node());
horses.cpp: In instantiation of 'mult_mod_seg_tree<T>::node mult_mod_seg_tree<T>::merge(mult_mod_seg_tree<T>::node, mult_mod_seg_tree<T>::node, mult_mod_seg_tree<T>::node) [with T = int]':
horses.cpp:195:15:   required from 'void mult_mod_seg_tree<T>::build(std::vector<_Tp>&, int, int, int) [with T = int]'
horses.cpp:303:15:   required from here
horses.cpp:158:41: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
  158 |   ret.val = (((ll)a.val * ((ll)b.val))) % MOD;
      |                                         ^
horses.cpp: In instantiation of 'void mult_mod_seg_tree<T>::update_node(int, int, int, int) [with T = int]':
horses.cpp:200:22:   required from 'void mult_mod_seg_tree<T>::update(int, int, int, int, int) [with T = int]'
horses.cpp:325:26:   required from here
horses.cpp:162:48: warning: unused parameter 'l' [-Wunused-parameter]
  162 |  inline void update_node(int ind, int val, int l, int r){
      |                                            ~~~~^
horses.cpp:162:55: warning: unused parameter 'r' [-Wunused-parameter]
  162 |  inline void update_node(int ind, int val, int l, int r){
      |                                                   ~~~~^
horses.cpp: In instantiation of 'void mult_mod_seg_tree<T>::down(mult_mod_seg_tree<T>::node&, int, int) [with T = int]':
horses.cpp:204:4:   required from 'void mult_mod_seg_tree<T>::update(int, int, int, int, int) [with T = int]'
horses.cpp:325:26:   required from here
horses.cpp:166:25: warning: unused parameter 'par' [-Wunused-parameter]
  166 |  inline void down(node &par, int l, int r){
      |                   ~~~~~~^~~
horses.cpp:166:34: warning: unused parameter 'l' [-Wunused-parameter]
  166 |  inline void down(node &par, int l, int r){
      |                              ~~~~^
horses.cpp:166:41: warning: unused parameter 'r' [-Wunused-parameter]
  166 |  inline void down(node &par, int l, int r){
      |                                     ~~~~^

• Subtask 1: 0 / 17
• Subtask 2: 0 / 17
• Subtask 3: 0 / 20
• Subtask 4: 0 / 23
• Subtask 5: 0 / 23