oj.uz

Submission #758411

# Submission time Handle Problem Language Result Execution time Memory
758411 2023-06-14T15:14:14 Z joelgun14 Horses (IOI15_horses) C++17
17 / 100
 607 ms 44852 KB 
#include "horses.h"
#include <bits/stdc++.h>
#define ll long long
using namespace std;
const int lim = 1 << 19;
int mod = 1e9 + 7;
struct max_segment_tree {
	int a[2 * lim];
	max_segment_tree() {
		memset(a, 0, sizeof(a));
	}
	void update(int idx, int val) {
		idx += lim;
		a[idx] = val;
		while(idx) {
			idx >>= 1;
			a[idx] = max(a[2 * idx], a[2 * idx + 1]);
		}
	}
	int query(int nd, int cl, int cr, int l, int r) {
		if(cl >= l && cr <= r) 
			return a[nd];
		else if(cl > r || cr < l)
			return 0;
		else {
			int mid = (cl + cr) / 2;
			return max(query(2 * nd, cl, mid, l, r), query(2 * nd + 1, mid + 1, cr, l, r));
		}
	}
};
struct mul_segment_tree {
	int a[2 * lim];
	mul_segment_tree() {
		fill(a, a + 2 * lim, 1);
	}
	void update(int idx, int val) {
		idx += lim;
		a[idx] = val;
		while(idx) {
			idx >>= 1;
			a[idx] = (1ll * a[2 * idx] * a[2 * idx + 1]) % mod;
		}
	}
	int query(int nd, int cl, int cr, int l, int r) {
		if(cl >= l && cr <= r) {
			return a[nd];
		}
		else if(cl > r || cr < l)
			return 1;
		else {
			int mid = (cl + cr) / 2;
			return (1ll * query(2 * nd, cl, mid, l, r) * query(2 * nd + 1, mid + 1, cr, l, r)) % mod;
		}
	}
};
max_segment_tree mxx, mxy;
mul_segment_tree valx;
set<int> nz;
vector<int> x, y;
int n;
int recalc() {
	vector<int> v;
	if(nz.empty()) {
		return mxy.query(1, 0, lim - 1, 0, n - 1);
	}
	auto it = --nz.end();
	ll prmul = 1;
	while(true) {
		v.push_back(*it);
		prmul *= x[v.back()];
		if(prmul >= 1e9)
			break;
		if(it == nz.begin())
			break;
		--it;
	}
	// jadi sekarang isinya v itu indices tp inverted
	reverse(v.begin(), v.end());
	prmul = 1;
	ll res = mxy.query(1, 0, lim - 1, 0, v.front() - 1);
	for(int i = 0; i < v.size(); ++i) {
		prmul = (1ll * prmul * x[v[i]]);
		//cout << i << " " << prmul << " " << mxy.query(1, 0, lim - 1, v[i], (i == v.size() - 1 ? n - 1 : v[i + 1] - 1)) << endl;
		// nanti di sini kita "upgrade" ke next nya
		res = max(res, prmul * mxy.query(1, 0, lim - 1, v[i], (i == v.size() - 1 ? n - 1 : v[i + 1] - 1)));
	}
	return res % mod;
}
int init(int N, int X[], int Y[]) {
	x.resize(N), y.resize(N);
	n = N;
	for(int i = 0; i < N; ++i) {
		mxx.update(i, X[i]), mxy.update(i, Y[i]);
		valx.update(i, X[i]);
		x[i] = X[i];
		y[i] = Y[i];
		if(X[i] != 1)
			nz.insert(i);
	}
	// simpan index yg bukan 1
	// nanti di iterate dr belakang isinya
	// simpan iterator current last element?
	// pakai lower_bound aja, terus dikurangin terus iteratornya
	// maximum per operasi update cmn log (karena sekali panggil lower_bound, sisanya -- O(1))
	return recalc();
}
int updateX(int pos, int val) {	
	// nanti re calculate ulang nilainya :))
	// cmn count lastzero sampe nilai nya > int_mx aja :D
	x[pos] = val;
	int tmp = mxx.query(1, 0, lim - 1, pos, pos);
	if(tmp != 1)
		nz.erase(nz.lower_bound(pos));
	mxx.update(pos, val);
	valx.update(pos, val);
	if(val != 1)
		nz.insert(pos);
	return recalc();
}

int updateY(int pos, int val) {
	y[pos] = val;
	mxy.update(pos, val);
	return recalc();
}

Compilation message

horses.cpp: In member function 'void mul_segment_tree::update(int, int)':
horses.cpp:41:49: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
   41 |    a[idx] = (1ll * a[2 * idx] * a[2 * idx + 1]) % mod;
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
horses.cpp: In member function 'int mul_segment_tree::query(int, int, int, int, int)':
horses.cpp:52:87: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
   52 |    return (1ll * query(2 * nd, cl, mid, l, r) * query(2 * nd + 1, mid + 1, cr, l, r)) % mod;
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
horses.cpp: In function 'int recalc()':
horses.cpp:71:6: warning: conversion from 'long long int' to 'double' may change value [-Wconversion]
   71 |   if(prmul >= 1e9)
      |      ^~~~~
horses.cpp:81:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   81 |  for(int i = 0; i < v.size(); ++i) {
      |                 ~~^~~~~~~~~~
horses.cpp:85:60: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   85 |   res = max(res, prmul * mxy.query(1, 0, lim - 1, v[i], (i == v.size() - 1 ? n - 1 : v[i + 1] - 1)));
      |                                                          ~~^~~~~~~~~~~~~~~
horses.cpp:87:13: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
   87 |  return res % mod;
      |         ~~~~^~~~~

Subtask #1
17.0 / 17.0

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

Subtask #2
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 12628 KB Output is correct
2 Correct 6 ms 12500 KB Output is correct
3 Correct 7 ms 12516 KB Output is correct
4 Correct 6 ms 12564 KB Output is correct
5 Correct 5 ms 12500 KB Output is correct
6 Correct 6 ms 12500 KB Output is correct
7 Correct 6 ms 12500 KB Output is correct
8 Correct 8 ms 12500 KB Output is correct
9 Correct 6 ms 12500 KB Output is correct
10 Correct 8 ms 12500 KB Output is correct
11 Correct 6 ms 12500 KB Output is correct
12 Correct 6 ms 12504 KB Output is correct
13 Correct 6 ms 12500 KB Output is correct
14 Correct 6 ms 12500 KB Output is correct
15 Correct 6 ms 12500 KB Output is correct
16 Correct 6 ms 12500 KB Output is correct
17 Correct 6 ms 12592 KB Output is correct
18 Correct 6 ms 12500 KB Output is correct
19 Correct 6 ms 12500 KB Output is correct
20 Correct 6 ms 12500 KB Output is correct
21 Incorrect 6 ms 12500 KB Output isn't correct
22 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 607 ms 44852 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 12500 KB Output is correct
2 Correct 6 ms 12540 KB Output is correct
3 Correct 6 ms 12576 KB Output is correct
4 Correct 7 ms 12616 KB Output is correct
5 Correct 7 ms 12500 KB Output is correct
6 Correct 7 ms 12500 KB Output is correct
7 Correct 9 ms 12500 KB Output is correct
8 Correct 8 ms 12552 KB Output is correct
9 Correct 8 ms 12540 KB Output is correct
10 Correct 6 ms 12500 KB Output is correct
11 Correct 6 ms 12500 KB Output is correct
12 Correct 6 ms 12500 KB Output is correct
13 Correct 6 ms 12572 KB Output is correct
14 Correct 6 ms 12500 KB Output is correct
15 Correct 7 ms 12500 KB Output is correct
16 Correct 6 ms 12500 KB Output is correct
17 Correct 8 ms 12552 KB Output is correct
18 Correct 6 ms 12500 KB Output is correct
19 Correct 6 ms 12500 KB Output is correct
20 Correct 8 ms 12500 KB Output is correct
21 Incorrect 6 ms 12500 KB Output isn't correct
22 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 12500 KB Output is correct
2 Correct 6 ms 12500 KB Output is correct
3 Correct 6 ms 12500 KB Output is correct
4 Correct 6 ms 12500 KB Output is correct
5 Correct 7 ms 12512 KB Output is correct
6 Correct 6 ms 12500 KB Output is correct
7 Correct 6 ms 12500 KB Output is correct
8 Correct 6 ms 12492 KB Output is correct
9 Correct 6 ms 12500 KB Output is correct
10 Correct 7 ms 12500 KB Output is correct
11 Correct 6 ms 12512 KB Output is correct
12 Correct 7 ms 12588 KB Output is correct
13 Correct 8 ms 12500 KB Output is correct
14 Correct 6 ms 12500 KB Output is correct
15 Correct 7 ms 12500 KB Output is correct
16 Correct 6 ms 12500 KB Output is correct
17 Correct 6 ms 12500 KB Output is correct
18 Correct 6 ms 12544 KB Output is correct
19 Correct 6 ms 12500 KB Output is correct
20 Correct 6 ms 12500 KB Output is correct
21 Incorrect 6 ms 12516 KB Output isn't correct
22 Halted 0 ms 0 KB -