# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
40049 |
2018-01-25T20:50:16 Z |
igzi |
Horses (IOI15_horses) |
C++14 |
|
78 ms |
47600 KB |
#include <bits/stdc++.h>
#include "horses.h"
#define maxN 500005
#define mod 1000000007
using namespace std;
struct segment{
long long a,b;};
segment seg[4*maxN];
vector <long long> x,y;
void build(int n,int l,int d){
if(l==d){
seg[n].a=x[l];
seg[n].b=(x[l]*y[l])%mod;
}
else{
int m=(l+d)/2;
build(2*n,l,m);
build(2*n+1,m+1,d);
seg[n].a=(seg[2*n].a*seg[2*n+1].a)%mod;
seg[n].b=(max(seg[2*n].b,(seg[2*n+1].b*seg[2*n].a)%mod))%mod;
}
}
void updatex(int n,int l,int d,int p,long long v){
if(l==d){
x[l]=v;
seg[n].a=x[l];
seg[n].b=(x[l]*y[l])%mod;
}
else{
int m=(l+d)/2;
if(p<=m) updatex(2*n,l,m,p,v);
else updatex(2*n+1,m+1,d,p,v);
seg[n].a=(seg[2*n].a*seg[2*n+1].a)%mod;
seg[n].b=(max(seg[2*n].b,(seg[2*n+1].b*seg[2*n].a)%mod))%mod;
}
}
void updatey(int n,int l,int d,int p,long long v){
if(l==d){
y[l]=v;
seg[n].b=(x[l]*y[l])%mod;
}
else{
int m=(l+d)/2;
if(p<=m) updatey(2*n,l,m,p,v);
else updatey(2*n+1,m+1,d,p,v);
seg[n].a=(seg[2*n].a*seg[2*n+1].a)%mod;
seg[n].b=(max(seg[2*n].b,(seg[2*n+1].b*seg[2*n].a)%mod))%mod;
}
}
int init(int n,int a[],int b[]){
int i;
long long ans;
for(i=0;i<n;i++){
x.push_back(a[i]%mod);
y.push_back(b[i]%mod);
}
build(1,0,n-1);
ans=seg[1].b%mod;
return (int) ans;
}
int updateX(int pos,int val){
long long ans;
updatex(1,0,x.size()-1,pos,(long long) val);
ans=seg[1].b%mod;
return (int) ans;
}
int updateY(int pos,int val){
long long ans;
updatey(1,0,y.size()-1,pos,(long long) val);
ans=seg[1].b%mod;
return (int) ans;
}
Compilation message
horses.cpp: In function 'int updateX(int, int)':
horses.cpp:67:43: warning: conversion to 'int' from 'std::vector<long long int>::size_type {aka long unsigned int}' may alter its value [-Wconversion]
updatex(1,0,x.size()-1,pos,(long long) val);
^
horses.cpp: In function 'int updateY(int, int)':
horses.cpp:73:43: warning: conversion to 'int' from 'std::vector<long long int>::size_type {aka long unsigned int}' may alter its value [-Wconversion]
updatey(1,0,y.size()-1,pos,(long long) val);
^
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
33276 KB |
Output is correct |
2 |
Correct |
0 ms |
33276 KB |
Output is correct |
3 |
Correct |
0 ms |
33276 KB |
Output is correct |
4 |
Correct |
0 ms |
33276 KB |
Output is correct |
5 |
Correct |
0 ms |
33276 KB |
Output is correct |
6 |
Correct |
0 ms |
33276 KB |
Output is correct |
7 |
Correct |
0 ms |
33276 KB |
Output is correct |
8 |
Correct |
0 ms |
33276 KB |
Output is correct |
9 |
Correct |
0 ms |
33276 KB |
Output is correct |
10 |
Correct |
0 ms |
33276 KB |
Output is correct |
11 |
Correct |
0 ms |
33276 KB |
Output is correct |
12 |
Correct |
0 ms |
33276 KB |
Output is correct |
13 |
Correct |
0 ms |
33276 KB |
Output is correct |
14 |
Correct |
0 ms |
33276 KB |
Output is correct |
15 |
Correct |
0 ms |
33276 KB |
Output is correct |
16 |
Correct |
0 ms |
33276 KB |
Output is correct |
17 |
Correct |
0 ms |
33276 KB |
Output is correct |
18 |
Correct |
0 ms |
33276 KB |
Output is correct |
19 |
Correct |
0 ms |
33276 KB |
Output is correct |
20 |
Correct |
0 ms |
33276 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
33276 KB |
Output is correct |
2 |
Correct |
0 ms |
33276 KB |
Output is correct |
3 |
Correct |
0 ms |
33276 KB |
Output is correct |
4 |
Correct |
0 ms |
33276 KB |
Output is correct |
5 |
Correct |
0 ms |
33276 KB |
Output is correct |
6 |
Correct |
0 ms |
33276 KB |
Output is correct |
7 |
Correct |
0 ms |
33276 KB |
Output is correct |
8 |
Correct |
0 ms |
33276 KB |
Output is correct |
9 |
Correct |
0 ms |
33276 KB |
Output is correct |
10 |
Correct |
0 ms |
33276 KB |
Output is correct |
11 |
Correct |
0 ms |
33276 KB |
Output is correct |
12 |
Correct |
0 ms |
33276 KB |
Output is correct |
13 |
Correct |
0 ms |
33276 KB |
Output is correct |
14 |
Correct |
0 ms |
33276 KB |
Output is correct |
15 |
Correct |
0 ms |
33276 KB |
Output is correct |
16 |
Correct |
0 ms |
33276 KB |
Output is correct |
17 |
Correct |
0 ms |
33276 KB |
Output is correct |
18 |
Correct |
0 ms |
33276 KB |
Output is correct |
19 |
Correct |
0 ms |
33276 KB |
Output is correct |
20 |
Correct |
0 ms |
33276 KB |
Output is correct |
21 |
Incorrect |
0 ms |
33276 KB |
Output isn't correct |
22 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
78 ms |
47600 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
33276 KB |
Output is correct |
2 |
Correct |
0 ms |
33276 KB |
Output is correct |
3 |
Correct |
0 ms |
33276 KB |
Output is correct |
4 |
Correct |
0 ms |
33276 KB |
Output is correct |
5 |
Correct |
0 ms |
33276 KB |
Output is correct |
6 |
Correct |
0 ms |
33276 KB |
Output is correct |
7 |
Correct |
0 ms |
33276 KB |
Output is correct |
8 |
Correct |
0 ms |
33276 KB |
Output is correct |
9 |
Correct |
0 ms |
33276 KB |
Output is correct |
10 |
Correct |
0 ms |
33276 KB |
Output is correct |
11 |
Correct |
0 ms |
33276 KB |
Output is correct |
12 |
Correct |
0 ms |
33276 KB |
Output is correct |
13 |
Correct |
0 ms |
33276 KB |
Output is correct |
14 |
Correct |
0 ms |
33276 KB |
Output is correct |
15 |
Correct |
0 ms |
33276 KB |
Output is correct |
16 |
Correct |
0 ms |
33276 KB |
Output is correct |
17 |
Correct |
0 ms |
33276 KB |
Output is correct |
18 |
Correct |
0 ms |
33276 KB |
Output is correct |
19 |
Correct |
0 ms |
33276 KB |
Output is correct |
20 |
Correct |
0 ms |
33276 KB |
Output is correct |
21 |
Incorrect |
0 ms |
33276 KB |
Output isn't correct |
22 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
33276 KB |
Output is correct |
2 |
Correct |
0 ms |
33276 KB |
Output is correct |
3 |
Correct |
0 ms |
33276 KB |
Output is correct |
4 |
Correct |
0 ms |
33276 KB |
Output is correct |
5 |
Correct |
0 ms |
33276 KB |
Output is correct |
6 |
Correct |
0 ms |
33276 KB |
Output is correct |
7 |
Correct |
0 ms |
33276 KB |
Output is correct |
8 |
Correct |
0 ms |
33276 KB |
Output is correct |
9 |
Correct |
0 ms |
33276 KB |
Output is correct |
10 |
Correct |
0 ms |
33276 KB |
Output is correct |
11 |
Correct |
0 ms |
33276 KB |
Output is correct |
12 |
Correct |
0 ms |
33276 KB |
Output is correct |
13 |
Correct |
0 ms |
33276 KB |
Output is correct |
14 |
Correct |
0 ms |
33276 KB |
Output is correct |
15 |
Correct |
0 ms |
33276 KB |
Output is correct |
16 |
Correct |
0 ms |
33276 KB |
Output is correct |
17 |
Correct |
0 ms |
33276 KB |
Output is correct |
18 |
Correct |
0 ms |
33276 KB |
Output is correct |
19 |
Correct |
0 ms |
33276 KB |
Output is correct |
20 |
Correct |
0 ms |
33276 KB |
Output is correct |
21 |
Incorrect |
0 ms |
33276 KB |
Output isn't correct |
22 |
Halted |
0 ms |
0 KB |
- |