oj.uz

Submission #121527

# Submission time Handle Problem Language Result Execution time Memory
121527 2019-06-26T17:08:04 Z nishkarsh Horses (IOI15_horses) C++14
37 / 100
 1080 ms 53336 KB 
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pcc pair<char,char>
#define vi vector <int>
#define vl vector <ll>
#define sd(x) scanf("%d",&x)
#define slld(x) scanf("%lld",&x)
#define pd(x) printf("%d",x)
#define plld(x) printf("%lld",x)
#define pds(x) printf("%d ",x)
#define pllds(x) printf("%lld ",x)
#define pdn(x) printf("%d\n",x)
#define plldn(x) printf("%lld\n",x)
#define INF 2e9
#define INFLL 4e18
using namespace std;
ll powmod(ll base,ll exponent,ll mod){ // with mod < 1e9
	ll ans=1;
	while(exponent){
		if(exponent&1)ans=(ans*base)%mod;
		base=(base*base)%mod;
		exponent/=2;
	}
	return ans;
}
ll gcd(ll a, ll b){
	if(b==0) return a;
	else return gcd(b,a%b);
}
const int upperlimit = 5e5+1;
const int mod = 1e9+7;
struct data
{
	int last_ind=-1,maxy;
	ll mult;
};
data merge(data a,data b){
	data ans;
	ans.mult=a.mult;ans.mult*=b.mult;
	ans.mult%=mod;
	if(b.last_ind==-1) ans.last_ind=a.last_ind;
	else ans.last_ind=b.last_ind;
	ans.maxy=max(a.maxy,b.maxy);
	return ans;
}
data segtree[4*upperlimit];
int n;
ll ans;vi indices;
vi x;vi y;
void build(int node,int i,int j){
	if(i==j){
		segtree[node].mult=x[i];segtree[node].last_ind=i;segtree[node].maxy=y[i];
		if(x[i]==1) segtree[node].last_ind=-1;
		return;
	}
	int mid=(i+j)>>1;
	build(2*node,i,mid);build(2*node+1,mid+1,j);
	segtree[node]=merge(segtree[2*node],segtree[2*node+1]);
}
void update(int node,int i,int j,int ind,int val){
	if(i==j){
		segtree[node].mult=x[i];segtree[node].last_ind=i;segtree[node].maxy=y[i];
		if(x[i]==1) segtree[node].last_ind=-1;
		return;
	}
	int mid=(i+j)>>1;
	if(ind<=mid) update(2*node,i,mid,ind,val);
	else update(2*node+1,mid+1,j,ind,val);
	segtree[node]=merge(segtree[2*node],segtree[2*node+1]);
}
data query(int node,int i,int j,int l,int r){
	if((i>r)||(l>j)||(l>r)||(i>j)){
		data unity;unity.mult=1;unity.maxy=0;unity.last_ind=-1;
		return unity;
	}
	if((i>=l)&&(j<=r)) return segtree[node];
	int mid=(i+j)>>1;
	return merge(query(2*node,i,mid,l,r),query(2*node+1,mid+1,j,l,r));
}
int updateX(int pos,int val){
	x[pos]=val;
	update(1,0,n-1,pos,val);
	int temp=n;
	int ind=n-1;ll calc=y[n-1];
	for(int i = 1; i <= 32; i++){
		indices.pb(query(1,0,n-1,0,temp-1).last_ind);
		temp=indices[indices.size()-1];
		if(temp==-1) break;
		int temp2=query(1,0,n-1,temp,n-1).maxy;
		if(temp2>calc){
			calc=temp2;
			ind=temp;
		}
		calc*=x[temp];
		if(calc>1000000000) break;
	}
	indices.clear();
	ans=query(1,0,n-1,0,ind).mult;ans*=query(1,0,n-1,ind,n-1).maxy;
	ans%=mod;
	return ans;
}
int updateY(int pos,int val){
	y[pos]=val;
	update(1,0,n-1,pos,val);
	int temp=n;
	int ind=n-1;ll calc=y[n-1];
	for(int i = 1; i <= 32; i++){
		indices.pb(query(1,0,n-1,0,temp-1).last_ind);
		temp=indices[indices.size()-1];
		if(temp==-1) break;
		int temp2=query(1,0,n-1,temp,n-1).maxy;
		if(temp2>calc){
			calc=temp2;
			ind=temp;
		}
		calc*=x[temp];
		if(calc>1000000000) break;
	}
	indices.clear();
	ans=query(1,0,n-1,0,ind).mult;ans*=query(1,0,n-1,ind,n-1).maxy;
	ans%=mod;
	return ans;
}
int init(int N,int X[],int Y[]){
	n=N;
	for(int i = 0; i < n; i++){
		x.pb(X[i]);y.pb(Y[i]);
	}
	ll temp=Y[n-1];
	int ind=n-1;
	for(int i = n-1; i > 0; i--){
		if(temp>1000000000) break;
		temp*=X[i];
		if(Y[i-1] > temp){
			ind=i-1;temp=Y[i-1];
		}
	}
	ans=Y[ind];
	for(int i = 0; i <= ind; i++){
		ans*=X[i];ans%=mod;
	}
	build(1,0,n-1);
	return ans;
}

Compilation message

horses.cpp: In function 'int updateX(int, int)':
horses.cpp:106:9: warning: conversion to 'int' from 'long long int' may alter its value [-Wconversion]
  return ans;
         ^~~
horses.cpp: In function 'int updateY(int, int)':
horses.cpp:128:9: warning: conversion to 'int' from 'long long int' may alter its value [-Wconversion]
  return ans;
         ^~~
horses.cpp: In function 'int init(int, int*, int*)':
horses.cpp:149:9: warning: conversion to 'int' from 'long long int' may alter its value [-Wconversion]
  return ans;
         ^~~

Subtask #1
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 31616 KB Output is correct
2 Correct 26 ms 31616 KB Output is correct
3 Correct 24 ms 31584 KB Output is correct
4 Correct 23 ms 31616 KB Output is correct
5 Correct 25 ms 31616 KB Output is correct
6 Correct 23 ms 31616 KB Output is correct
7 Correct 23 ms 31616 KB Output is correct
8 Correct 23 ms 31616 KB Output is correct
9 Correct 23 ms 31616 KB Output is correct
10 Correct 24 ms 31616 KB Output is correct
11 Correct 24 ms 31616 KB Output is correct
12 Correct 23 ms 31608 KB Output is correct
13 Correct 24 ms 31616 KB Output is correct
14 Correct 23 ms 31616 KB Output is correct
15 Correct 24 ms 31616 KB Output is correct
16 Correct 26 ms 31616 KB Output is correct
17 Correct 24 ms 31616 KB Output is correct
18 Correct 23 ms 31616 KB Output is correct
19 Correct 23 ms 31616 KB Output is correct
20 Correct 24 ms 31616 KB Output is correct

Subtask #2
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 31744 KB Output is correct
2 Correct 24 ms 31688 KB Output is correct
3 Correct 24 ms 31740 KB Output is correct
4 Correct 23 ms 31616 KB Output is correct
5 Correct 23 ms 31616 KB Output is correct
6 Correct 23 ms 31616 KB Output is correct
7 Correct 24 ms 31616 KB Output is correct
8 Correct 24 ms 31616 KB Output is correct
9 Correct 25 ms 31672 KB Output is correct
10 Correct 25 ms 31608 KB Output is correct
11 Correct 23 ms 31616 KB Output is correct
12 Correct 24 ms 31608 KB Output is correct
13 Correct 24 ms 31584 KB Output is correct
14 Correct 23 ms 31616 KB Output is correct
15 Correct 23 ms 31588 KB Output is correct
16 Correct 23 ms 31616 KB Output is correct
17 Correct 24 ms 31616 KB Output is correct
18 Correct 24 ms 31616 KB Output is correct
19 Correct 24 ms 31616 KB Output is correct
20 Correct 24 ms 31616 KB Output is correct
21 Correct 24 ms 31592 KB Output is correct
22 Correct 24 ms 31616 KB Output is correct
23 Correct 24 ms 31616 KB Output is correct
24 Correct 24 ms 31616 KB Output is correct
25 Correct 26 ms 31736 KB Output is correct
26 Correct 24 ms 31608 KB Output is correct
27 Incorrect 29 ms 31616 KB Output isn't correct
28 Halted 0 ms 0 KB -

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1080 ms 44652 KB Output is correct
2 Correct 191 ms 53336 KB Output is correct
3 Correct 294 ms 44504 KB Output is correct
4 Correct 175 ms 48348 KB Output is correct

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 31616 KB Output is correct
2 Correct 23 ms 31616 KB Output is correct
3 Correct 23 ms 31616 KB Output is correct
4 Correct 24 ms 31616 KB Output is correct
5 Correct 24 ms 31588 KB Output is correct
6 Correct 23 ms 31616 KB Output is correct
7 Correct 24 ms 31616 KB Output is correct
8 Correct 25 ms 31608 KB Output is correct
9 Correct 24 ms 31580 KB Output is correct
10 Correct 25 ms 31616 KB Output is correct
11 Correct 25 ms 31616 KB Output is correct
12 Correct 26 ms 31616 KB Output is correct
13 Correct 25 ms 31616 KB Output is correct
14 Correct 26 ms 31616 KB Output is correct
15 Correct 25 ms 31616 KB Output is correct
16 Correct 27 ms 31616 KB Output is correct
17 Correct 25 ms 31616 KB Output is correct
18 Correct 26 ms 31616 KB Output is correct
19 Correct 25 ms 31588 KB Output is correct
20 Correct 25 ms 31616 KB Output is correct
21 Correct 25 ms 31616 KB Output is correct
22 Correct 25 ms 31616 KB Output is correct
23 Correct 24 ms 31628 KB Output is correct
24 Correct 26 ms 31616 KB Output is correct
25 Correct 26 ms 31744 KB Output is correct
26 Correct 25 ms 31616 KB Output is correct
27 Incorrect 31 ms 31616 KB Output isn't correct
28 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 31588 KB Output is correct
2 Correct 25 ms 31616 KB Output is correct
3 Correct 26 ms 31616 KB Output is correct
4 Correct 25 ms 31608 KB Output is correct
5 Correct 25 ms 31616 KB Output is correct
6 Correct 26 ms 31616 KB Output is correct
7 Correct 25 ms 31616 KB Output is correct
8 Correct 25 ms 31616 KB Output is correct
9 Correct 25 ms 31608 KB Output is correct
10 Correct 23 ms 31608 KB Output is correct
11 Correct 23 ms 31612 KB Output is correct
12 Correct 24 ms 31616 KB Output is correct
13 Correct 23 ms 31608 KB Output is correct
14 Correct 23 ms 31608 KB Output is correct
15 Correct 23 ms 31616 KB Output is correct
16 Correct 24 ms 31864 KB Output is correct
17 Correct 25 ms 31616 KB Output is correct
18 Correct 24 ms 31744 KB Output is correct
19 Correct 24 ms 31608 KB Output is correct
20 Correct 23 ms 31616 KB Output is correct
21 Correct 23 ms 31612 KB Output is correct
22 Correct 23 ms 31616 KB Output is correct
23 Correct 24 ms 31744 KB Output is correct
24 Correct 24 ms 31616 KB Output is correct
25 Correct 27 ms 31616 KB Output is correct
26 Correct 25 ms 31676 KB Output is correct
27 Incorrect 28 ms 31616 KB Output isn't correct
28 Halted 0 ms 0 KB -