oj.uz

Submission #71583

# Submission time Handle Problem Language Result Execution time Memory
71583 2018-08-25T07:33:29 Z mr_banana Horses (IOI15_horses) C++17
100 / 100
 867 ms 37272 KB 
#include <bits/stdc++.h>
#include "horses.h"

using namespace std;
const int MN=5e5+100,mod=1e9+7;
int n,x[MN],y[MN],seg[4*MN],mulx=1;
set<int,greater<int> > more;
int powm(int x1,int y1){
    if(y1==0){
        return 1;
    }
    int ans=powm(x1,y1/2);
    ans=(1ll*ans*ans)%mod;
    if(y1&1){
        ans=(1ll*ans*x1)%mod;
    }
    return ans;
}
void build(int v=1,int s=0,int e=n){
    if(e-s<2){
        seg[v]=y[s];
        return ;
    }
    int mid=(s+e)/2;
    build(2*v,s,mid);
    build(2*v+1,mid,e);
    seg[v]=max(seg[2*v],seg[2*v+1]);
}
void st(int p,int val,int v=1,int s=0,int e=n){
    if(e-s<2){
        seg[v]=val;
        return;
    }
    int mid=(s+e)/2;
    if(p<mid){
        st(p,val,2*v,s,mid);
    }
    else{
        st(p,val,2*v+1,mid,e);
    }
    seg[v]=max(seg[2*v],seg[2*v+1]);
}
int get(int l,int r,int v=1,int s=0,int e=n){
    if(l<=s && e<=r){
        return seg[v];
    }
    if(l>=e || s>=r){
        return 0;
    }
    int mid=(s+e)/2;
    return max(get(l,r,2*v,s,mid),get(l,r,2*v+1,mid,e));

}
int ans(){
    long long mul=1,mulm=1,ym=0;
    for(int i:more){
        int yi=get(i,n);
        if(mulm*yi>mul*ym){
            ym=yi;
            mulm=mul;
        }
        mul=mul*x[i];
        if(mul>mod){
            break;
        }
    }
    return (1ll*((1ll*mulx*powm(mulm,mod-2))%mod)*ym)%mod;
}
int init(int N, int X[], int Y[]) {
    n=N;
    for(int i=0;i<n;i++){
        x[i]=X[i];
        mulx=(1ll*mulx*x[i])%mod;
        y[i]=Y[i];
        if(x[i]>1){
            more.insert(i);
        }
    }
    more.insert(0);
    build();
	return ans();
}

int updateX(int pos, int val) {
    if(pos>0 && x[pos]>1 && val<2){
        more.erase(pos);
    }
    if(pos>0 && x[pos]<2 && val>1){
        more.insert(pos);
    }
    mulx=(1ll*mulx*powm(x[pos],mod-2))%mod;
    x[pos]=val;
    mulx=(1ll*mulx*x[pos])%mod;
	return ans();
}

int updateY(int pos, int val) {
	y[pos]=val;
    st(pos,val);
	return ans();
}

Compilation message

horses.cpp: In function 'int powm(int, int)':
horses.cpp:13:22: warning: conversion to 'int' from 'long long int' may alter its value [-Wconversion]
     ans=(1ll*ans*ans)%mod;
         ~~~~~~~~~~~~~^~~~
horses.cpp:15:25: warning: conversion to 'int' from 'long long int' may alter its value [-Wconversion]
         ans=(1ll*ans*x1)%mod;
             ~~~~~~~~~~~~^~~~
horses.cpp: In function 'int ans()':
horses.cpp:67:43: warning: conversion to 'int' from 'long long int' may alter its value [-Wconversion]
     return (1ll*((1ll*mulx*powm(mulm,mod-2))%mod)*ym)%mod;
                                           ^
horses.cpp:67:54: warning: conversion to 'int' from 'long long int' may alter its value [-Wconversion]
     return (1ll*((1ll*mulx*powm(mulm,mod-2))%mod)*ym)%mod;
            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~
horses.cpp: In function 'int init(int, int*, int*)':
horses.cpp:73:29: warning: conversion to 'int' from 'long long int' may alter its value [-Wconversion]
         mulx=(1ll*mulx*x[i])%mod;
              ~~~~~~~~~~~~~~~^~~~
horses.cpp: In function 'int updateX(int, int)':
horses.cpp:91:39: warning: conversion to 'int' from 'long long int' may alter its value [-Wconversion]
     mulx=(1ll*mulx*powm(x[pos],mod-2))%mod;
          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~
horses.cpp:93:27: warning: conversion to 'int' from 'long long int' may alter its value [-Wconversion]
     mulx=(1ll*mulx*x[pos])%mod;
          ~~~~~~~~~~~~~~~~~^~~~

Subtask #1
17.0 / 17.0

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

Subtask #2
17.0 / 17.0

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

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 786 ms 37020 KB Output is correct
2 Correct 402 ms 37128 KB Output is correct
3 Correct 405 ms 37164 KB Output is correct
4 Correct 449 ms 37164 KB Output is correct

Subtask #4
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 37164 KB Output is correct
2 Correct 3 ms 37164 KB Output is correct
3 Correct 3 ms 37164 KB Output is correct
4 Correct 3 ms 37164 KB Output is correct
5 Correct 2 ms 37164 KB Output is correct
6 Correct 3 ms 37164 KB Output is correct
7 Correct 2 ms 37164 KB Output is correct
8 Correct 4 ms 37164 KB Output is correct
9 Correct 3 ms 37164 KB Output is correct
10 Correct 3 ms 37164 KB Output is correct
11 Correct 2 ms 37164 KB Output is correct
12 Correct 2 ms 37164 KB Output is correct
13 Correct 2 ms 37164 KB Output is correct
14 Correct 2 ms 37164 KB Output is correct
15 Correct 2 ms 37164 KB Output is correct
16 Correct 2 ms 37164 KB Output is correct
17 Correct 2 ms 37164 KB Output is correct
18 Correct 4 ms 37164 KB Output is correct
19 Correct 3 ms 37164 KB Output is correct
20 Correct 2 ms 37164 KB Output is correct
21 Correct 3 ms 37164 KB Output is correct
22 Correct 3 ms 37164 KB Output is correct
23 Correct 4 ms 37164 KB Output is correct
24 Correct 4 ms 37164 KB Output is correct
25 Correct 4 ms 37164 KB Output is correct
26 Correct 4 ms 37164 KB Output is correct
27 Correct 7 ms 37164 KB Output is correct
28 Correct 5 ms 37164 KB Output is correct
29 Correct 5 ms 37164 KB Output is correct
30 Correct 6 ms 37164 KB Output is correct
31 Correct 5 ms 37164 KB Output is correct
32 Correct 5 ms 37164 KB Output is correct
33 Correct 55 ms 37164 KB Output is correct
34 Correct 51 ms 37164 KB Output is correct
35 Correct 284 ms 37164 KB Output is correct
36 Correct 268 ms 37164 KB Output is correct
37 Correct 105 ms 37164 KB Output is correct
38 Correct 163 ms 37164 KB Output is correct
39 Correct 46 ms 37164 KB Output is correct
40 Correct 244 ms 37164 KB Output is correct
41 Correct 70 ms 37164 KB Output is correct
42 Correct 91 ms 37164 KB Output is correct
43 Correct 249 ms 37164 KB Output is correct
44 Correct 224 ms 37164 KB Output is correct

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 37164 KB Output is correct
2 Correct 2 ms 37164 KB Output is correct
3 Correct 3 ms 37164 KB Output is correct
4 Correct 4 ms 37164 KB Output is correct
5 Correct 2 ms 37164 KB Output is correct
6 Correct 3 ms 37164 KB Output is correct
7 Correct 2 ms 37164 KB Output is correct
8 Correct 2 ms 37164 KB Output is correct
9 Correct 2 ms 37164 KB Output is correct
10 Correct 2 ms 37164 KB Output is correct
11 Correct 3 ms 37164 KB Output is correct
12 Correct 2 ms 37164 KB Output is correct
13 Correct 2 ms 37164 KB Output is correct
14 Correct 3 ms 37164 KB Output is correct
15 Correct 3 ms 37164 KB Output is correct
16 Correct 2 ms 37164 KB Output is correct
17 Correct 2 ms 37164 KB Output is correct
18 Correct 2 ms 37164 KB Output is correct
19 Correct 2 ms 37164 KB Output is correct
20 Correct 3 ms 37164 KB Output is correct
21 Correct 2 ms 37164 KB Output is correct
22 Correct 3 ms 37164 KB Output is correct
23 Correct 4 ms 37164 KB Output is correct
24 Correct 3 ms 37164 KB Output is correct
25 Correct 4 ms 37164 KB Output is correct
26 Correct 4 ms 37164 KB Output is correct
27 Correct 5 ms 37164 KB Output is correct
28 Correct 5 ms 37164 KB Output is correct
29 Correct 4 ms 37164 KB Output is correct
30 Correct 4 ms 37164 KB Output is correct
31 Correct 6 ms 37164 KB Output is correct
32 Correct 6 ms 37164 KB Output is correct
33 Correct 867 ms 37272 KB Output is correct
34 Correct 399 ms 37272 KB Output is correct
35 Correct 443 ms 37272 KB Output is correct
36 Correct 413 ms 37272 KB Output is correct
37 Correct 58 ms 37272 KB Output is correct
38 Correct 53 ms 37272 KB Output is correct
39 Correct 281 ms 37272 KB Output is correct
40 Correct 256 ms 37272 KB Output is correct
41 Correct 90 ms 37272 KB Output is correct
42 Correct 162 ms 37272 KB Output is correct
43 Correct 53 ms 37272 KB Output is correct
44 Correct 279 ms 37272 KB Output is correct
45 Correct 83 ms 37272 KB Output is correct
46 Correct 106 ms 37272 KB Output is correct
47 Correct 233 ms 37272 KB Output is correct
48 Correct 246 ms 37272 KB Output is correct
49 Correct 224 ms 37272 KB Output is correct
50 Correct 200 ms 37272 KB Output is correct
51 Correct 442 ms 37272 KB Output is correct
52 Correct 365 ms 37272 KB Output is correct
53 Correct 744 ms 37272 KB Output is correct
54 Correct 424 ms 37272 KB Output is correct
55 Correct 173 ms 37272 KB Output is correct
56 Correct 400 ms 37272 KB Output is correct
57 Correct 424 ms 37272 KB Output is correct
58 Correct 799 ms 37272 KB Output is correct
59 Correct 246 ms 37272 KB Output is correct