Submission #672340

#	Time	Username	Problem	Language	Result	Execution time	Memory
672340		Trisanu_Das	Horses (IOI15_horses)	C++17	100 / 100	537 ms	67044 KiB

horses

#include "horses.h"
#include <bits/stdc++.h>
#define mod 1000000007
using namespace std;
typedef long long ll;
 
int n;
 
struct node{
  ll v, x, y; double dx, dy, dv;
}t[4 * 500005];
 
node merge(node a, node b){
  node res;
  b.dx += a.dx, b.dv += a.dx;
  if (a.dv > b.dv) res.v = a.v, res.dv = a.dv;
  else res.v = a.x * b.v % mod, res.dv = b.dv;
  res.x = a.x * b.x % mod;
  res.dx = b.dx;
  return res;
}
 
 
node upd(int i, int l, int r, int ps, ll vx, ll vy){
  if (l > ps || r < ps) return t[i];
  if (l == r && l == ps) {
		node& nd = t[i];
		if (vx) nd.dx = log(vx), nd.x = vx;
		if (vy) nd.dy = log(vy), nd.y = vy;
		nd.v = nd.x * nd.y % mod, nd.dv = nd.dx + nd.dy;
		return nd;
	}
	int m = (l + r) / 2;
	return t[i] = merge(upd(i * 2, l, m, ps, vx, vy), upd(i * 2 + 1, m + 1, r, ps, vx, vy));
}
 
int init(int N, int X[], int Y[]) {
	n = N;
	for (int i = 0; i < N; i++) upd(1, 0, n - 1, i, X[i], Y[i]);
	return t[1].v;
}
 
int updateX(int pos, int val) {	
	upd(1, 0, n - 1, pos, val, 0);
	return t[1].v;
}
 
int updateY(int pos, int val) {
	upd(1, 0, n - 1, pos, 0, val);
	return t[1].v;
}

Compilation message (stderr)

horses.cpp: In function 'int init(int, int*, int*)':
horses.cpp:40:14: warning: conversion from 'll' {aka 'long long int'} to 'int' may change value [-Wconversion]
   40 |  return t[1].v;
      |         ~~~~~^
horses.cpp: In function 'int updateX(int, int)':
horses.cpp:45:14: warning: conversion from 'll' {aka 'long long int'} to 'int' may change value [-Wconversion]
   45 |  return t[1].v;
      |         ~~~~~^
horses.cpp: In function 'int updateY(int, int)':
horses.cpp:50:14: warning: conversion from 'll' {aka 'long long int'} to 'int' may change value [-Wconversion]
   50 |  return t[1].v;
      |         ~~~~~^

• Subtask 1: 17 / 17
• Subtask 2: 17 / 17
• Subtask 3: 20 / 20
• Subtask 4: 23 / 23
• Subtask 5: 23 / 23