oj.uz

답안 #791177

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
791177 2023-07-23T13:53:04 Z Khizri 말 (IOI15_horses) C++17
37 / 100
 507 ms 52948 KB 
#include "horses.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define F first
#define S second
#define INF 1e18
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define pii pair<int,int>
#define pll pair<ll,ll>
#define OK cout<<"Ok"<<endl;
#define MOD (ll)(1e9+7)
const int mxn=5e5+5;
ll n,idx[mxn],arr[mxn],tree2[mxn*4];
ll tree[4*mxn];
set<int>st;
void build(int node,int l,int r){
    if(l==r){
        tree[node]=idx[l];
        return;
    }
    int m=(l+r)/2;
    build(2*node,l,m);
    build(2*node+1,m+1,r);
    tree[node]=(tree[2*node]*tree[2*node+1])%MOD;
}
void build2(int node,int l,int r){
    if(l==r){
        tree2[node]=arr[l];
        return;
    }
    int m=(l+r)/2;
    build2(2*node,l,m);
    build2(2*node+1,m+1,r);
    tree2[node]=max(tree2[2*node],tree2[2*node+1]);
}
void update(int node,int l,int r,int pos,int val){
    if(l>pos||r<pos) return;
    if(l==r){
        tree[node]=val;
        return;
    }
    int m=(l+r)/2;
    update(2*node,l,m,pos,val);
    update(2*node+1,m+1,r,pos,val);
    tree[node]=(tree[2*node]*tree[2*node+1])%MOD;
}
void update2(int node,int l,int r,int pos,int val){
    if(l>pos||r<pos) return;
    if(l==r){
        tree2[node]=val;
        return;
    }
    int m=(l+r)/2;
    update2(2*node,l,m,pos,val);
    update2(2*node+1,m+1,r,pos,val);
    tree2[node]=max(tree2[2*node],tree2[2*node+1]);
}
ll query(int node,int l,int r,int ql,int qr){
    if(l>qr||r<ql) return 1;
    if(ql<=l&&r<=qr) return tree[node];
    int m=(l+r)/2;
    return (query(2*node,l,m,ql,qr)*query(2*node+1,m+1,r,ql,qr))%MOD;
}
int query2(int node,int l,int r,int ql,int qr){
    if(l>qr||r<ql) return 0;
    if(ql<=l&&r<=qr) return tree2[node];
    int m=(l+r)/2;
    return max(query2(2*node,l,m,ql,qr),query2(2*node+1,m+1,r,ql,qr));
}
int init(int N, int X[], int Y[]) {
	n=N;
	for(int i=0;i<n;i++){
        arr[i+1]=Y[i];
        idx[i+1]=X[i];
        if(idx[i+1]>1){
            st.insert(i+1);
        }
	}
	build(1,1,n);
	build2(1,1,n);
	int k=min(32,(int)st.size());
	auto it=st.end();
	ll res=query2(1,1,n,1,n);
	if(st.size()){
        it=--st.end();
	}
	else{
        return res;
	}
	ll a=1;
	vector<int>vt;
	while(k--){
        int x=*it;
        a=1ll*a*idx[x];
        vt.pb(x);
        if(a>=1e9) break;
        it--;
	}
	unsigned ll ans=1;
	unsigned ll mx=1;
	reverse(all(vt));
	int q=0;
	vt.pb(n+1);
	for(int i=0;i<vt.size()-1;i++){
        ans*=idx[vt[i]];
        int l=vt[i],r=vt[i+1]-1;
        unsigned ll k=ans*query2(1,1,n,l,n);
        if(k>mx){
            mx=k;
            q=i;
        }
	}
	int l=vt[q],r=vt[q+1]-1;
	res=(1ll*query(1,1,n,1,vt[q])*query2(1,1,n,l,n))%MOD;
	return res;
}

int updateX(int pos, int val) {
	pos++;
	if(idx[pos]>1){
        st.erase(pos);
	}
	idx[pos]=val;
	if(idx[pos]>1){
        st.insert(pos);
	}
	update(1,1,n,pos,val);
	int k=min(32,(int)st.size());
	auto it=st.end();
	if(st.size()){
        it=--st.end();
	}
	ll res=query2(1,1,n,1,n);
	ll a=1;
	vector<int>vt;
	while(k--){
        int x=*it;
        a=1ll*a*idx[x];
        vt.pb(x);
        if(a>=1e9) break;
        it--;
	}
	unsigned ll ans=1;
	unsigned ll mx=1;
	reverse(all(vt));
	int q=0;
	vt.pb(n+1);
	for(int i=0;i<vt.size()-1;i++){
        ans*=idx[vt[i]];
        int l=vt[i],r=vt[i+1]-1;
        unsigned ll k=ans*query2(1,1,n,l,n);
        if(k>mx){
            mx=k;
            q=i;
        }
	}
	int l=vt[q],r=vt[q+1]-1;
	res=(1ll*query(1,1,n,1,vt[q])*query2(1,1,n,l,n))%MOD;
	return res;
}

int updateY(int pos, int val) {
	pos++;
	arr[pos]=val;
	update2(1,1,n,pos,val);
	int k=min(32,(int)st.size());
	auto it=st.end();
	if(st.size()){
        it=--st.end();
	}
	ll res=query2(1,1,n,1,n);
	ll a=1;
	vector<int>vt;
	while(k--){
        int x=*it;
        a=1ll*a*idx[x];
        vt.pb(x);
        if(a>=1e9) break;
        it--;
	}
	unsigned ll ans=1;
	unsigned ll mx=1;
	reverse(all(vt));
	int q=0;
	vt.pb(n+1);
	for(int i=0;i<vt.size()-1;i++){
        ans*=idx[vt[i]];
        int l=vt[i],r=vt[i+1]-1;
        unsigned ll k=ans*query2(1,1,n,l,n);
        if(k>mx){
            mx=k;
            q=i;
        }
	}
	int l=vt[q],r=vt[q+1]-1;
	res=(1ll*query(1,1,n,1,vt[q])*query2(1,1,n,l,n))%MOD;
	return res;
}

Compilation message

horses.cpp: In function 'int query2(int, int, int, int, int)':
horses.cpp:69:39: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
   69 |     if(ql<=l&&r<=qr) return tree2[node];
      |                             ~~~~~~~~~~^
horses.cpp: In function 'int init(int, int*, int*)':
horses.cpp:82:12: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
   82 |  build(1,1,n);
      |            ^
horses.cpp:83:13: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
   83 |  build2(1,1,n);
      |             ^
horses.cpp:86:20: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
   86 |  ll res=query2(1,1,n,1,n);
      |                    ^
horses.cpp:86:24: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
   86 |  ll res=query2(1,1,n,1,n);
      |                        ^
horses.cpp:91:16: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
   91 |         return res;
      |                ^~~
horses.cpp:99:12: warning: conversion from 'long long int' to 'double' may change value [-Wconversion]
   99 |         if(a>=1e9) break;
      |            ^
horses.cpp:106:9: warning: conversion from 'long long int' to 'std::vector<int>::value_type' {aka 'int'} may change value [-Wconversion]
  106 |  vt.pb(n+1);
      |        ~^~
horses.cpp:107:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  107 |  for(int i=0;i<vt.size()-1;i++){
      |              ~^~~~~~~~~~~~
horses.cpp:110:21: warning: declaration of 'k' shadows a previous local [-Wshadow]
  110 |         unsigned ll k=ans*query2(1,1,n,l,n);
      |                     ^
horses.cpp:84:6: note: shadowed declaration is here
   84 |  int k=min(32,(int)st.size());
      |      ^
horses.cpp:110:38: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
  110 |         unsigned ll k=ans*query2(1,1,n,l,n);
      |                                      ^
horses.cpp:110:42: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
  110 |         unsigned ll k=ans*query2(1,1,n,l,n);
      |                                          ^
horses.cpp:109:21: warning: unused variable 'r' [-Wunused-variable]
  109 |         int l=vt[i],r=vt[i+1]-1;
      |                     ^
horses.cpp:117:21: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
  117 |  res=(1ll*query(1,1,n,1,vt[q])*query2(1,1,n,l,n))%MOD;
      |                     ^
horses.cpp:117:43: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
  117 |  res=(1ll*query(1,1,n,1,vt[q])*query2(1,1,n,l,n))%MOD;
      |                                           ^
horses.cpp:117:47: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
  117 |  res=(1ll*query(1,1,n,1,vt[q])*query2(1,1,n,l,n))%MOD;
      |                                               ^
horses.cpp:118:9: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
  118 |  return res;
      |         ^~~
horses.cpp:116:14: warning: unused variable 'r' [-Wunused-variable]
  116 |  int l=vt[q],r=vt[q+1]-1;
      |              ^
horses.cpp: In function 'int updateX(int, int)':
horses.cpp:130:13: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
  130 |  update(1,1,n,pos,val);
      |             ^
horses.cpp:136:20: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
  136 |  ll res=query2(1,1,n,1,n);
      |                    ^
horses.cpp:136:24: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
  136 |  ll res=query2(1,1,n,1,n);
      |                        ^
horses.cpp:143:12: warning: conversion from 'long long int' to 'double' may change value [-Wconversion]
  143 |         if(a>=1e9) break;
      |            ^
horses.cpp:150:9: warning: conversion from 'long long int' to 'std::vector<int>::value_type' {aka 'int'} may change value [-Wconversion]
  150 |  vt.pb(n+1);
      |        ~^~
horses.cpp:151:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  151 |  for(int i=0;i<vt.size()-1;i++){
      |              ~^~~~~~~~~~~~
horses.cpp:154:21: warning: declaration of 'k' shadows a previous local [-Wshadow]
  154 |         unsigned ll k=ans*query2(1,1,n,l,n);
      |                     ^
horses.cpp:131:6: note: shadowed declaration is here
  131 |  int k=min(32,(int)st.size());
      |      ^
horses.cpp:154:38: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
  154 |         unsigned ll k=ans*query2(1,1,n,l,n);
      |                                      ^
horses.cpp:154:42: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
  154 |         unsigned ll k=ans*query2(1,1,n,l,n);
      |                                          ^
horses.cpp:153:21: warning: unused variable 'r' [-Wunused-variable]
  153 |         int l=vt[i],r=vt[i+1]-1;
      |                     ^
horses.cpp:161:21: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
  161 |  res=(1ll*query(1,1,n,1,vt[q])*query2(1,1,n,l,n))%MOD;
      |                     ^
horses.cpp:161:43: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
  161 |  res=(1ll*query(1,1,n,1,vt[q])*query2(1,1,n,l,n))%MOD;
      |                                           ^
horses.cpp:161:47: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
  161 |  res=(1ll*query(1,1,n,1,vt[q])*query2(1,1,n,l,n))%MOD;
      |                                               ^
horses.cpp:162:9: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
  162 |  return res;
      |         ^~~
horses.cpp:160:14: warning: unused variable 'r' [-Wunused-variable]
  160 |  int l=vt[q],r=vt[q+1]-1;
      |              ^
horses.cpp: In function 'int updateY(int, int)':
horses.cpp:168:14: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
  168 |  update2(1,1,n,pos,val);
      |              ^
horses.cpp:174:20: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
  174 |  ll res=query2(1,1,n,1,n);
      |                    ^
horses.cpp:174:24: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
  174 |  ll res=query2(1,1,n,1,n);
      |                        ^
horses.cpp:181:12: warning: conversion from 'long long int' to 'double' may change value [-Wconversion]
  181 |         if(a>=1e9) break;
      |            ^
horses.cpp:188:9: warning: conversion from 'long long int' to 'std::vector<int>::value_type' {aka 'int'} may change value [-Wconversion]
  188 |  vt.pb(n+1);
      |        ~^~
horses.cpp:189:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  189 |  for(int i=0;i<vt.size()-1;i++){
      |              ~^~~~~~~~~~~~
horses.cpp:192:21: warning: declaration of 'k' shadows a previous local [-Wshadow]
  192 |         unsigned ll k=ans*query2(1,1,n,l,n);
      |                     ^
horses.cpp:169:6: note: shadowed declaration is here
  169 |  int k=min(32,(int)st.size());
      |      ^
horses.cpp:192:38: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
  192 |         unsigned ll k=ans*query2(1,1,n,l,n);
      |                                      ^
horses.cpp:192:42: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
  192 |         unsigned ll k=ans*query2(1,1,n,l,n);
      |                                          ^
horses.cpp:191:21: warning: unused variable 'r' [-Wunused-variable]
  191 |         int l=vt[i],r=vt[i+1]-1;
      |                     ^
horses.cpp:199:21: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
  199 |  res=(1ll*query(1,1,n,1,vt[q])*query2(1,1,n,l,n))%MOD;
      |                     ^
horses.cpp:199:43: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
  199 |  res=(1ll*query(1,1,n,1,vt[q])*query2(1,1,n,l,n))%MOD;
      |                                           ^
horses.cpp:199:47: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
  199 |  res=(1ll*query(1,1,n,1,vt[q])*query2(1,1,n,l,n))%MOD;
      |                                               ^
horses.cpp:200:9: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
  200 |  return res;
      |         ^~~
horses.cpp:198:14: warning: unused variable 'r' [-Wunused-variable]
  198 |  int l=vt[q],r=vt[q+1]-1;
      |              ^

Subtask #1
17.0 / 17.0

# 결과 실행 시간 메모리 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 340 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 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 312 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 312 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct

Subtask #2
0 / 17.0

# 결과 실행 시간 메모리 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 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 304 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 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 Correct 0 ms 212 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 468 KB Output is correct
26 Correct 1 ms 468 KB Output is correct
27 Incorrect 3 ms 340 KB Output isn't correct
28 Halted 0 ms 0 KB -

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 507 ms 52944 KB Output is correct
2 Correct 271 ms 52848 KB Output is correct
3 Correct 277 ms 52948 KB Output is correct
4 Correct 360 ms 52944 KB Output is correct

Subtask #4
0 / 23.0

# 결과 실행 시간 메모리 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 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 308 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 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 308 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 1 ms 304 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 2 ms 468 KB Output is correct
26 Correct 1 ms 444 KB Output is correct
27 Incorrect 3 ms 340 KB Output isn't correct
28 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 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 1 ms 212 KB Output is correct
7 Correct 1 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 308 KB Output is correct
15 Correct 1 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 312 KB Output is correct
20 Correct 0 ms 308 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 416 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 2 ms 468 KB Output is correct
26 Correct 1 ms 468 KB Output is correct
27 Incorrect 2 ms 340 KB Output isn't correct
28 Halted 0 ms 0 KB -