Submission #1007991

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1007991	2024-06-26T05:12:37 Z	The_Samurai	Horses (IOI15_horses)	C++17	Compilation error	0 ms	0 KB

horses

#include "horses.h"
#include "bits/stdc++.h"
using namespace std;
const int mod = 1e9 + 7;
using ll = long long;

struct SegTreeY {
	vector<int> tree;
	int size;
	int neutral_element = -1e9;

	int merge(int a, int b) {
		return max(a, b);
	}
	
	void build(const vector<int> &a) {
		size = 1;
		while (size < a.size()) size *= 2;
		tree.assign(2 * size, neutral_element);
		for (int i = size; i < size + a.size(); i++) tree[i] = a[i - size];
		for (int i = size - 1; i > 0; i--) tree[i] = merge(tree[i << 1], tree[i << 1 | 1]);
	}

	void upd(int i, int v) {
		i += size;
		tree[i] = v;
		for (; i > 1; i >>= 1) tree[i >> 1] = merge(tree[i], tree[i ^ 1]);
	}

	int get(int l, int r) {
		if (l > r) return neutral_element;
		int res = neutral_element;
		for (l += size, r += size + 1; l < r; l >>= 1, r >>= 1) {
			if (l & 1) res = merge(res, tree[l++]);
			if (r & 1) res = merge(res, tree[--r]);
		}
		return res;
	}
};

struct SegTreeX {
	vector<int> tree;
	int size;
	int neutral_element = 1;

	int merge(int a, int b) {
		return 1ll * a * b % mod;
	}
	
	void build(const vector<int> &a) {
		size = 1;
		while (size < a.size()) size *= 2;
		tree.assign(2 * size, neutral_element);
		for (int i = size; i < size + a.size(); i++) tree[i] = a[i - size];
		for (int i = size - 1; i > 0; i--) tree[i] = merge(tree[i << 1], tree[i << 1 | 1]);
	}

	void upd(int i, int v) {
		i += size;
		tree[i] = v;
		for (; i > 1; i >>= 1) tree[i >> 1] = merge(tree[i], tree[i ^ 1]);
	}

	int get(int l, int r) {
		if (l > r) return neutral_element;
		int res = neutral_element;
		for (l += size, r += size + 1; l < r; l >>= 1, r >>= 1) {
			if (l & 1) res = merge(res, tree[l++]);
			if (r & 1) res = merge(res, tree[--r]);
		}
		return res;
	}
};

int n;
vector<int> x, y;

int get_ans() {
	ll best = 1;
	int mul = 1;
	for (int i = 0; i < n; i++) {
		mul *= x[i];
		best = max(best, mul * y[i]);
	}
	return best % mod;
}

int init(int N, int X[], int Y[]) {
	n = N;
	x.resize(n), y.resize(n);
	for (int i = 0; i < n; i++) x[i] = X[i], y[i] = Y[i];
	return get_ans();
}

int updateX(int pos, int val) {
	x[pos] = val;
	return get_ans();
}

int updateY(int pos, int val) {
	y[pos] = val;
	return get_ans();
}

Compilation message

horses.cpp: In member function 'void SegTreeY::build(const std::vector<int>&)':
horses.cpp:18:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   18 |   while (size < a.size()) size *= 2;
      |          ~~~~~^~~~~~~~~~
horses.cpp:20:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   20 |   for (int i = size; i < size + a.size(); i++) tree[i] = a[i - size];
      |                      ~~^~~~~~~~~~~~~~~~~
horses.cpp: In member function 'int SegTreeX::merge(int, int)':
horses.cpp:47:22: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
   47 |   return 1ll * a * b % mod;
      |          ~~~~~~~~~~~~^~~~~
horses.cpp: In member function 'void SegTreeX::build(const std::vector<int>&)':
horses.cpp:52:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   52 |   while (size < a.size()) size *= 2;
      |          ~~~~~^~~~~~~~~~
horses.cpp:54:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   54 |   for (int i = size; i < size + a.size(); i++) tree[i] = a[i - size];
      |                      ~~^~~~~~~~~~~~~~~~~
horses.cpp: In function 'int get_ans()':
horses.cpp:83:30: error: no matching function for call to 'max(ll&, int)'
   83 |   best = max(best, mul * y[i]);
      |                              ^
In file included from /usr/include/c++/10/bits/specfun.h:45,
                 from /usr/include/c++/10/cmath:1927,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:41,
                 from horses.cpp:2:
/usr/include/c++/10/bits/stl_algobase.h:254:5: note: candidate: 'template<class _Tp> constexpr const _Tp& std::max(const _Tp&, const _Tp&)'
  254 |     max(const _Tp& __a, const _Tp& __b)
      |     ^~~
/usr/include/c++/10/bits/stl_algobase.h:254:5: note:   template argument deduction/substitution failed:
horses.cpp:83:30: note:   deduced conflicting types for parameter 'const _Tp' ('long long int' and 'int')
   83 |   best = max(best, mul * y[i]);
      |                              ^
In file included from /usr/include/c++/10/bits/specfun.h:45,
                 from /usr/include/c++/10/cmath:1927,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:41,
                 from horses.cpp:2:
/usr/include/c++/10/bits/stl_algobase.h:300:5: note: candidate: 'template<class _Tp, class _Compare> constexpr const _Tp& std::max(const _Tp&, const _Tp&, _Compare)'
  300 |     max(const _Tp& __a, const _Tp& __b, _Compare __comp)
      |     ^~~
/usr/include/c++/10/bits/stl_algobase.h:300:5: note:   template argument deduction/substitution failed:
horses.cpp:83:30: note:   deduced conflicting types for parameter 'const _Tp' ('long long int' and 'int')
   83 |   best = max(best, mul * y[i]);
      |                              ^
In file included from /usr/include/c++/10/algorithm:62,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:65,
                 from horses.cpp:2:
/usr/include/c++/10/bits/stl_algo.h:3480:5: note: candidate: 'template<class _Tp> constexpr _Tp std::max(std::initializer_list<_Tp>)'
 3480 |     max(initializer_list<_Tp> __l)
      |     ^~~
/usr/include/c++/10/bits/stl_algo.h:3480:5: note:   template argument deduction/substitution failed:
horses.cpp:83:30: note:   mismatched types 'std::initializer_list<_Tp>' and 'long long int'
   83 |   best = max(best, mul * y[i]);
      |                              ^
In file included from /usr/include/c++/10/algorithm:62,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:65,
                 from horses.cpp:2:
/usr/include/c++/10/bits/stl_algo.h:3486:5: note: candidate: 'template<class _Tp, class _Compare> constexpr _Tp std::max(std::initializer_list<_Tp>, _Compare)'
 3486 |     max(initializer_list<_Tp> __l, _Compare __comp)
      |     ^~~
/usr/include/c++/10/bits/stl_algo.h:3486:5: note:   template argument deduction/substitution failed:
horses.cpp:83:30: note:   mismatched types 'std::initializer_list<_Tp>' and 'long long int'
   83 |   best = max(best, mul * y[i]);
      |                              ^
horses.cpp:85:14: warning: conversion from 'll' {aka 'long long int'} to 'int' may change value [-Wconversion]
   85 |  return best % mod;
      |         ~~~~~^~~~~