oj.uz

답안 #620842

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
620842 2022-08-03T09:38:54 Z amin 말 (IOI15_horses) C++14
17 / 100
 168 ms 41636 KB 
#include "horses.h"
#include<bits/stdc++.h>
using namespace std;

long long x[500001];
long long seg[1000002],segg[1000002],mu[1000002];
long long y[500001];
long long h=(1e9+1);
long long mod=1e9+7;
void build(long v,long tl,long tr)
{
    if(tl==tr)
    {
        seg[v]=x[tl];
        mu[v]=seg[v];
        return ;
    }
    long tm=(tl+tr)/2;
    build(v*2,tl,tm);
    build(v*2+1,tm+1,tr);
    seg[v]=seg[v*2]*seg[v*2+1];
    mu[v]=(mu[v*2]*mu[v*2+1])%mod;

    if(seg[v]>h)
    {
        seg[v]=h;
    }
}
void update(long v,long tl,long tr,long in)
{
    if(tl==tr&&tl==in)
    {
        seg[v]=x[in];
        mu[v]=seg[v];
        return ;
    }
    long tm=(tl+tr)/2;
    if(tm>=in)
    {
        update(v*2,tl,tm,in);
    }else
    {
        update(v*2+1,tm+1,tr,in);
    }
    seg[v]=seg[v*2]*seg[v*2+1];
    mu[v]=(mu[v*2]*mu[v*2+1])%mod;
    if(seg[v]>h)
    {
        seg[v]=h;
    }
}
long long get(long v,long tl,long tr,long l,long r)
{
    if(l==tl&&r==tr)
    {
        return seg[v];
    }
    long tm=(tl+tr)/2;
    if(r<=tm)
    {
        return get(v*2,tl,tm,l,r);
    }
    if(l>tm)
    {
        return get(v*2+1,tm+1,tr,l,r);
    }
    long long j=get(v*2,tl,tm,l,tm)*get(v*2+1,tm+1,tr,tm+1,r);
    if(j>h)
    {
        j=h;
    }
    return j;
}
long n;
long w;
void build2(long v,long tl,long tr)
{
    if(tl==tr)
    {
        segg[v]=tl;
        return ;
    }
    long tm=(tl+tr)/2;
    build2(v*2,tl,tm);
    build2(v*2+1,tm+1,tr);
    long long a=segg[v*2];
    long long b=segg[v*2+1];
   // cout<<a<<' '<<b<<' ';
   // cout<<y[a]<<' '<<y[b]*get(1,0,n-1,a+1,b)<<endl;
    if(y[a]>(y[b]*get(1,0,n-1,a+1,b)))
    {
      segg[v]=a;

    }else
    {
        segg[v]=b;
    }
}
void update2(long v,long tl,long tr,long in)
{
    if(tl==tr)
    {
        segg[v]=tl;
        return ;
    }
    long tm=(tl+tr)/2;
    if(tm>=in)
    {
        update2(v*2,tl,tm,in);
    }else
    {
        update2(v*2+1,tm+1,tr,in);
    }
      long long a=segg[v*2];
    long long b=segg[v*2+1];
   // cout<<a<<' '<<b<<' ';
   // cout<<y[a]<<' '<<y[b]*get(1,0,n-1,a+1,b)<<endl;
    if(y[a]>(y[b]*get(1,0,n-1,a+1,b)))
    {
      segg[v]=a;

    }else
    {
        segg[v]=b;
    }

}
long long get2(long v,long tl,long tr,long l,long r)
{

    if(l==tl&&r==tr)
    {
        return mu[v];
    }
    long tm=(tl+tr)/2;
    if(r<=tm)
    {
        return get2(v*2,tl,tm,l,r);
    }
    if(l>tm)
    {
        return get2(v*2+1,tm+1,tr,l,r);
    }
    long long j=(get2(v*2,tl,tm,l,tm)*get2(v*2+1,tm+1,tr,tm+1,r))%mod;

    return j;
}
int init(int N, int X[], int Y[]) {
   
  //  cout<<mod<<endl;
    n=N;
     w=max(w,n-40);
    for(long i=0;i<n;i++)
    {
        x[i]=X[i];
        y[i]=Y[i];
    }
    build(1,0,n-1);
build2(1,w,n-1);

	long long ans=((get2(1,0,n-1,0,segg[1])*y[segg[1]])%mod);
	return ans;
}

int updateX(int pos, int val) {
   // pos--;
    x[pos]=val;
    update(1,0,n-1,pos);
	update2(1,w,n-1,pos);
	 // build(1,0,n-1);
//build2(1,0,n-1);
	long long ans=((get2(1,0,n-1,0,segg[1])*y[segg[1]])%mod);
	return ans;
}

int updateY(int pos, int val) {
   //  pos--;
    y[pos]=val;
    update(1,0,n-1,pos);
	update2(1,w,n-1,pos);
	 // build(1,0,n-1);
//build2(1,0,n-1);
long long ans=((get2(1,0,n-1,0,segg[1])*y[segg[1]])%mod);
	return ans;
}

Compilation message

horses.cpp: In function 'int init(int, int*, int*)':
horses.cpp:162:9: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
  162 |  return ans;
      |         ^~~
horses.cpp: In function 'int updateX(int, int)':
horses.cpp:173:9: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
  173 |  return ans;
      |         ^~~
horses.cpp: In function 'int updateY(int, int)':
horses.cpp:184:9: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
  184 |  return ans;
      |         ^~~

Subtask #1
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 316 KB Output is correct
7 Correct 1 ms 312 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 1 ms 308 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 0 ms 308 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 308 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct

Subtask #2
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 316 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 308 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 0 ms 308 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 1 ms 316 KB Output is correct
17 Correct 1 ms 308 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 0 ms 340 KB Output is correct
21 Correct 0 ms 308 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Incorrect 1 ms 340 KB Output isn't correct
24 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 107 ms 30036 KB Output is correct
2 Incorrect 168 ms 41636 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 308 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 312 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 308 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 308 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 1 ms 316 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 1 ms 312 KB Output is correct
20 Correct 0 ms 340 KB Output is correct
21 Correct 0 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Incorrect 1 ms 416 KB Output isn't correct
24 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 312 KB Output is correct
2 Correct 1 ms 316 KB Output is correct
3 Correct 1 ms 308 KB Output is correct
4 Correct 1 ms 308 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 312 KB Output is correct
11 Correct 1 ms 312 KB Output is correct
12 Correct 1 ms 304 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 308 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 312 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 0 ms 340 KB Output is correct
23 Incorrect 1 ms 340 KB Output isn't correct
24 Halted 0 ms 0 KB -