답안 #62312 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
62312	2018-07-28T04:29:58 Z	tugushka	말 (IOI15_horses)	C++14	100 / 100	525 ms	46780 KB

horses

#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{
	double 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: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;
                                                        ^

Subtask #1
17.0 / 17.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	376 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	3 ms	376 KB	Output is correct
4	Correct	4 ms	440 KB	Output is correct
5	Correct	3 ms	616 KB	Output is correct
6	Correct	2 ms	616 KB	Output is correct
7	Correct	2 ms	616 KB	Output is correct
8	Correct	3 ms	616 KB	Output is correct
9	Correct	3 ms	616 KB	Output is correct
10	Correct	2 ms	616 KB	Output is correct
11	Correct	3 ms	616 KB	Output is correct
12	Correct	5 ms	616 KB	Output is correct
13	Correct	3 ms	616 KB	Output is correct
14	Correct	3 ms	616 KB	Output is correct
15	Correct	2 ms	616 KB	Output is correct
16	Correct	4 ms	616 KB	Output is correct
17	Correct	3 ms	616 KB	Output is correct
18	Correct	2 ms	616 KB	Output is correct
19	Correct	1 ms	616 KB	Output is correct
20	Correct	3 ms	616 KB	Output is correct

Subtask #2
17.0 / 17.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	616 KB	Output is correct
2	Correct	3 ms	616 KB	Output is correct
3	Correct	2 ms	616 KB	Output is correct
4	Correct	2 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	3 ms	620 KB	Output is correct
8	Correct	3 ms	620 KB	Output is correct
9	Correct	2 ms	620 KB	Output is correct
10	Correct	3 ms	620 KB	Output is correct
11	Correct	3 ms	620 KB	Output is correct
12	Correct	3 ms	620 KB	Output is correct
13	Correct	3 ms	620 KB	Output is correct
14	Correct	3 ms	620 KB	Output is correct
15	Correct	2 ms	620 KB	Output is correct
16	Correct	4 ms	620 KB	Output is correct
17	Correct	3 ms	620 KB	Output is correct
18	Correct	3 ms	620 KB	Output is correct
19	Correct	3 ms	620 KB	Output is correct
20	Correct	2 ms	624 KB	Output is correct
21	Correct	3 ms	624 KB	Output is correct
22	Correct	3 ms	624 KB	Output is correct
23	Correct	4 ms	624 KB	Output is correct
24	Correct	5 ms	624 KB	Output is correct
25	Correct	4 ms	656 KB	Output is correct
26	Correct	4 ms	656 KB	Output is correct
27	Correct	4 ms	656 KB	Output is correct
28	Correct	4 ms	668 KB	Output is correct
29	Correct	3 ms	708 KB	Output is correct
30	Correct	3 ms	748 KB	Output is correct
31	Correct	3 ms	780 KB	Output is correct
32	Correct	4 ms	780 KB	Output is correct

Subtask #3
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	345 ms	46504 KB	Output is correct
2	Correct	503 ms	46620 KB	Output is correct
3	Correct	370 ms	46620 KB	Output is correct
4	Correct	525 ms	46620 KB	Output is correct

Subtask #4
23.0 / 23.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	46620 KB	Output is correct
2	Correct	4 ms	46620 KB	Output is correct
3	Correct	3 ms	46620 KB	Output is correct
4	Correct	3 ms	46620 KB	Output is correct
5	Correct	2 ms	46620 KB	Output is correct
6	Correct	3 ms	46620 KB	Output is correct
7	Correct	3 ms	46620 KB	Output is correct
8	Correct	3 ms	46620 KB	Output is correct
9	Correct	3 ms	46620 KB	Output is correct
10	Correct	2 ms	46620 KB	Output is correct
11	Correct	3 ms	46620 KB	Output is correct
12	Correct	2 ms	46620 KB	Output is correct
13	Correct	2 ms	46620 KB	Output is correct
14	Correct	2 ms	46620 KB	Output is correct
15	Correct	3 ms	46620 KB	Output is correct
16	Correct	3 ms	46620 KB	Output is correct
17	Correct	3 ms	46620 KB	Output is correct
18	Correct	4 ms	46620 KB	Output is correct
19	Correct	2 ms	46620 KB	Output is correct
20	Correct	2 ms	46620 KB	Output is correct
21	Correct	2 ms	46620 KB	Output is correct
22	Correct	3 ms	46620 KB	Output is correct
23	Correct	3 ms	46620 KB	Output is correct
24	Correct	5 ms	46620 KB	Output is correct
25	Correct	4 ms	46620 KB	Output is correct
26	Correct	3 ms	46620 KB	Output is correct
27	Correct	3 ms	46620 KB	Output is correct
28	Correct	4 ms	46620 KB	Output is correct
29	Correct	4 ms	46620 KB	Output is correct
30	Correct	5 ms	46620 KB	Output is correct
31	Correct	4 ms	46620 KB	Output is correct
32	Correct	4 ms	46620 KB	Output is correct
33	Correct	263 ms	46620 KB	Output is correct
34	Correct	275 ms	46620 KB	Output is correct
35	Correct	370 ms	46620 KB	Output is correct
36	Correct	334 ms	46620 KB	Output is correct
37	Correct	294 ms	46620 KB	Output is correct
38	Correct	268 ms	46620 KB	Output is correct
39	Correct	253 ms	46620 KB	Output is correct
40	Correct	311 ms	46620 KB	Output is correct
41	Correct	342 ms	46620 KB	Output is correct
42	Correct	313 ms	46620 KB	Output is correct
43	Correct	320 ms	46620 KB	Output is correct
44	Correct	311 ms	46620 KB	Output is correct

Subtask #5
23.0 / 23.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	46620 KB	Output is correct
2	Correct	2 ms	46620 KB	Output is correct
3	Correct	3 ms	46620 KB	Output is correct
4	Correct	2 ms	46620 KB	Output is correct
5	Correct	3 ms	46620 KB	Output is correct
6	Correct	3 ms	46620 KB	Output is correct
7	Correct	3 ms	46620 KB	Output is correct
8	Correct	2 ms	46620 KB	Output is correct
9	Correct	3 ms	46620 KB	Output is correct
10	Correct	2 ms	46620 KB	Output is correct
11	Correct	2 ms	46620 KB	Output is correct
12	Correct	2 ms	46620 KB	Output is correct
13	Correct	2 ms	46620 KB	Output is correct
14	Correct	2 ms	46620 KB	Output is correct
15	Correct	3 ms	46620 KB	Output is correct
16	Correct	3 ms	46620 KB	Output is correct
17	Correct	2 ms	46620 KB	Output is correct
18	Correct	3 ms	46620 KB	Output is correct
19	Correct	3 ms	46620 KB	Output is correct
20	Correct	3 ms	46620 KB	Output is correct
21	Correct	3 ms	46620 KB	Output is correct
22	Correct	3 ms	46620 KB	Output is correct
23	Correct	4 ms	46620 KB	Output is correct
24	Correct	5 ms	46620 KB	Output is correct
25	Correct	4 ms	46620 KB	Output is correct
26	Correct	3 ms	46620 KB	Output is correct
27	Correct	4 ms	46620 KB	Output is correct
28	Correct	4 ms	46620 KB	Output is correct
29	Correct	4 ms	46620 KB	Output is correct
30	Correct	4 ms	46620 KB	Output is correct
31	Correct	4 ms	46620 KB	Output is correct
32	Correct	4 ms	46620 KB	Output is correct
33	Correct	288 ms	46652 KB	Output is correct
34	Correct	420 ms	46780 KB	Output is correct
35	Correct	352 ms	46780 KB	Output is correct
36	Correct	407 ms	46780 KB	Output is correct
37	Correct	298 ms	46780 KB	Output is correct
38	Correct	361 ms	46780 KB	Output is correct
39	Correct	299 ms	46780 KB	Output is correct
40	Correct	316 ms	46780 KB	Output is correct
41	Correct	266 ms	46780 KB	Output is correct
42	Correct	321 ms	46780 KB	Output is correct
43	Correct	253 ms	46780 KB	Output is correct
44	Correct	257 ms	46780 KB	Output is correct
45	Correct	289 ms	46780 KB	Output is correct
46	Correct	258 ms	46780 KB	Output is correct
47	Correct	297 ms	46780 KB	Output is correct
48	Correct	242 ms	46780 KB	Output is correct
49	Correct	375 ms	46780 KB	Output is correct
50	Correct	376 ms	46780 KB	Output is correct
51	Correct	352 ms	46780 KB	Output is correct
52	Correct	398 ms	46780 KB	Output is correct
53	Correct	362 ms	46780 KB	Output is correct
54	Correct	301 ms	46780 KB	Output is correct
55	Correct	288 ms	46780 KB	Output is correct
56	Correct	419 ms	46780 KB	Output is correct
57	Correct	335 ms	46780 KB	Output is correct
58	Correct	284 ms	46780 KB	Output is correct
59	Correct	357 ms	46780 KB	Output is correct

답안 #62312

Compilation message

Subtask #1 17.0 / 17.0

Subtask #2 17.0 / 17.0

Subtask #3 20.0 / 20.0

Subtask #4 23.0 / 23.0

Subtask #5 23.0 / 23.0

Subtask #1
17.0 / 17.0

Subtask #2
17.0 / 17.0

Subtask #3
20.0 / 20.0

Subtask #4
23.0 / 23.0

Subtask #5
23.0 / 23.0