Submission #62310

# Submission time Handle Problem Language Result Execution time Memory
62310 2018-07-28T04:29:08 Z tugushka Horses (IOI15_horses) C++14
54 / 100
522 ms 34420 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 = log10(dx), tree[x].xx = dx;
		if( dy ) tree[x].y = log10(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:32: 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 = log10(dx), tree[x].xx = dx;
                           ~~~~~^~~~
horses.cpp:19:29: 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 = log10(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 2 ms 248 KB Output is correct
2 Correct 3 ms 356 KB Output is correct
3 Correct 2 ms 560 KB Output is correct
4 Correct 4 ms 560 KB Output is correct
5 Correct 3 ms 560 KB Output is correct
6 Correct 3 ms 560 KB Output is correct
7 Correct 3 ms 560 KB Output is correct
8 Correct 2 ms 560 KB Output is correct
9 Correct 2 ms 560 KB Output is correct
10 Correct 2 ms 560 KB Output is correct
11 Correct 3 ms 560 KB Output is correct
12 Correct 3 ms 600 KB Output is correct
13 Correct 3 ms 600 KB Output is correct
14 Correct 3 ms 600 KB Output is correct
15 Correct 2 ms 600 KB Output is correct
16 Correct 3 ms 616 KB Output is correct
17 Correct 4 ms 616 KB Output is correct
18 Correct 3 ms 616 KB Output is correct
19 Correct 3 ms 616 KB Output is correct
20 Correct 2 ms 616 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 616 KB Output is correct
2 Correct 2 ms 616 KB Output is correct
3 Correct 3 ms 620 KB Output is correct
4 Correct 3 ms 620 KB Output is correct
5 Correct 2 ms 620 KB Output is correct
6 Correct 3 ms 620 KB Output is correct
7 Correct 2 ms 620 KB Output is correct
8 Correct 3 ms 620 KB Output is correct
9 Correct 3 ms 748 KB Output is correct
10 Correct 2 ms 748 KB Output is correct
11 Correct 3 ms 748 KB Output is correct
12 Correct 3 ms 748 KB Output is correct
13 Correct 3 ms 748 KB Output is correct
14 Correct 3 ms 748 KB Output is correct
15 Correct 2 ms 748 KB Output is correct
16 Correct 2 ms 748 KB Output is correct
17 Correct 2 ms 748 KB Output is correct
18 Correct 4 ms 748 KB Output is correct
19 Correct 3 ms 748 KB Output is correct
20 Correct 3 ms 748 KB Output is correct
21 Correct 2 ms 748 KB Output is correct
22 Correct 2 ms 748 KB Output is correct
23 Correct 5 ms 748 KB Output is correct
24 Correct 7 ms 748 KB Output is correct
25 Correct 4 ms 748 KB Output is correct
26 Correct 3 ms 748 KB Output is correct
27 Correct 4 ms 748 KB Output is correct
28 Correct 3 ms 748 KB Output is correct
29 Correct 4 ms 748 KB Output is correct
30 Correct 3 ms 748 KB Output is correct
31 Correct 3 ms 748 KB Output is correct
32 Correct 3 ms 748 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 310 ms 34292 KB Output is correct
2 Correct 441 ms 34292 KB Output is correct
3 Correct 348 ms 34364 KB Output is correct
4 Correct 396 ms 34420 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 34420 KB Output is correct
2 Correct 3 ms 34420 KB Output is correct
3 Correct 3 ms 34420 KB Output is correct
4 Correct 2 ms 34420 KB Output is correct
5 Correct 4 ms 34420 KB Output is correct
6 Correct 3 ms 34420 KB Output is correct
7 Correct 3 ms 34420 KB Output is correct
8 Correct 3 ms 34420 KB Output is correct
9 Correct 3 ms 34420 KB Output is correct
10 Correct 2 ms 34420 KB Output is correct
11 Correct 3 ms 34420 KB Output is correct
12 Correct 2 ms 34420 KB Output is correct
13 Correct 2 ms 34420 KB Output is correct
14 Correct 3 ms 34420 KB Output is correct
15 Correct 2 ms 34420 KB Output is correct
16 Correct 3 ms 34420 KB Output is correct
17 Correct 3 ms 34420 KB Output is correct
18 Correct 2 ms 34420 KB Output is correct
19 Correct 3 ms 34420 KB Output is correct
20 Correct 2 ms 34420 KB Output is correct
21 Correct 2 ms 34420 KB Output is correct
22 Correct 3 ms 34420 KB Output is correct
23 Correct 3 ms 34420 KB Output is correct
24 Correct 3 ms 34420 KB Output is correct
25 Correct 4 ms 34420 KB Output is correct
26 Correct 4 ms 34420 KB Output is correct
27 Correct 2 ms 34420 KB Output is correct
28 Correct 3 ms 34420 KB Output is correct
29 Correct 4 ms 34420 KB Output is correct
30 Correct 5 ms 34420 KB Output is correct
31 Correct 4 ms 34420 KB Output is correct
32 Correct 4 ms 34420 KB Output is correct
33 Correct 278 ms 34420 KB Output is correct
34 Correct 261 ms 34420 KB Output is correct
35 Correct 290 ms 34420 KB Output is correct
36 Correct 267 ms 34420 KB Output is correct
37 Correct 223 ms 34420 KB Output is correct
38 Correct 248 ms 34420 KB Output is correct
39 Correct 229 ms 34420 KB Output is correct
40 Correct 286 ms 34420 KB Output is correct
41 Correct 200 ms 34420 KB Output is correct
42 Correct 224 ms 34420 KB Output is correct
43 Incorrect 286 ms 34420 KB Output isn't correct
44 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 2 ms 34420 KB Output is correct
2 Correct 2 ms 34420 KB Output is correct
3 Correct 2 ms 34420 KB Output is correct
4 Correct 3 ms 34420 KB Output is correct
5 Correct 2 ms 34420 KB Output is correct
6 Correct 3 ms 34420 KB Output is correct
7 Correct 3 ms 34420 KB Output is correct
8 Correct 2 ms 34420 KB Output is correct
9 Correct 3 ms 34420 KB Output is correct
10 Correct 3 ms 34420 KB Output is correct
11 Correct 3 ms 34420 KB Output is correct
12 Correct 3 ms 34420 KB Output is correct
13 Correct 2 ms 34420 KB Output is correct
14 Correct 3 ms 34420 KB Output is correct
15 Correct 3 ms 34420 KB Output is correct
16 Correct 2 ms 34420 KB Output is correct
17 Correct 2 ms 34420 KB Output is correct
18 Correct 3 ms 34420 KB Output is correct
19 Correct 2 ms 34420 KB Output is correct
20 Correct 3 ms 34420 KB Output is correct
21 Correct 2 ms 34420 KB Output is correct
22 Correct 3 ms 34420 KB Output is correct
23 Correct 4 ms 34420 KB Output is correct
24 Correct 3 ms 34420 KB Output is correct
25 Correct 3 ms 34420 KB Output is correct
26 Correct 5 ms 34420 KB Output is correct
27 Correct 4 ms 34420 KB Output is correct
28 Correct 4 ms 34420 KB Output is correct
29 Correct 4 ms 34420 KB Output is correct
30 Correct 3 ms 34420 KB Output is correct
31 Correct 3 ms 34420 KB Output is correct
32 Correct 5 ms 34420 KB Output is correct
33 Correct 308 ms 34420 KB Output is correct
34 Correct 522 ms 34420 KB Output is correct
35 Correct 339 ms 34420 KB Output is correct
36 Correct 463 ms 34420 KB Output is correct
37 Correct 254 ms 34420 KB Output is correct
38 Correct 293 ms 34420 KB Output is correct
39 Correct 289 ms 34420 KB Output is correct
40 Correct 393 ms 34420 KB Output is correct
41 Correct 267 ms 34420 KB Output is correct
42 Correct 300 ms 34420 KB Output is correct
43 Correct 230 ms 34420 KB Output is correct
44 Correct 287 ms 34420 KB Output is correct
45 Correct 258 ms 34420 KB Output is correct
46 Correct 238 ms 34420 KB Output is correct
47 Incorrect 264 ms 34420 KB Output isn't correct
48 Halted 0 ms 0 KB -