oj.uz

Submission #795789

# Submission time Handle Problem Language Result Execution time Memory
795789 2023-07-27T15:02:42 Z Username4132 Horses (IOI15_horses) C++14
17 / 100
 1500 ms 31608 KB 
#include "horses.h"
#include<iostream>
#include<vector>
#include<algorithm>
#include<set>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pli = pair<ll, int>;
#define forn(i, n) for(int i=0; i<(int)n; ++i)
#define forsn(i, s, n) for(int i=s; i<(int)n; ++i)
#define PB push_back
#define F first
#define S second

const int MAXN = 500010, MOD = 1000000007;
int n, arr[MAXN], brr[MAXN];
set<int> ones;

pii query(int l, int r){
	//cerr << l << ' ' << r << endl;
	pii mx={0, -1};
	forsn(i, l, r) mx=max(mx, {brr[i], i});
	return mx;
}

int pro(int r){
	ll ret=1;
	forn(i, r+1) ret=(ret*arr[i])%MOD;
	return (ret*brr[r])%MOD;
}


int solve(){
	ll prod=1;
	vector<int> lis;
	int sz = ones.size(), pos = n-1;

	// tratar el caso empty --> es simplemente calcular el max de todos
	auto itr = ones.end();
	forn(i, sz){
		itr = prev(itr);
		prod*=arr[*itr];
		if(prod>1000000000) break;
		lis.PB(*itr);
	}
	reverse(lis.begin(), lis.end());

	ll p=1;
	pli mx=query(0, n);
	for(int el:lis){
		p*=arr[el];
		pli opt = query(el, n);
		opt.F*=p;
		mx = max(mx, opt);
	}
	return pro(mx.S);
}

int init(int N, int X[], int Y[]) {
	n=N;
	forn(i, n){
		arr[i]=X[i];
		if(arr[i]!=1) ones.insert(i);
	}
	forn(i, n) brr[i]=Y[i];
	return solve();
}

int updateX(int pos, int val) {	
	if(arr[pos]==1 && val!=1) ones.insert(pos);
	if(arr[pos]!=1 && val==1) ones.erase(pos);
	arr[pos]=val;
	return solve();
}

int updateY(int pos, int val) {
	brr[pos]=val;
	return solve();
}

Compilation message

horses.cpp: In function 'int pro(int)':
horses.cpp:30:21: warning: conversion from 'll' {aka 'long long int'} to 'int' may change value [-Wconversion]
   30 |  return (ret*brr[r])%MOD;
      |         ~~~~~~~~~~~~^~~~
horses.cpp: In function 'int solve()':
horses.cpp:37:20: warning: conversion from 'std::set<int>::size_type' {aka 'long unsigned int'} to 'int' may change value [-Wconversion]
   37 |  int sz = ones.size(), pos = n-1;
      |           ~~~~~~~~~^~
horses.cpp:37:24: warning: unused variable 'pos' [-Wunused-variable]
   37 |  int sz = ones.size(), pos = n-1;
      |                        ^~~

Subtask #1
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 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 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 1 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 1 ms 212 KB Output is correct

Subtask #2
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 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 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 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 Incorrect 1 ms 212 KB Output isn't correct
23 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1575 ms 31608 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 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 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 1 ms 212 KB Output is correct
22 Incorrect 0 ms 212 KB Output isn't correct
23 Halted 0 ms 0 KB -

Subtask #5
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 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 212 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 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 Incorrect 1 ms 212 KB Output isn't correct
23 Halted 0 ms 0 KB -