Submission #62309

# Submission time Handle Problem Language Result Execution time Memory
62309 2018-07-28T04:28:10 Z tugushka Horses (IOI15_horses) C++14
54 / 100
484 ms 34484 KB
#include "horses.h"
#include<bits/stdc++.h>
using namespace std;

#define mod 1000000007
#define L(x) ((x)<<1)
#define R(x) (((x)<<1)|1)

struct Node{
	float sumx, y, max_val;
	int res, modx, xx, yy;
} tree[1<<21];

int n;
void update(int l, int r, int x, int pos, int dx, int dy){
	if( r < pos || pos < l) return;
	if( l == pos && l == r ){
		if( dx ) tree[x].sumx = log(dx), tree[x].xx = dx;
		if( dy ) tree[x].y = log(dy), tree[x].yy = dy;
		tree[x].max_val = tree[x].sumx + tree[x].y;
		tree[x].res = 1LL * tree[x].xx * tree[x].yy % mod;
		tree[x].modx = tree[x].xx;
		return;
	}
	
	int mid = (l+r)>>1;
	update( l, mid, L(x), pos, dx, dy );
	update( mid+1, r, R(x), pos, dx, dy );
	
	tree[x].sumx = tree[L(x)].sumx + tree[R(x)].sumx;
	tree[x].modx = 1LL * tree[L(x)].modx * tree[R(x)].modx % mod;
	if( tree[L(x)].max_val < tree[R(x)].max_val + tree[L(x)].sumx ){
		tree[x].max_val = tree[R(x)].max_val + tree[L(x)].sumx;
		tree[x].res = 1LL * tree[R(x)].res * tree[L(x)].modx % mod;
	}
	else{
		tree[x].max_val = tree[L(x)].max_val;
		tree[x].res = tree[L(x)].res;
	}
}

int init(int N, int X[], int Y[]) {
	n = N;
	for(int i = 0 ; i < n ; i++) update( 0, n-1, 1, i, X[i], Y[i] );
	return tree[1].res;
}

int updateX(int pos, int val) {	
	update(0, n-1, 1, pos, val, 0);
	return tree[1].res;
}

int updateY(int pos, int val) {
	update(0, n-1, 1, pos, 0, val);
	return tree[1].res;
}

Compilation message

horses.cpp: In function 'void update(int, int, int, int, int, int)':
horses.cpp:18:30: warning: conversion to 'float' from '__gnu_cxx::__enable_if<true, double>::__type {aka double}' may alter its value [-Wfloat-conversion]
   if( dx ) tree[x].sumx = log(dx), tree[x].xx = dx;
                           ~~~^~~~
horses.cpp:19:27: warning: conversion to 'float' from '__gnu_cxx::__enable_if<true, double>::__type {aka double}' may alter its value [-Wfloat-conversion]
   if( dy ) tree[x].y = log(dy), tree[x].yy = dy;
                        ~~~^~~~
horses.cpp:21:47: warning: conversion to 'int' from 'long long int' may alter its value [-Wconversion]
   tree[x].res = 1LL * tree[x].xx * tree[x].yy % mod;
                                               ^
horses.cpp:31:57: warning: conversion to 'int' from 'long long int' may alter its value [-Wconversion]
  tree[x].modx = 1LL * tree[L(x)].modx * tree[R(x)].modx % mod;
                                                         ^
horses.cpp:34:56: warning: conversion to 'int' from 'long long int' may alter its value [-Wconversion]
   tree[x].res = 1LL * tree[R(x)].res * tree[L(x)].modx % mod;
                                                        ^
# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 2 ms 472 KB Output is correct
3 Correct 3 ms 544 KB Output is correct
4 Correct 2 ms 544 KB Output is correct
5 Correct 2 ms 544 KB Output is correct
6 Correct 2 ms 552 KB Output is correct
7 Correct 3 ms 596 KB Output is correct
8 Correct 2 ms 596 KB Output is correct
9 Correct 2 ms 596 KB Output is correct
10 Correct 3 ms 596 KB Output is correct
11 Correct 3 ms 596 KB Output is correct
12 Correct 3 ms 596 KB Output is correct
13 Correct 3 ms 596 KB Output is correct
14 Correct 2 ms 596 KB Output is correct
15 Correct 2 ms 596 KB Output is correct
16 Correct 3 ms 596 KB Output is correct
17 Correct 3 ms 596 KB Output is correct
18 Correct 3 ms 596 KB Output is correct
19 Correct 3 ms 596 KB Output is correct
20 Correct 3 ms 596 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 3 ms 596 KB Output is correct
2 Correct 3 ms 716 KB Output is correct
3 Correct 3 ms 716 KB Output is correct
4 Correct 3 ms 716 KB Output is correct
5 Correct 4 ms 716 KB Output is correct
6 Correct 6 ms 720 KB Output is correct
7 Correct 3 ms 724 KB Output is correct
8 Correct 3 ms 724 KB Output is correct
9 Correct 4 ms 724 KB Output is correct
10 Correct 4 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 3 ms 724 KB Output is correct
14 Correct 3 ms 724 KB Output is correct
15 Correct 3 ms 724 KB Output is correct
16 Correct 3 ms 724 KB Output is correct
17 Correct 4 ms 724 KB Output is correct
18 Correct 3 ms 724 KB Output is correct
19 Correct 3 ms 724 KB Output is correct
20 Correct 2 ms 724 KB Output is correct
21 Correct 2 ms 724 KB Output is correct
22 Correct 4 ms 724 KB Output is correct
23 Correct 4 ms 724 KB Output is correct
24 Correct 4 ms 724 KB Output is correct
25 Correct 3 ms 724 KB Output is correct
26 Correct 4 ms 724 KB Output is correct
27 Correct 3 ms 724 KB Output is correct
28 Correct 3 ms 724 KB Output is correct
29 Correct 2 ms 724 KB Output is correct
30 Correct 3 ms 724 KB Output is correct
31 Correct 3 ms 724 KB Output is correct
32 Correct 3 ms 724 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 291 ms 34336 KB Output is correct
2 Correct 425 ms 34412 KB Output is correct
3 Correct 383 ms 34412 KB Output is correct
4 Correct 400 ms 34484 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 34484 KB Output is correct
2 Correct 4 ms 34484 KB Output is correct
3 Correct 3 ms 34484 KB Output is correct
4 Correct 3 ms 34484 KB Output is correct
5 Correct 4 ms 34484 KB Output is correct
6 Correct 4 ms 34484 KB Output is correct
7 Correct 3 ms 34484 KB Output is correct
8 Correct 2 ms 34484 KB Output is correct
9 Correct 3 ms 34484 KB Output is correct
10 Correct 4 ms 34484 KB Output is correct
11 Correct 3 ms 34484 KB Output is correct
12 Correct 3 ms 34484 KB Output is correct
13 Correct 2 ms 34484 KB Output is correct
14 Correct 2 ms 34484 KB Output is correct
15 Correct 3 ms 34484 KB Output is correct
16 Correct 3 ms 34484 KB Output is correct
17 Correct 3 ms 34484 KB Output is correct
18 Correct 3 ms 34484 KB Output is correct
19 Correct 3 ms 34484 KB Output is correct
20 Correct 2 ms 34484 KB Output is correct
21 Correct 3 ms 34484 KB Output is correct
22 Correct 3 ms 34484 KB Output is correct
23 Correct 3 ms 34484 KB Output is correct
24 Correct 4 ms 34484 KB Output is correct
25 Correct 3 ms 34484 KB Output is correct
26 Correct 4 ms 34484 KB Output is correct
27 Correct 4 ms 34484 KB Output is correct
28 Correct 4 ms 34484 KB Output is correct
29 Correct 4 ms 34484 KB Output is correct
30 Correct 3 ms 34484 KB Output is correct
31 Correct 3 ms 34484 KB Output is correct
32 Correct 3 ms 34484 KB Output is correct
33 Correct 358 ms 34484 KB Output is correct
34 Correct 298 ms 34484 KB Output is correct
35 Correct 324 ms 34484 KB Output is correct
36 Correct 312 ms 34484 KB Output is correct
37 Correct 281 ms 34484 KB Output is correct
38 Correct 294 ms 34484 KB Output is correct
39 Correct 206 ms 34484 KB Output is correct
40 Correct 283 ms 34484 KB Output is correct
41 Correct 231 ms 34484 KB Output is correct
42 Correct 243 ms 34484 KB Output is correct
43 Incorrect 270 ms 34484 KB Output isn't correct
44 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 2 ms 34484 KB Output is correct
2 Correct 3 ms 34484 KB Output is correct
3 Correct 2 ms 34484 KB Output is correct
4 Correct 3 ms 34484 KB Output is correct
5 Correct 2 ms 34484 KB Output is correct
6 Correct 3 ms 34484 KB Output is correct
7 Correct 3 ms 34484 KB Output is correct
8 Correct 2 ms 34484 KB Output is correct
9 Correct 3 ms 34484 KB Output is correct
10 Correct 3 ms 34484 KB Output is correct
11 Correct 3 ms 34484 KB Output is correct
12 Correct 3 ms 34484 KB Output is correct
13 Correct 3 ms 34484 KB Output is correct
14 Correct 2 ms 34484 KB Output is correct
15 Correct 2 ms 34484 KB Output is correct
16 Correct 3 ms 34484 KB Output is correct
17 Correct 2 ms 34484 KB Output is correct
18 Correct 2 ms 34484 KB Output is correct
19 Correct 3 ms 34484 KB Output is correct
20 Correct 3 ms 34484 KB Output is correct
21 Correct 3 ms 34484 KB Output is correct
22 Correct 3 ms 34484 KB Output is correct
23 Correct 3 ms 34484 KB Output is correct
24 Correct 2 ms 34484 KB Output is correct
25 Correct 3 ms 34484 KB Output is correct
26 Correct 4 ms 34484 KB Output is correct
27 Correct 3 ms 34484 KB Output is correct
28 Correct 4 ms 34484 KB Output is correct
29 Correct 3 ms 34484 KB Output is correct
30 Correct 4 ms 34484 KB Output is correct
31 Correct 4 ms 34484 KB Output is correct
32 Correct 4 ms 34484 KB Output is correct
33 Correct 359 ms 34484 KB Output is correct
34 Correct 460 ms 34484 KB Output is correct
35 Correct 404 ms 34484 KB Output is correct
36 Correct 484 ms 34484 KB Output is correct
37 Correct 255 ms 34484 KB Output is correct
38 Correct 288 ms 34484 KB Output is correct
39 Correct 318 ms 34484 KB Output is correct
40 Correct 316 ms 34484 KB Output is correct
41 Correct 263 ms 34484 KB Output is correct
42 Correct 295 ms 34484 KB Output is correct
43 Correct 267 ms 34484 KB Output is correct
44 Correct 318 ms 34484 KB Output is correct
45 Correct 273 ms 34484 KB Output is correct
46 Correct 223 ms 34484 KB Output is correct
47 Incorrect 270 ms 34484 KB Output isn't correct
48 Halted 0 ms 0 KB -