| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 923036 |
2024-02-06T13:10:00 Z |
oblantis |
Horses (IOI15_horses) |
C++17 |
|
435 ms |
524288 KB |
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#pragma GCC optimize("O3,unroll-loops")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define all(v) v.begin(), v.end()
#define pb push_back
#define ss second
#define ff first
#define vt vector
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef pair<int, int> pii;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
const ll inf = 3e9;
const int mod = 1e9+7;
const int maxn = 5e5 + 1;
//#include "horses.h"
ll t[maxn * 4], it, xl;
static int n;
ll a[maxn], b[maxn], mx[maxn * 4];
set<int> s;
void upd(int v, int l, int r){
if(l + 1 == r){
t[v] = a[l];
mx[v] = b[l];
return;
}
if((l + r) / 2 <= it)upd(v * 2 + 2, (l + r) / 2, r);
else upd(v * 2 + 1, l, (l + r) / 2);
t[v] = t[v * 2 + 1] * t[v * 2 + 2] % mod;
mx[v] = max(mx[v * 2 + 1], mx[v * 2 + 2]);
}
ll gm(int v, int l, int r){
if(xl <= l)return mx[v];
if(r <= xl)return 0;
return max(gm(v * 2 + 1, l, (l + r) / 2), gm(v * 2 + 2, (l + r) / 2, r));
}
ll mlp(int v, int l, int r){
if(r <= xl + 1)return t[v];
if(xl < l) return 1;
return 1ll * mlp(v * 2 + 1, l, (l + r) / 2) * mlp(v * 2 + 2, (l + r) / 2, r) % mod;
}
int get(){
xl = 0;
ll ans = gm(0, 0, n), p = 1, k = 1;
if(s.empty()){
return ans;
}
auto i = --s.end();
while(1){
xl = *i;
ll nx = gm(0, 0, n);
if(p * k <= nx){
ans = 1ll * nx * mlp(0, 0, n) % mod;
k = nx;
}
p *= a[xl];
if(p * k > inf)break;
if(i == s.begin())break;
--i;
}
xl = 0;
ll nx = gm(0, 0, n);
if(p * k <= nx)ans = nx;
return ans;
}
int init(int n, int x[], int y[]) {
for(int i = 0; i < n; i++){
a[i] = x[i], b[i] = y[i];
it = i;
upd(0, 0, n);
if(a[i] != 1)s.insert(i);
}
return get();
}
int updateX(int pos, int val) {
if(a[pos] == val)return get();
if(a[pos] == 1)s.insert(pos);
else if(val == 1)s.erase(pos);
it = pos;
a[it] = val;
upd(0, 0, n);
return get();
}
int updateY(int pos, int val) {
it = pos;
b[it] = val;
upd(0, 0, n);
return get();
}
//int main() {
//int N;
//cin >> N;
//int *X = (int*)malloc(sizeof(int)*(unsigned int)N);
//int *Y = (int*)malloc(sizeof(int)*(unsigned int)N);
//for (int i = 0; i < N; i++) {
//cin >> X[i];
//}
//for (int i = 0; i < N; i++) {
//cin >> Y[i];
//}
//init(N, X, Y);
//int M;
//cin >> M;
//for (int i = 0; i < M; i++) {
//int type; cin >> type;
//int pos; cin >> pos;
//int val; cin >> val;
//if (type == 1) {
//cout << updateX(pos,val) << '\n';
//} else if (type == 2) {
//cout << updateY(pos,val) << '\n';
//}
//}
//return 0;
//}
Compilation message
horses.cpp: In function 'int get()':
horses.cpp:49:10: warning: conversion from 'll' {aka 'long long int'} to 'int' may change value [-Wconversion]
49 | return ans;
| ^~~
horses.cpp:67:9: warning: conversion from 'll' {aka 'long long int'} to 'int' may change value [-Wconversion]
67 | return ans;
| ^~~
horses.cpp: In function 'int init(int, int*, int*)':
horses.cpp:69:14: warning: declaration of 'n' shadows a global declaration [-Wshadow]
69 | int init(int n, int x[], int y[]) {
| ~~~~^
horses.cpp:21:12: note: shadowed declaration is here
21 | static int n;
| ^
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
8540 KB |
Output is correct |
| 2 |
Incorrect |
3 ms |
8540 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
8540 KB |
Output is correct |
| 2 |
Incorrect |
1 ms |
8540 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
435 ms |
524288 KB |
Execution killed with signal 9 |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
8536 KB |
Output is correct |
| 2 |
Incorrect |
2 ms |
8540 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
8540 KB |
Output is correct |
| 2 |
Incorrect |
1 ms |
8540 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
