oj.uz

Submission #742520

# Submission time Handle Problem Language Result Execution time Memory
742520 2023-05-16T11:23:32 Z Dan4Life Horses (IOI15_horses) C++17
100 / 100
 372 ms 56176 KB 
#include "horses.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int mxN = (int)5e5+10;
const int MOD = (int)1e9+7;
struct Data{ double sum, ans; int i; } segTree[2*mxN];
ll n, X[mxN], Y[mxN], segTree2[2*mxN];

Data comb(Data &a, Data &b){
	Data c = {a.sum+b.sum,a.ans,a.i};
	if(a.ans <= a.sum+b.ans) c.i=b.i;
	c.ans = max(a.ans, a.sum+b.ans);
	return c;
}

void upd2(int x, ll v, int p=0, int l=0, int r=n-1){
	if(l==r){ segTree2[p] = v; return; }
	int mid = (l+r)/2; int rp = p+2*(mid-l+1);
	if(x<=mid) upd2(x,v,p+1,l,mid);
	else upd2(x,v,rp,mid+1,r);
	segTree2[p] = (ll)((segTree2[p+1]*segTree2[rp])%MOD);
}

ll query(int i, int j, int p=0, int l=0, int r=n-1){
	if(i>r or j<l or i>j) return 1ll;
	if(i<=l and r<=j) return segTree2[p];
	int mid = (l+r)/2; int rp = p+2*(mid-l+1);
	return (query(i,j,p+1,l,mid)*query(i,j,rp,mid+1,r))%MOD;
}

void upd(int x, ll v, int p=0, int l=0, int r=n-1){
	if(l==r){
		segTree[p] = {log(v),log(v)+log(Y[x]),x};
		X[x] = v; upd2(x,v); return;
	}
	int mid = (l+r)/2; int rp = p+2*(mid-l+1);
	if(x<=mid) upd(x,v,p+1,l,mid);
	else upd(x,v,rp,mid+1,r);
	segTree[p] = comb(segTree[p+1],segTree[rp]);
}

int init(int N, int x[], int y[]) {
	n = N;
	for(int i = 0; i < n; i++)
		X[i] = x[i], Y[i] = y[i], upd(i,X[i]);
	int i = segTree[0].i;
	return (query(0,i)*Y[i])%MOD;
}

int updateX(int x, int v) {
	upd(x,v);
	int i = segTree[0].i;
	return (query(0,i)*Y[i])%MOD;
}

int updateY(int x, int v) {
	Y[x] = v; upd(x,X[x]);
	int i = segTree[0].i;
	return (query(0,i)*Y[i])%MOD;
}

Compilation message

horses.cpp:17:49: warning: conversion from 'll' {aka 'long long int'} to 'int' may change value [-Wconversion]
   17 | void upd2(int x, ll v, int p=0, int l=0, int r=n-1){
      |                                                ~^~
horses.cpp:25:49: warning: conversion from 'll' {aka 'long long int'} to 'int' may change value [-Wconversion]
   25 | ll query(int i, int j, int p=0, int l=0, int r=n-1){
      |                                                ~^~
horses.cpp:32:48: warning: conversion from 'll' {aka 'long long int'} to 'int' may change value [-Wconversion]
   32 | void upd(int x, ll v, int p=0, int l=0, int r=n-1){
      |                                               ~^~
horses.cpp: In function 'void upd(int, ll, int, int, int)':
horses.cpp:35:21: warning: conversion from 'll' {aka 'long long int'} to 'int' may change value [-Wconversion]
   35 |   X[x] = v; upd2(x,v); return;
      |                     ^
horses.cpp: In function 'int init(int, int*, int*)':
horses.cpp:46:39: warning: conversion from 'll' {aka 'long long int'} to 'int' may change value [-Wconversion]
   46 |   X[i] = x[i], Y[i] = y[i], upd(i,X[i]);
      |                                       ^
horses.cpp:48:19: warning: conversion from 'll' {aka 'long long int'} to 'int' may change value [-Wconversion]
   48 |  return (query(0,i)*Y[i])%MOD;
      |                   ^
horses.cpp:48:26: warning: conversion from 'll' {aka 'long long int'} to 'int' may change value [-Wconversion]
   48 |  return (query(0,i)*Y[i])%MOD;
      |         ~~~~~~~~~~~~~~~~~^~~~
horses.cpp: In function 'int updateX(int, int)':
horses.cpp:52:9: warning: conversion from 'll' {aka 'long long int'} to 'int' may change value [-Wconversion]
   52 |  upd(x,v);
      |         ^
horses.cpp:54:19: warning: conversion from 'll' {aka 'long long int'} to 'int' may change value [-Wconversion]
   54 |  return (query(0,i)*Y[i])%MOD;
      |                   ^
horses.cpp:54:26: warning: conversion from 'll' {aka 'long long int'} to 'int' may change value [-Wconversion]
   54 |  return (query(0,i)*Y[i])%MOD;
      |         ~~~~~~~~~~~~~~~~~^~~~
horses.cpp: In function 'int updateY(int, int)':
horses.cpp:58:22: warning: conversion from 'll' {aka 'long long int'} to 'int' may change value [-Wconversion]
   58 |  Y[x] = v; upd(x,X[x]);
      |                      ^
horses.cpp:60:19: warning: conversion from 'll' {aka 'long long int'} to 'int' may change value [-Wconversion]
   60 |  return (query(0,i)*Y[i])%MOD;
      |                   ^
horses.cpp:60:26: warning: conversion from 'll' {aka 'long long int'} to 'int' may change value [-Wconversion]
   60 |  return (query(0,i)*Y[i])%MOD;
      |         ~~~~~~~~~~~~~~~~~^~~~

Subtask #1
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 336 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 284 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 416 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 279 ms 44352 KB Output is correct
2 Correct 343 ms 44272 KB Output is correct
3 Correct 326 ms 48124 KB Output is correct
4 Correct 336 ms 51948 KB Output is correct

Subtask #4
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 0 ms 340 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 253 ms 43388 KB Output is correct
34 Correct 250 ms 47332 KB Output is correct
35 Correct 277 ms 54348 KB Output is correct
36 Correct 268 ms 54140 KB Output is correct
37 Correct 233 ms 45436 KB Output is correct
38 Correct 234 ms 46496 KB Output is correct
39 Correct 223 ms 45316 KB Output is correct
40 Correct 242 ms 49280 KB Output is correct
41 Correct 240 ms 45484 KB Output is correct
42 Correct 225 ms 45536 KB Output is correct
43 Correct 236 ms 49740 KB Output is correct
44 Correct 234 ms 49708 KB Output is correct

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 468 KB Output is correct
33 Correct 281 ms 44328 KB Output is correct
34 Correct 372 ms 44264 KB Output is correct
35 Correct 341 ms 48124 KB Output is correct
36 Correct 349 ms 51916 KB Output is correct
37 Correct 250 ms 47360 KB Output is correct
38 Correct 241 ms 47296 KB Output is correct
39 Correct 280 ms 54452 KB Output is correct
40 Correct 257 ms 54184 KB Output is correct
41 Correct 226 ms 45548 KB Output is correct
42 Correct 230 ms 46452 KB Output is correct
43 Correct 214 ms 45316 KB Output is correct
44 Correct 246 ms 49520 KB Output is correct
45 Correct 220 ms 45516 KB Output is correct
46 Correct 221 ms 45536 KB Output is correct
47 Correct 244 ms 49724 KB Output is correct
48 Correct 234 ms 49652 KB Output is correct
49 Correct 359 ms 49284 KB Output is correct
50 Correct 337 ms 49356 KB Output is correct
51 Correct 327 ms 56176 KB Output is correct
52 Correct 304 ms 55700 KB Output is correct
53 Correct 332 ms 47888 KB Output is correct
54 Correct 308 ms 48208 KB Output is correct
55 Correct 279 ms 46516 KB Output is correct
56 Correct 283 ms 51148 KB Output is correct
57 Correct 288 ms 47216 KB Output is correct
58 Correct 294 ms 47612 KB Output is correct
59 Correct 241 ms 49664 KB Output is correct