oj.uz

답안 #68997

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
68997 2018-08-19T12:25:38 Z theknife2001 말 (IOI15_horses) C++17
17 / 100
 119 ms 40848 KB 
#include "horses.h"
//#include "grader.cpp"
#include <bits/stdc++.h>
#define mid (l+r)/2

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

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

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

long long query(int l , int r , int node , int x , int y)
{
    if(x<=l&&r<=y)
        return tree[node];
    if(l>y||r<x)
        return 1;
    return (query(l,mid,node*2,x,y)*query(mid+1,r,node*2+1,x,y))%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)
            break;
    }
    i++;
    int j=i;
    bool q=0;
    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)
        {
            q=1;
            break;
        }
    }
    if(q)
    {
        i=j;
        temp=1;
        ret=0;
        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))%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);
    return solve();
}

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

Compilation message

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

Subtask #1
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 2 ms 356 KB Output is correct
3 Correct 2 ms 560 KB Output is correct
4 Correct 3 ms 560 KB Output is correct
5 Correct 2 ms 560 KB Output is correct
6 Correct 2 ms 560 KB Output is correct
7 Correct 3 ms 560 KB Output is correct
8 Correct 2 ms 560 KB Output is correct
9 Correct 3 ms 592 KB Output is correct
10 Correct 3 ms 596 KB Output is correct
11 Correct 2 ms 596 KB Output is correct
12 Correct 2 ms 596 KB Output is correct
13 Correct 2 ms 596 KB Output is correct
14 Correct 2 ms 596 KB Output is correct
15 Correct 3 ms 596 KB Output is correct
16 Correct 2 ms 708 KB Output is correct
17 Correct 2 ms 724 KB Output is correct
18 Correct 3 ms 724 KB Output is correct
19 Correct 2 ms 724 KB Output is correct
20 Correct 2 ms 724 KB Output is correct

Subtask #2
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 724 KB Output is correct
2 Correct 2 ms 724 KB Output is correct
3 Correct 3 ms 724 KB Output is correct
4 Correct 3 ms 724 KB Output is correct
5 Correct 3 ms 724 KB Output is correct
6 Correct 3 ms 724 KB Output is correct
7 Correct 3 ms 724 KB Output is correct
8 Correct 2 ms 724 KB Output is correct
9 Correct 3 ms 724 KB Output is correct
10 Correct 3 ms 724 KB Output is correct
11 Correct 3 ms 724 KB Output is correct
12 Correct 2 ms 724 KB Output is correct
13 Correct 2 ms 724 KB Output is correct
14 Correct 3 ms 724 KB Output is correct
15 Correct 2 ms 724 KB Output is correct
16 Correct 3 ms 724 KB Output is correct
17 Correct 2 ms 732 KB Output is correct
18 Correct 2 ms 732 KB Output is correct
19 Correct 2 ms 732 KB Output is correct
20 Correct 3 ms 732 KB Output is correct
21 Correct 2 ms 732 KB Output is correct
22 Correct 3 ms 732 KB Output is correct
23 Runtime error 4 ms 1000 KB Execution killed with signal 11 (could be triggered by violating memory limits)
24 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 119 ms 21732 KB Output is correct
2 Runtime error 101 ms 40848 KB Execution killed with signal 11 (could be triggered by violating memory limits)
3 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 40848 KB Output is correct
2 Correct 2 ms 40848 KB Output is correct
3 Correct 3 ms 40848 KB Output is correct
4 Correct 2 ms 40848 KB Output is correct
5 Correct 2 ms 40848 KB Output is correct
6 Correct 2 ms 40848 KB Output is correct
7 Correct 2 ms 40848 KB Output is correct
8 Correct 2 ms 40848 KB Output is correct
9 Correct 2 ms 40848 KB Output is correct
10 Correct 3 ms 40848 KB Output is correct
11 Correct 2 ms 40848 KB Output is correct
12 Correct 2 ms 40848 KB Output is correct
13 Correct 2 ms 40848 KB Output is correct
14 Correct 3 ms 40848 KB Output is correct
15 Correct 2 ms 40848 KB Output is correct
16 Correct 2 ms 40848 KB Output is correct
17 Correct 2 ms 40848 KB Output is correct
18 Correct 3 ms 40848 KB Output is correct
19 Correct 2 ms 40848 KB Output is correct
20 Correct 2 ms 40848 KB Output is correct
21 Correct 3 ms 40848 KB Output is correct
22 Correct 3 ms 40848 KB Output is correct
23 Runtime error 7 ms 40848 KB Execution killed with signal 11 (could be triggered by violating memory limits)
24 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 40848 KB Output is correct
2 Correct 2 ms 40848 KB Output is correct
3 Correct 2 ms 40848 KB Output is correct
4 Correct 2 ms 40848 KB Output is correct
5 Correct 2 ms 40848 KB Output is correct
6 Correct 2 ms 40848 KB Output is correct
7 Correct 3 ms 40848 KB Output is correct
8 Correct 2 ms 40848 KB Output is correct
9 Correct 2 ms 40848 KB Output is correct
10 Correct 3 ms 40848 KB Output is correct
11 Correct 3 ms 40848 KB Output is correct
12 Correct 3 ms 40848 KB Output is correct
13 Correct 2 ms 40848 KB Output is correct
14 Correct 3 ms 40848 KB Output is correct
15 Correct 2 ms 40848 KB Output is correct
16 Correct 3 ms 40848 KB Output is correct
17 Correct 2 ms 40848 KB Output is correct
18 Correct 3 ms 40848 KB Output is correct
19 Correct 2 ms 40848 KB Output is correct
20 Correct 3 ms 40848 KB Output is correct
21 Correct 2 ms 40848 KB Output is correct
22 Correct 2 ms 40848 KB Output is correct
23 Runtime error 4 ms 40848 KB Execution killed with signal 11 (could be triggered by violating memory limits)
24 Halted 0 ms 0 KB -