oj.uz

Submission #133602

# Submission time Handle Problem Language Result Execution time Memory
133602 2019-07-21T06:10:47 Z ckodser Horses (IOI15_horses) C++14
54 / 100
 1500 ms 42236 KB 
#include "horses.h"
#include<bits/stdc++.h>

#define ll long long 
#define pb push_back
#define ld long double
#define mp make_pair
#define F first
#define S second
#define pii pair<ll,ll> 

using namespace :: std;

const ll maxn=5e5+500;
const ll inf=1e9+6;
const ll mod=1e9+7;

ll modizarb(long long a,long long b){return (a*b)%mod;}


ll y[maxn];
void bild(ll l,ll r,ll node){
    
}
void update(ll l,ll r,ll node,ll pos){
    
}
ll findMx(ll l,ll r,ll L,ll R,ll node){
    ll ans=0;
    for(ll i=l;i<r;i++){
	ans=max(ans,y[i]);
    }
    return ans;
}
set<ll> st;
ll x[maxn];
ll rx[maxn];
ll n,Z;

ll poww(ll a,ll b){
    ll ans=1;
    while(b){
	if(b&1){
	    ans=(ans*a)%mod;
	}
	b>>=1;
	a=(a*a)%mod;
    }
    return ans;
}
ll findAns(){
    auto it=st.end();
    ll last=n;
    ll ans=0;
    ll t=Z;
    bool br=0;
    while(it!=st.begin()){
	it--;
	ll v=(*it);
	ll yy=findMx(v,last,0,n,1);
	ans=max(ans,yy);
	if(ans*x[v]>inf){
	    br=1;
	    break;
	}
	ans*=x[v];
	t=modizarb(t,rx[v]);
	last=v;
    }
    if(!br){
	ll v=0;
	ll yy=findMx(v,last,0,n,1);
	ans=max(ans,yy);
    }
    return modizarb(ans,t);
}
int init(int N, int X[], int Y[]){
    n=N;
    Z=1;
    for(ll i=0;i<n;i++){
	x[i]=X[i];
	Z=modizarb(Z,X[i]);
	rx[i]=poww(x[i],mod-2);
	y[i]=Y[i];
	if(x[i]!=1)st.insert(i);
    }
    bild(0,n,1);
    return findAns();
}
int updateX(int pos, int val) {	
    Z=modizarb(Z,rx[pos]);
    if(x[pos]!=1 && val==1){
	st.erase(pos);
    }
    if(x[pos]==1 && val!=1){
	st.insert(pos);
    }
    x[pos]=val;
    Z=modizarb(Z,val);
    rx[pos]=poww(x[pos],mod-2);
    return findAns();
}
int updateY(int pos, int val){
    y[pos]=val;
    update(0,n,1,pos);
    return findAns();
}

Compilation message

horses.cpp: In function 'void bild(long long int, long long int, long long int)':
horses.cpp:22:14: warning: unused parameter 'l' [-Wunused-parameter]
 void bild(ll l,ll r,ll node){
              ^
horses.cpp:22:19: warning: unused parameter 'r' [-Wunused-parameter]
 void bild(ll l,ll r,ll node){
                   ^
horses.cpp:22:24: warning: unused parameter 'node' [-Wunused-parameter]
 void bild(ll l,ll r,ll node){
                        ^~~~
horses.cpp: In function 'void update(long long int, long long int, long long int, long long int)':
horses.cpp:25:16: warning: unused parameter 'l' [-Wunused-parameter]
 void update(ll l,ll r,ll node,ll pos){
                ^
horses.cpp:25:21: warning: unused parameter 'r' [-Wunused-parameter]
 void update(ll l,ll r,ll node,ll pos){
                     ^
horses.cpp:25:26: warning: unused parameter 'node' [-Wunused-parameter]
 void update(ll l,ll r,ll node,ll pos){
                          ^~~~
horses.cpp:25:34: warning: unused parameter 'pos' [-Wunused-parameter]
 void update(ll l,ll r,ll node,ll pos){
                                  ^~~
horses.cpp: In function 'long long int findMx(long long int, long long int, long long int, long long int, long long int)':
horses.cpp:28:24: warning: unused parameter 'L' [-Wunused-parameter]
 ll findMx(ll l,ll r,ll L,ll R,ll node){
                        ^
horses.cpp:28:29: warning: unused parameter 'R' [-Wunused-parameter]
 ll findMx(ll l,ll r,ll L,ll R,ll node){
                             ^
horses.cpp:28:34: warning: unused parameter 'node' [-Wunused-parameter]
 ll findMx(ll l,ll r,ll L,ll R,ll node){
                                  ^~~~
horses.cpp: In function 'int init(int, int*, int*)':
horses.cpp:88:19: warning: conversion to 'int' from 'long long int' may alter its value [-Wconversion]
     return findAns();
            ~~~~~~~^~
horses.cpp: In function 'int updateX(int, int)':
horses.cpp:101:19: warning: conversion to 'int' from 'long long int' may alter its value [-Wconversion]
     return findAns();
            ~~~~~~~^~
horses.cpp: In function 'int updateY(int, int)':
horses.cpp:106:19: warning: conversion to 'int' from 'long long int' may alter its value [-Wconversion]
     return findAns();
            ~~~~~~~^~

Subtask #1
17.0 / 17.0

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

Subtask #2
17.0 / 17.0

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

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 312 ms 41596 KB Output is correct
2 Correct 347 ms 41392 KB Output is correct
3 Correct 315 ms 41592 KB Output is correct
4 Correct 334 ms 41464 KB Output is correct

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 380 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 380 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 2 ms 376 KB Output is correct
23 Correct 4 ms 388 KB Output is correct
24 Correct 3 ms 376 KB Output is correct
25 Correct 3 ms 504 KB Output is correct
26 Correct 3 ms 504 KB Output is correct
27 Correct 3 ms 376 KB Output is correct
28 Correct 3 ms 376 KB Output is correct
29 Correct 4 ms 376 KB Output is correct
30 Correct 3 ms 376 KB Output is correct
31 Correct 3 ms 384 KB Output is correct
32 Correct 3 ms 376 KB Output is correct
33 Correct 128 ms 17628 KB Output is correct
34 Correct 118 ms 17560 KB Output is correct
35 Correct 312 ms 40764 KB Output is correct
36 Correct 310 ms 40820 KB Output is correct
37 Correct 299 ms 17704 KB Output is correct
38 Correct 198 ms 29688 KB Output is correct
39 Execution timed out 1560 ms 17824 KB Time limit exceeded
40 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 372 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 380 KB Output is correct
22 Correct 2 ms 380 KB Output is correct
23 Correct 3 ms 376 KB Output is correct
24 Correct 3 ms 376 KB Output is correct
25 Correct 3 ms 504 KB Output is correct
26 Correct 3 ms 504 KB Output is correct
27 Correct 3 ms 376 KB Output is correct
28 Correct 3 ms 380 KB Output is correct
29 Correct 4 ms 376 KB Output is correct
30 Correct 3 ms 504 KB Output is correct
31 Correct 3 ms 376 KB Output is correct
32 Correct 3 ms 376 KB Output is correct
33 Correct 314 ms 41680 KB Output is correct
34 Correct 345 ms 41724 KB Output is correct
35 Correct 323 ms 42236 KB Output is correct
36 Correct 333 ms 41640 KB Output is correct
37 Correct 128 ms 17272 KB Output is correct
38 Correct 115 ms 17272 KB Output is correct
39 Correct 322 ms 40720 KB Output is correct
40 Correct 317 ms 40568 KB Output is correct
41 Correct 292 ms 17404 KB Output is correct
42 Correct 198 ms 29700 KB Output is correct
43 Execution timed out 1572 ms 17784 KB Time limit exceeded
44 Halted 0 ms 0 KB -