oj.uz

Submission #560198

# Submission time Handle Problem Language Result Execution time Memory
560198 2022-05-11T07:06:17 Z Koosha_mv Horses (IOI15_horses) C++14
77 / 100
 1500 ms 29608 KB 
#include <bits/stdc++.h>
using namespace std;
#define dbgv(v) cout<<#v<<" = "; f(i,0,v.size()) cout<<v[i]<<" "; cout<<endl
#define dbga(a,x,y) cout<<#a<<" = "; f(i,x,y) cout<<a[i]<<" "; cout<<endl
#define erorp(x) cout<<#x<<"={"<<x.F<<" , "<<x.S<<"}"<<endl
#define eror(x) cout<<#x<<'='<<(x)<<endl
#define f_(i,a,b) for(int i=a;i>=b;i--)
#define f(i,a,b) for(int i=a;i<b;i++)
#define nb(x) __builtin_popcount(x)
#define all(v) v.begin(),v.end()
#define bit(n,k) (((n)>>(k))&1)
#define Add(x,y) x=(x+y)%mod
#define maxm(a,b) a=max(a,b)
#define minm(a,b) a=min(a,b)
#define lst(x) x[x.size()-1]
#define sz(x) int(x.size())
#define mp make_pair
#define ll long long
#define pb push_back
#define S second
#define F first
#include "horses.h"
 
const int N=5e5+99,mod=1e9+7;
const ll inf=1e18+mod;
 
int n,t,a[N],b[N],mark[N],L[N],R[N],seg[N<<1];
int pd=1;
priority_queue<int> s;
 
ll pow(ll x,ll y,ll mod){return(!y?1:pow(x*x%mod,y/2,mod)*(y&1?x:1))%mod;}
 
void build(){
	f(i,0,n) seg[i+n]=b[i];
	f_(i,n-1,1) seg[i]=max(seg[i<<1],seg[i<<1|1]);
}
void update(int id,int val){
	seg[id]=val;
	for(id>>=1;id>0;id>>=1){
		seg[id]=max(seg[id<<1],seg[id<<1|1]);
	}
}
int get(int l,int r){
	int ans=0;
	for(l+=n,r+=n;l<r;l>>=1,r>>=1){
		if(l&1) maxm(ans,seg[l++]);
		if(r&1) maxm(ans,seg[--r]);
	}
	return ans;
}
int solve(){
	ll ans=1,res=pd;
	vector<int> vec;
	while(1){
		int i=s.top();
		s.pop();
		mark[i]=0;
		if(i==0 || a[i]>1) vec.pb(i);
		maxm(ans,1ll*a[i]*max(ans,1ll*get(i,n)));
		res=1ll*res*pow(a[i],mod-2,mod)%mod;
		if(s.size()==0 || ans>mod) break;
	}
	for(auto x : vec) mark[x]=1,s.push(x);
	ans%=mod;
	return 1ll*res*ans%mod;
}
int init(int _n, int X[], int Y[]) {
	n=_n;
	f(i,0,n) a[i]=X[i];
	f(i,0,n) b[i]=Y[i];
	f(i,0,n){
		pd=1ll*pd*a[i]%mod;
		if(i==0 || a[i]>1) mark[i]=1,s.push(i);
	}
	build();
	return solve();
}
int updateX(int pos, int val) {
	if(a[pos]==1 && val!=1 && mark[pos]==0) mark[pos]=1,s.push(pos);
	pd=1ll*pd*pow(a[pos],mod-2,mod)%mod;
	a[pos]=val;
	pd=1ll*pd*a[pos]%mod;
	return solve();
}
int updateY(int pos, int val) {
	b[pos]=val;
	update(pos+n,val);
	return solve();
}
/*
int32_t main(){
	ios:: sync_with_stdio(0), cin.tie(0), cout.tie(0);
	int n,q,a[10],b[10];
	cin>>n;
	f(i,0,n) cin>>a[i];
	f(i,0,n) cin>>b[i];
	cout<<init(n,a,b)<<endl;
	cin>>q;
	while(q--){
		int t,pos,val;
		cin>>t>>pos>>val;
		if(t==1) cout<<updateX(pos,val)<<endl;
		else cout<<updateY(pos,val)<<endl;
	}
}
 */
/*
3
2 1 3
3 4 1
1
2 1 2
*/

Compilation message

horses.cpp: In function 'long long int pow(long long int, long long int, long long int)':
horses.cpp:31:21: warning: declaration of 'mod' shadows a global declaration [-Wshadow]
   31 | ll pow(ll x,ll y,ll mod){return(!y?1:pow(x*x%mod,y/2,mod)*(y&1?x:1))%mod;}
      |                     ^
horses.cpp:24:20: note: shadowed declaration is here
   24 | const int N=5e5+99,mod=1e9+7;
      |                    ^~~
horses.cpp: In function 'int solve()':
horses.cpp:65:20: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
   65 |  return 1ll*res*ans%mod;
      |         ~~~~~~~~~~~^~~~
horses.cpp: In function 'int init(int, int*, int*)':
horses.cpp:72:17: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
   72 |   pd=1ll*pd*a[i]%mod;
      |      ~~~~~~~~~~~^~~~
horses.cpp: In function 'int updateX(int, int)':
horses.cpp:80:33: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
   80 |  pd=1ll*pd*pow(a[pos],mod-2,mod)%mod;
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~
horses.cpp:82:18: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
   82 |  pd=1ll*pd*a[pos]%mod;
      |     ~~~~~~~~~~~~~^~~~

Subtask #1
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 2 ms 312 KB Output is correct
25 Correct 4 ms 372 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 14 ms 360 KB Output is correct
28 Correct 5 ms 340 KB Output is correct
29 Correct 2 ms 340 KB Output is correct
30 Correct 2 ms 340 KB Output is correct
31 Correct 10 ms 340 KB Output is correct
32 Correct 15 ms 340 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1397 ms 17180 KB Output is correct
2 Correct 164 ms 17084 KB Output is correct
3 Correct 312 ms 17036 KB Output is correct
4 Correct 171 ms 17024 KB Output is correct

Subtask #4
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 252 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 2 ms 340 KB Output is correct
25 Correct 5 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 13 ms 340 KB Output is correct
28 Correct 5 ms 340 KB Output is correct
29 Correct 3 ms 340 KB Output is correct
30 Correct 2 ms 340 KB Output is correct
31 Correct 10 ms 340 KB Output is correct
32 Correct 15 ms 368 KB Output is correct
33 Correct 38 ms 14048 KB Output is correct
34 Correct 34 ms 14140 KB Output is correct
35 Correct 105 ms 16212 KB Output is correct
36 Correct 78 ms 16240 KB Output is correct
37 Correct 177 ms 13184 KB Output is correct
38 Correct 64 ms 15316 KB Output is correct
39 Correct 35 ms 12188 KB Output is correct
40 Correct 66 ms 16184 KB Output is correct
41 Correct 125 ms 12324 KB Output is correct
42 Correct 155 ms 12148 KB Output is correct
43 Correct 51 ms 16188 KB Output is correct
44 Correct 51 ms 16180 KB Output is correct

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 244 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 2 ms 340 KB Output is correct
25 Correct 4 ms 340 KB Output is correct
26 Correct 2 ms 340 KB Output is correct
27 Correct 14 ms 360 KB Output is correct
28 Correct 5 ms 340 KB Output is correct
29 Correct 3 ms 340 KB Output is correct
30 Correct 3 ms 340 KB Output is correct
31 Correct 9 ms 340 KB Output is correct
32 Correct 14 ms 340 KB Output is correct
33 Correct 1456 ms 17176 KB Output is correct
34 Correct 178 ms 29608 KB Output is correct
35 Correct 326 ms 20944 KB Output is correct
36 Correct 168 ms 24616 KB Output is correct
37 Correct 55 ms 17972 KB Output is correct
38 Correct 41 ms 17924 KB Output is correct
39 Correct 108 ms 26932 KB Output is correct
40 Correct 85 ms 26940 KB Output is correct
41 Correct 178 ms 15260 KB Output is correct
42 Correct 65 ms 18112 KB Output is correct
43 Correct 37 ms 14084 KB Output is correct
44 Correct 76 ms 22000 KB Output is correct
45 Correct 119 ms 14176 KB Output is correct
46 Correct 148 ms 14204 KB Output is correct
47 Correct 59 ms 22380 KB Output is correct
48 Correct 60 ms 22376 KB Output is correct
49 Correct 174 ms 20364 KB Output is correct
50 Correct 123 ms 20168 KB Output is correct
51 Correct 448 ms 28904 KB Output is correct
52 Correct 156 ms 28316 KB Output is correct
53 Execution timed out 1554 ms 17556 KB Time limit exceeded
54 Halted 0 ms 0 KB -