oj.uz

Submission #69038

# Submission time Handle Problem Language Result Execution time Memory
69038 2018-08-19T14:41:51 Z theknife2001 Horses (IOI15_horses) C++17
37 / 100
 262 ms 29828 KB 
#include "horses.h"
#include <bits/stdc++.h>
#define mid (l+r)/2



using namespace std;
const int N=5e5+55;
long long tree[N*4][2];
long long x[N];
long long y[N];
int m=1e9+7;
int cnt=0;

int n;


void build(int l , int r , int node)
{
    if(l==r)
    {
        tree[node][0]=x[l];
        tree[node][1]=y[l];
        return ;
    }
    build(l,mid,node*2);
    build(mid+1,r,node*2+1);
    tree[node][0]=tree[node*2][0]*tree[node*2+1][0];
    tree[node][0]%=m;
    tree[node][1]=tree[node*2][1]*tree[node*2+1][1];
    tree[node][1]%=m;
}

void update(int l , int r , int node , int ind , int val , int q)
{
    if(l==r&&l==ind)
    {
        tree[node][q]=val;
        return ;
    }
    if(ind<=mid)
        update(l,mid,node*2,ind,val,q);
    else
        update(mid+1,r,node*2+1,ind,val,q);
    tree[node][q]=tree[node*2][q]*tree[node*2+1][q];
    tree[node][q]%=m;
}

long long query(int l , int r , int node , int x , int y , int q)
{
    if(x<=l&&r<=y)
        return tree[node][q];
    if(l>y||r<x)
        return 1;
    return (query(l,mid,node*2,x,y,q)*query(mid+1,r,node*2+1,x,y,q))%m;

}

int solve()
{
	int i=n-1;
    long long ret=0;
	long long temp=1;
	long long s=1;
	while(i>=0)
    {
        s*=x[i];
        i--;
        if(s>10000000000)
        {
            i++;
            break;
        }
    }
    i++;
    int bestpos=n-1;
    for(;i<n;i++)
    {
        temp*=x[i];
        if(y[i]*temp>ret)
        {
            ret=y[i]*temp;
            bestpos=i;
        }
        if(ret<0||y[i]*temp<0)
        {
            assert(0);
        }
    }
    return (y[bestpos]*query(0,n-1,1,0,bestpos,0))%m;
}

int init(int N, int X[], int Y[])
{
	n=N;
    for(int i=0;i<N;i++)
    {
        x[i]=X[i];
        y[i]=Y[i];
    }
    build(0,n-1,1);
    return solve();
}

int updateX(int pos, int val) {
    x[pos]=val;
    update(0,n-1,1,pos,val,0);
    return solve();
}

int updateY(int pos, int val)
{
    y[pos]=val;
    update(0,n-1,1,pos,val,1);
    return solve();
}

Compilation message

horses.cpp: In function 'long long int query(int, int, int, int, int, int)':
horses.cpp:49:65: warning: declaration of 'y' shadows a global declaration [-Wshadow]
 long long query(int l , int r , int node , int x , int y , int q)
                                                                 ^
horses.cpp:11:11: note: shadowed declaration is here
 long long y[N];
           ^
horses.cpp:49:65: warning: declaration of 'x' shadows a global declaration [-Wshadow]
 long long query(int l , int r , int node , int x , int y , int q)
                                                                 ^
horses.cpp:10:11: note: shadowed declaration is here
 long long x[N];
           ^
horses.cpp: In function 'int solve()':
horses.cpp:90:51: warning: conversion to 'int' from 'long long int' may alter its value [-Wconversion]
     return (y[bestpos]*query(0,n-1,1,0,bestpos,0))%m;
            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
horses.cpp: In function 'int init(int, int*, int*)':
horses.cpp:93:33: warning: declaration of 'N' shadows a global declaration [-Wshadow]
 int init(int N, int X[], int Y[])
                                 ^
horses.cpp:8:11: note: shadowed declaration is here
 const int N=5e5+55;
           ^

Subtask #1
17.0 / 17.0

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

Subtask #2
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 748 KB Output is correct
2 Correct 3 ms 748 KB Output is correct
3 Correct 4 ms 748 KB Output is correct
4 Correct 2 ms 748 KB Output is correct
5 Correct 2 ms 748 KB Output is correct
6 Correct 2 ms 748 KB Output is correct
7 Correct 2 ms 748 KB Output is correct
8 Correct 2 ms 748 KB Output is correct
9 Correct 3 ms 748 KB Output is correct
10 Correct 2 ms 748 KB Output is correct
11 Correct 3 ms 748 KB Output is correct
12 Correct 2 ms 748 KB Output is correct
13 Correct 2 ms 748 KB Output is correct
14 Correct 3 ms 748 KB Output is correct
15 Correct 2 ms 748 KB Output is correct
16 Correct 3 ms 748 KB Output is correct
17 Correct 2 ms 748 KB Output is correct
18 Correct 3 ms 748 KB Output is correct
19 Correct 2 ms 748 KB Output is correct
20 Correct 3 ms 748 KB Output is correct
21 Correct 2 ms 748 KB Output is correct
22 Correct 2 ms 748 KB Output is correct
23 Incorrect 4 ms 748 KB Output isn't correct
24 Halted 0 ms 0 KB -

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 196 ms 29800 KB Output is correct
2 Correct 232 ms 29828 KB Output is correct
3 Correct 178 ms 29828 KB Output is correct
4 Correct 262 ms 29828 KB Output is correct

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 29828 KB Output is correct
2 Correct 3 ms 29828 KB Output is correct
3 Correct 2 ms 29828 KB Output is correct
4 Correct 3 ms 29828 KB Output is correct
5 Correct 2 ms 29828 KB Output is correct
6 Correct 2 ms 29828 KB Output is correct
7 Correct 3 ms 29828 KB Output is correct
8 Correct 2 ms 29828 KB Output is correct
9 Correct 3 ms 29828 KB Output is correct
10 Correct 3 ms 29828 KB Output is correct
11 Correct 3 ms 29828 KB Output is correct
12 Correct 3 ms 29828 KB Output is correct
13 Correct 3 ms 29828 KB Output is correct
14 Correct 2 ms 29828 KB Output is correct
15 Correct 3 ms 29828 KB Output is correct
16 Correct 3 ms 29828 KB Output is correct
17 Correct 2 ms 29828 KB Output is correct
18 Correct 3 ms 29828 KB Output is correct
19 Correct 3 ms 29828 KB Output is correct
20 Correct 0 ms 29828 KB Output is correct
21 Correct 3 ms 29828 KB Output is correct
22 Correct 2 ms 29828 KB Output is correct
23 Incorrect 4 ms 29828 KB Output isn't correct
24 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 29828 KB Output is correct
2 Correct 2 ms 29828 KB Output is correct
3 Correct 3 ms 29828 KB Output is correct
4 Correct 4 ms 29828 KB Output is correct
5 Correct 3 ms 29828 KB Output is correct
6 Correct 3 ms 29828 KB Output is correct
7 Correct 2 ms 29828 KB Output is correct
8 Correct 3 ms 29828 KB Output is correct
9 Correct 3 ms 29828 KB Output is correct
10 Correct 3 ms 29828 KB Output is correct
11 Correct 3 ms 29828 KB Output is correct
12 Correct 3 ms 29828 KB Output is correct
13 Correct 2 ms 29828 KB Output is correct
14 Correct 2 ms 29828 KB Output is correct
15 Correct 2 ms 29828 KB Output is correct
16 Correct 3 ms 29828 KB Output is correct
17 Correct 3 ms 29828 KB Output is correct
18 Correct 2 ms 29828 KB Output is correct
19 Correct 2 ms 29828 KB Output is correct
20 Correct 3 ms 29828 KB Output is correct
21 Correct 2 ms 29828 KB Output is correct
22 Correct 2 ms 29828 KB Output is correct
23 Incorrect 3 ms 29828 KB Output isn't correct
24 Halted 0 ms 0 KB -