oj.uz

Submission #152293

# Submission time Handle Problem Language Result Execution time Memory
152293 2019-09-07T04:22:28 Z tinjyu Horses (IOI15_horses) C++14
37 / 100
 156 ms 33892 KB 
#include "horses.h"
#include <iostream>
using namespace std;
long long int x[1000005],y[1000005],tree[2000005],st,en;
int n;
long long int build(int s,int e,int t)
{
    if(s==e)
	{
		return tree[t]=x[s];

	}
	else 
	{	
		tree[t]=(build(s,(s+e)/2,t*2)*build((s+e)/2+1,e,t*2+1))%1000000007;
		//cout<<s<<" "<<e<<" "<<tree[t]<<endl;
		return tree[t]; 
	}
}
long long int findtree(int s,int e,int t)
{
    if(e<st || en<s)return 1;
    else if(st<=s && e<=en)return tree[t];
    else return (findtree(s,(s+e)/2,t*2)*findtree((s+e)/2+1,e,t*2+1))%1000000007;
}
long long int changetree(int s,int e,int t)
{
	if(st<s || e<st)return tree[t];
    if(s==e)return tree[t]=en%1000000007;
    
    else 
	{
		tree[t]=(changetree(s,(s+e)/2,t*2)*changetree((s+e)/2+1,e,t*2+1))%1000000007;
		return tree[t];
	}
}
int init(int N, int X[], int Y[]) {
    n=N;
    for(int i=0;i<n;i++)x[i]=X[i];
    for(int i=0;i<n;i++)y[i]=Y[i];
    build(0,n-1,1);
    long long int ans=max(n-32,0),tmp=1;
    for(int i=max(n-32,0);i<n;i++)
    {
        double t=(double)y[ans]/double(y[i]);
        if(tmp<2000000000)tmp*=x[i];
        if(tmp>=t)
        {
            ans=i;
            tmp=1;
        }
    }
    long long int a=y[ans];
    en=ans;
    //cout<<ans<<endl;
    a=(a*findtree(0,n-1,1))%1000000007;
	return a;
}
 
int updateX(int pos, int val) {
    x[pos]=val;
    st=pos,en=val;
    changetree(0,n-1,1);
    long long int ans=max(n-32,0),tmp=1;
    for(int i=max(n-32,0);i<n;i++)
    {
        double t=(double)y[ans]/double(y[i]);
        if(tmp<2000000000)tmp*=x[i];
        if(tmp>=t)
        {
            ans=i;
            tmp=1;
        }
    }
	int a=y[ans];
	st=0;
    en=ans;
    a=(a*findtree(0,n-1,1))%1000000007;
	return a;
}
 
int updateY(int pos, int val) {
    y[pos]=val;
    long long int ans=max(n-32,0),tmp=1;
    for(int i=max(n-32,0);i<n;i++)
    {
        double t=(double)y[ans]/double(y[i]);
        if(tmp<2000000000)tmp*=x[i];
        if(tmp>=t)
        {
            ans=i;
            tmp=1;
        }
    }
    long long int a=y[ans];
    st=0;
    en=ans;
    a=(a*findtree(0,n-1,1))%1000000007;
	return a;
}

Compilation message

horses.cpp: In function 'int init(int, int*, int*)':
horses.cpp:47:17: warning: conversion to 'double' from 'long long int' may alter its value [-Wconversion]
         if(tmp>=t)
                 ^
horses.cpp:57:9: warning: conversion to 'int' from 'long long int' may alter its value [-Wconversion]
  return a;
         ^
horses.cpp: In function 'int updateX(int, int)':
horses.cpp:69:17: warning: conversion to 'double' from 'long long int' may alter its value [-Wconversion]
         if(tmp>=t)
                 ^
horses.cpp:75:13: warning: conversion to 'int' from 'long long int' may alter its value [-Wconversion]
  int a=y[ans];
        ~~~~~^
horses.cpp:78:28: warning: conversion to 'int' from 'long long int' may alter its value [-Wconversion]
     a=(a*findtree(0,n-1,1))%1000000007;
       ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
horses.cpp: In function 'int updateY(int, int)':
horses.cpp:89:17: warning: conversion to 'double' from 'long long int' may alter its value [-Wconversion]
         if(tmp>=t)
                 ^
horses.cpp:99:9: warning: conversion to 'int' from 'long long int' may alter its value [-Wconversion]
  return a;
         ^

Subtask #1
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 4 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 3 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 504 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
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 3 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 292 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 364 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 376 KB Output is correct
22 Correct 2 ms 376 KB Output is correct
23 Incorrect 3 ms 376 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 95 ms 25036 KB Output is correct
2 Correct 147 ms 33892 KB Output is correct
3 Correct 121 ms 25080 KB Output is correct
4 Correct 156 ms 28920 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 400 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 380 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 376 KB Output is correct
22 Correct 2 ms 376 KB Output is correct
23 Incorrect 3 ms 376 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 376 KB Output is correct
2 Correct 2 ms 380 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 3 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 360 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 380 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 3 ms 376 KB Output is correct
20 Correct 2 ms 380 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 2 ms 376 KB Output is correct
23 Incorrect 3 ms 376 KB Output isn't correct
24 Halted 0 ms 0 KB -