oj.uz

답안 #621079

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

long long x[500001];
long long seg[2000002],segg[2000002],mu[2000002];
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;

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;
    for(long i=0;i<n;i++)
    {
        x[i]=X[i];
        y[i]=Y[i];
    }
    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 updateX(int pos, int val) {
   // pos--;
    x[pos]=val;
    update(1,0,n-1,pos);
	update2(1,0,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,0,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:165:9: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
  165 |  return ans;
      |         ^~~
horses.cpp: In function 'int updateX(int, int)':
horses.cpp:176:9: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
  176 |  return ans;
      |         ^~~
horses.cpp: In function 'int updateY(int, int)':
horses.cpp:187:9: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
  187 |  return ans;
      |         ^~~

Subtask #1
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 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 0 ms 340 KB Output is correct
6 Correct 0 ms 212 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 212 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct

Subtask #2
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 0 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 2 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 2 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 2 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 231 ms 37560 KB Output is correct
2 Correct 288 ms 37556 KB Output is correct
3 Correct 364 ms 37720 KB Output is correct
4 Correct 336 ms 37552 KB Output is correct

Subtask #4
23.0 / 23.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 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 0 ms 212 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 Correct 2 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 2 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 117 ms 36720 KB Output is correct
34 Correct 121 ms 36756 KB Output is correct
35 Correct 103 ms 36716 KB Output is correct
36 Correct 95 ms 36672 KB Output is correct
37 Correct 91 ms 36676 KB Output is correct
38 Correct 81 ms 36680 KB Output is correct
39 Correct 63 ms 36684 KB Output is correct
40 Correct 80 ms 36776 KB Output is correct
41 Correct 81 ms 36760 KB Output is correct
42 Correct 69 ms 36684 KB Output is correct
43 Correct 77 ms 36600 KB Output is correct
44 Correct 74 ms 36604 KB Output is correct

Subtask #5
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 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 0 ms 212 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 0 ms 340 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 212 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 0 ms 340 KB Output is correct
21 Correct 0 ms 340 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 2 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 232 ms 37640 KB Output is correct
34 Correct 289 ms 37616 KB Output is correct
35 Correct 356 ms 37764 KB Output is correct
36 Correct 352 ms 37676 KB Output is correct
37 Correct 116 ms 36788 KB Output is correct
38 Correct 122 ms 36740 KB Output is correct
39 Correct 104 ms 36660 KB Output is correct
40 Correct 96 ms 36668 KB Output is correct
41 Correct 89 ms 36780 KB Output is correct
42 Correct 96 ms 36752 KB Output is correct
43 Correct 74 ms 36648 KB Output is correct
44 Correct 79 ms 36728 KB Output is correct
45 Correct 73 ms 36692 KB Output is correct
46 Correct 68 ms 36708 KB Output is correct
47 Correct 76 ms 36684 KB Output is correct
48 Correct 72 ms 36648 KB Output is correct
49 Correct 513 ms 37680 KB Output is correct
50 Correct 465 ms 37700 KB Output is correct
51 Correct 274 ms 37664 KB Output is correct
52 Correct 180 ms 37620 KB Output is correct
53 Correct 420 ms 37608 KB Output is correct
54 Correct 242 ms 37496 KB Output is correct
55 Correct 143 ms 36816 KB Output is correct
56 Correct 183 ms 37568 KB Output is correct
57 Correct 248 ms 37584 KB Output is correct
58 Correct 185 ms 37708 KB Output is correct
59 Correct 71 ms 36612 KB Output is correct