oj.uz

Submission #955697

# Submission time Handle Problem Language Result Execution time Memory
955697 2024-03-31T10:36:49 Z emad234 Horses (IOI15_horses) C++17
54 / 100
 1500 ms 63172 KB 
#include "horses.h"
#include <bits/stdc++.h>
#define ll long long
#define F first
#define S second
#define pii pair<ll, ll>
const ll mod = 1e9 + 7;
const ll mxN = 5e5 + 5;
using namespace std;
ll NN;
struct tree
{
	vector<pii> seg;
	ll s, e;
	void init(ll n)
	{
		NN = exp2(ceil(log2(n)));
		seg.resize(NN * 4);
	}
	ll queryMax(ll l = 1, ll r = NN, ll ind = 1)
	{
		if (l > e || r < s)
			return 0;
		if (l >= s && r <= e)
			return seg[ind].F;
		ll md = (l + r) / 2;
		return max(queryMax(l, md, ind * 2), queryMax(md + 1, r, ind * 2 + 1));
	}
	ll queryProd(ll l = 1, ll r = NN, ll ind = 1)
	{
		if (l > e || r < s)
			return 1;
		if (l >= s && r <= e)
			return seg[ind].S;
		ll md = (l + r) / 2;
		return (queryProd(l, md, ind * 2) * queryProd(md + 1, r, ind * 2 + 1)) % mod;
	}
	void update(pii val, ll ind)
	{
		ind += NN;
		seg[ind] = val;
		while (ind /= 2)
		{
			seg[ind].F = max(seg[ind * 2].F, seg[ind * 2 + 1].F);
			seg[ind].S = (seg[ind * 2].S * seg[ind * 2 + 1].S) % mod;
		}
	}
} seg;
struct ones
{
	ll l, r;
	friend bool operator<(ones a, ones b)
	{
		return a.l < b.l;
	}
};
set<ones> s;
ll st[mxN],ed[mxN];
ll x[mxN], y[mxN];
ll vals[mxN];
ll n;
ll solve()
{
	ll id = 0;
	int i = n - 1;
	while (i > 0 && id <= 70)
	{
		if (x[i] == 1)
		{
			i = st[i];
			id--;
		}
		i--;
		id++;
	}
	if(i == -1) i = 0;
	ll mx = -1, mxid = -1;
	ll prd = 1;
	for (i; i < n; i++)
	{
		if (x[i] == -1)
		{
			seg.s = i + 1, seg.e = ed[i] + 1;
			if (vals[i] * prd > mx)
			{
				mx = vals[i];
				mxid = i;
				prd = 1;
			}
			i = ed[i];
			continue;
		}
		if (prd * x[i] > mx)
		{
			mx = y[i];
			mxid = i;
			prd = 1;
			continue;
		}
		prd *= x[i];
		if (prd * y[i] > mx)
		{
			mx = y[i];
			mxid = i;
			prd = 1;
			continue;
		}
	}
	seg.s = 1;
	seg.e = mxid + 1;
	return (mx * seg.queryProd()) % mod;
}
int init(int N, int X[], int Y[])
{
	seg.init(N);
	n = N;
	for (ll i = 0; i < N; i++)
	{
		y[i] = Y[i];
		x[i] = X[i];
		seg.update({Y[i], X[i]}, i);
	}
	ll l = -1, r = -1;
	for (ll i = 0; i < N; i++)
	{
		if (X[i] == 1)
		{
			if (l == -1)
				l = i;
			r = i;
		}
		else
		{
			if (l != -1)
			{
				s.insert({l, r});
				l = r = -1;
			}
		}
	}
	if (l != -1)
	{
		s.insert({l, r});
		l = r = -1;
	}
	return solve();
}

int updateX(int pos, int val)
{
	if (x[pos] != 1 && val == 1)
	{
		auto it = s.upper_bound({pos, pos});
		ll l = pos, r = pos;
		if (it != s.end() && (*it).l == pos + 1)
		{
			l = pos, r = (*it).r;
			s.erase(it);
		}
		s.insert({l, r});
		it = s.lower_bound({pos, pos});
		auto p = s.lower_bound({l, r});
		if (it != s.begin())
		{
			it--;
			if ((*it).r == l - 1)
			{
				l = (*it).l;
				s.erase(it);
				s.erase(s.lower_bound({pos, pos}));
				s.insert({l, r});
			}
		}
		st[r] = l;
		ed[l] = r;
		seg.s = l + 1,seg.e = r + 1;
		vals[l] = seg.queryMax();
	}
	if (x[pos] == 1 && val != 1)
	{
		auto it = s.upper_bound({pos, 0});
		it--;
		ll l = (*it).l, r = pos - 1, l1 = pos + 1, r1 = (*it).r;
		s.erase(it);
		if (l <= r){
			s.insert({l, r});
			st[r] = l;
			ed[l] = r;
			seg.s = l + 1, seg.e = r + 1;
			vals[l] = seg.queryMax();
		}
		if (l1 <= r1){
			s.insert({l1, r1});
			st[r1] = l1;
			ed[l1] = r1;
			seg.s = l1 + 1, seg.e = r1 + 1;
			vals[l1] = seg.queryMax();
		}
	}
	x[pos] = val;
	seg.update({y[pos], x[pos]}, pos);
	return solve();
}

int updateY(int pos, int val)
{
	y[pos] = val;
	seg.update({y[pos], x[pos]}, pos);
	return solve();
}

Compilation message

horses.cpp: In member function 'void tree::init(long long int)':
horses.cpp:17:12: warning: conversion from 'double' to 'long long int' may change value [-Wfloat-conversion]
   17 |   NN = exp2(ceil(log2(n)));
      |        ~~~~^~~~~~~~~~~~~~~
horses.cpp: In function 'long long int solve()':
horses.cpp:65:12: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
   65 |  int i = n - 1;
      |          ~~^~~
horses.cpp:70:12: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
   70 |    i = st[i];
      |        ~~~~^
horses.cpp:79:7: warning: statement has no effect [-Wunused-value]
   79 |  for (i; i < n; i++)
      |       ^
horses.cpp:90:12: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
   90 |    i = ed[i];
      |        ~~~~^
horses.cpp: In function 'int init(int, int*, int*)':
horses.cpp:146:14: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
  146 |  return solve();
      |         ~~~~~^~
horses.cpp: In function 'int updateX(int, int)':
horses.cpp:162:8: warning: variable 'p' set but not used [-Wunused-but-set-variable]
  162 |   auto p = s.lower_bound({l, r});
      |        ^
horses.cpp:202:14: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
  202 |  return solve();
      |         ~~~~~^~
horses.cpp: In function 'int updateY(int, int)':
horses.cpp:209:14: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
  209 |  return solve();
      |         ~~~~~^~

Subtask #1
17.0 / 17.0

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

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4696 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 1 ms 4440 KB Output is correct
13 Correct 1 ms 4444 KB Output is correct
14 Correct 1 ms 4444 KB Output is correct
15 Correct 1 ms 4444 KB Output is correct
16 Correct 1 ms 4444 KB Output is correct
17 Correct 1 ms 4444 KB Output is correct
18 Correct 1 ms 4444 KB Output is correct
19 Correct 1 ms 4444 KB Output is correct
20 Correct 1 ms 4444 KB Output is correct
21 Correct 1 ms 6492 KB Output is correct
22 Correct 2 ms 8636 KB Output is correct
23 Correct 3 ms 6492 KB Output is correct
24 Correct 2 ms 8540 KB Output is correct
25 Correct 2 ms 8540 KB Output is correct
26 Correct 2 ms 8540 KB Output is correct
27 Correct 2 ms 6492 KB Output is correct
28 Correct 3 ms 4444 KB Output is correct
29 Correct 3 ms 6492 KB Output is correct
30 Correct 2 ms 8540 KB Output is correct
31 Correct 3 ms 6492 KB Output is correct
32 Correct 3 ms 6492 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 120 ms 48204 KB Output is correct
2 Correct 172 ms 48208 KB Output is correct
3 Correct 125 ms 48204 KB Output is correct
4 Correct 142 ms 48208 KB Output is correct

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4440 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 1 ms 4444 KB Output is correct
13 Correct 1 ms 4444 KB Output is correct
14 Correct 1 ms 4444 KB Output is correct
15 Correct 1 ms 4440 KB Output is correct
16 Correct 1 ms 4444 KB Output is correct
17 Correct 1 ms 4444 KB Output is correct
18 Correct 1 ms 4444 KB Output is correct
19 Correct 1 ms 4444 KB Output is correct
20 Correct 1 ms 4444 KB Output is correct
21 Correct 1 ms 6580 KB Output is correct
22 Correct 2 ms 8540 KB Output is correct
23 Correct 3 ms 6492 KB Output is correct
24 Correct 2 ms 8540 KB Output is correct
25 Correct 2 ms 8540 KB Output is correct
26 Correct 2 ms 8540 KB Output is correct
27 Correct 2 ms 6492 KB Output is correct
28 Correct 3 ms 4440 KB Output is correct
29 Correct 3 ms 6492 KB Output is correct
30 Correct 2 ms 8540 KB Output is correct
31 Correct 3 ms 6492 KB Output is correct
32 Correct 3 ms 6488 KB Output is correct
33 Correct 861 ms 56840 KB Output is correct
34 Correct 82 ms 56772 KB Output is correct
35 Correct 101 ms 49492 KB Output is correct
36 Correct 101 ms 49484 KB Output is correct
37 Correct 616 ms 56720 KB Output is correct
38 Execution timed out 1543 ms 63100 KB Time limit exceeded
39 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 1 ms 4440 KB Output is correct
13 Correct 1 ms 4444 KB Output is correct
14 Correct 1 ms 4444 KB Output is correct
15 Correct 1 ms 4444 KB Output is correct
16 Correct 1 ms 4444 KB Output is correct
17 Correct 1 ms 4444 KB Output is correct
18 Correct 1 ms 4444 KB Output is correct
19 Correct 1 ms 4444 KB Output is correct
20 Correct 1 ms 4444 KB Output is correct
21 Correct 1 ms 6492 KB Output is correct
22 Correct 1 ms 8540 KB Output is correct
23 Correct 2 ms 6708 KB Output is correct
24 Correct 2 ms 8540 KB Output is correct
25 Correct 2 ms 8540 KB Output is correct
26 Correct 2 ms 8540 KB Output is correct
27 Correct 2 ms 6492 KB Output is correct
28 Correct 3 ms 4444 KB Output is correct
29 Correct 3 ms 6492 KB Output is correct
30 Correct 2 ms 8540 KB Output is correct
31 Correct 3 ms 6492 KB Output is correct
32 Correct 3 ms 6680 KB Output is correct
33 Correct 117 ms 48208 KB Output is correct
34 Correct 155 ms 48304 KB Output is correct
35 Correct 125 ms 48216 KB Output is correct
36 Correct 143 ms 48208 KB Output is correct
37 Correct 874 ms 56916 KB Output is correct
38 Correct 87 ms 56660 KB Output is correct
39 Correct 108 ms 49740 KB Output is correct
40 Correct 100 ms 49488 KB Output is correct
41 Correct 622 ms 57164 KB Output is correct
42 Execution timed out 1564 ms 63172 KB Time limit exceeded
43 Halted 0 ms 0 KB -