제출 #398440

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
398440		cfalas	말 (IOI15_horses)	C++14	34 / 100	1596 ms	53200 KiB

horses

#include "horses.h"
#include<bits/stdc++.h>
using namespace std;
#define mp make_pair
#define INF 10000000
#define MOD 1000000007ll
#define MID ((l+r)/2)
#define HASHMOD 2305843009213693951
#define ll long long
#define ull unsigned long long
#define F first
#define S second
typedef pair<ll, ll> ii;
typedef pair<ii, int> iii;
typedef vector<ll> vi;
typedef vector<ii> vii;
typedef map<int, int> mii;

#define EPS 1e-6
#define FOR(i,n) for(int i=0;i<((int)(n));i++)
#define FORi(i,a,b) for(int i=((int)(a));i<((int)(b));i++)
#define FOA(v, a) for(auto v : a)

template<typename T>
struct seg_tree{
	struct node{
		T val;
		T val_mod;
		T laz;
		int left=-1;
		int right=-1;
		bool over=false;
		node() {val=1, val_mod=1, laz=0, left=-1, right=-1;}
		node(T v) {val=v, val_mod=v%MOD, laz=0, right=-1, left=-1;}
	};
	vector<node> seg;
	static inline int N;
	const int RAND_VALUE=1;
	seg_tree(int n){N=n, 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 = a.val * b.val;
		ret.val_mod = (a.val_mod * b.val_mod)%MOD;
		if(b.val!=0 && LLONG_MAX/b.val<a.val) ret.over = true;
		if(a.over || b.over) ret.over = true;
		return ret;
	}

	inline void update_node(int ind, int val, int l, int r){
		seg[ind].val = val;
		seg[ind].val_mod = val;
		seg[ind].over = false;
		seg[ind].laz = val;
		assert(r==l);
	}

	inline void down(node &par, int l, int r){
		if(par.laz){
			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) 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 rl, int rr, int val, int l=0, int r=N-1, int ind=0){
		if(rl<=l && r<=rr) update_node(ind, val,l,r);
		else if(rr<l || r<rl) return;
		else{
			create_children(ind);
			down(seg[ind],l,r);
			update(rl,rr,val,l,MID,seg[ind].left);
			update(rl,rr,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){
		node ans = _query(l,r);
		if(ans.over) return MOD;
		else return min(ans.val, MOD);
	}
	T query_mod(int l, int r){
		return _query(l,r).val_mod;
	}
	
};

vi x, y;
int n;
int ppos;
seg_tree<ll> seg(n);
int init(int N, int X[], int Y[]) {
	n = N;
	seg.N = n;
	x.resize(n);
	y.resize(n);
	FOR(i,n) x[i] = X[i], y[i] = Y[i];
	seg.build(x);
	//FOR(i,n) cout<<seg.query(i,i)<<" "; cout<<endl;
	ppos=0;
	FORi(i,1,n){
		if(y[ppos]<y[i]*seg.query(ppos+1, i)) ppos = i;
	}

	ll ans = seg.query_mod(0, ppos);
	ans = (ans*y[ppos])%MOD;
	return ans%MOD;
}

int updateX(int pos, int val) {	
	x[pos] = val;
	seg.update(pos, pos, val);
	//FOR(i,n) cout<<seg.query(i,i)<<" "; cout<<endl;
	ll d = 1;
	ppos=0;
	FORi(i,1,n){
		d*=x[i];
		if(y[ppos]<y[i]*d) ppos = i, d=1;
	}

	ll ans = seg.query_mod(0, ppos);
	ans = (ans*y[ppos])%MOD;
	return ans%MOD;
}

int updateY(int pos, int val) {
	ll pval = y[pos];
	y[pos] = val;
	//cout<<" "<<ppos<<" "<<pval<<" "<<val<<" ";
	//cout<<ppos<<" "<<seg.query(pos+1, ppos)<<" ";
	if(pval<val && pos<ppos && y[pos]>y[ppos]*seg.query(pos+1, ppos)) ppos = pos;
	else if(pval<val && pos>ppos && y[ppos]<y[pos]*seg.query(ppos+1, pos)) ppos = pos;
	else if(pos==ppos && pval>val){
		ppos=0;
		FORi(i,1,n){
			if(y[ppos]<y[i]*seg.query(ppos+1, i)) ppos = i;
		}
	}
	//cout<<ppos<<endl;

	ll ans = seg.query_mod(0, ppos);
	ans = (ans*y[ppos])%MOD;
	return ans%MOD;
}

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

horses.cpp:37:9: warning: inline variables are only available with '-std=c++17' or '-std=gnu++17'
   37 |  static inline int N;
      |         ^~~~~~
horses.cpp: In function 'int init(int, int*, int*)':
horses.cpp:141:12: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
  141 |  return ans%MOD;
      |            ^
horses.cpp: In function 'int updateX(int, int)':
horses.cpp:157:12: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
  157 |  return ans%MOD;
      |            ^
horses.cpp: In function 'int updateY(int, int)':
horses.cpp:177:12: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
  177 |  return ans%MOD;
      |            ^
horses.cpp: In instantiation of 'seg_tree<T>::seg_tree(int) [with T = long long int]':
horses.cpp:125:19:   required from here
horses.cpp:39:45: warning: declaration of 'n' shadows a global declaration [-Wshadow]
   39 |  seg_tree(int n){N=n, seg.assign(1, node());}
      |                                             ^
horses.cpp:123:5: note: shadowed declaration is here
  123 | int n;
      |     ^
horses.cpp:39:45: warning: declaration of 'n' shadows a global declaration [-Wshadow]
   39 |  seg_tree(int n){N=n, seg.assign(1, node());}
      |                                             ^
horses.cpp:123:5: note: shadowed declaration is here
  123 | int n;
      |     ^
horses.cpp: In instantiation of 'void seg_tree<T>::create_children(int) [with T = long long int]':
horses.cpp:81:4:   required from 'void seg_tree<T>::build(std::vector<_Tp>&, int, int, int) [with T = long long int]'
horses.cpp:132:13:   required from here
horses.cpp:73:28: warning: conversion from 'std::vector<seg_tree<long long int>::node, std::allocator<seg_tree<long long int>::node> >::size_type' {aka 'long unsigned int'} to 'int' may change value [-Wconversion]
   73 |   if(par.left==-1) par.left=seg.size(), seg.push_back(node());
horses.cpp:74:30: warning: conversion from 'std::vector<seg_tree<long long int>::node, std::allocator<seg_tree<long long int>::node> >::size_type' {aka 'long unsigned int'} to 'int' may change value [-Wconversion]
   74 |   if(par.right==-1) par.right=seg.size(), seg.push_back(node());

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