oj.uz

답안 #603797

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
603797 2022-07-24T11:51:52 Z neki 말 (IOI15_horses) C++14
17 / 100
 282 ms 113720 KB 
#include <bits/stdc++.h>
#define ll long long
#define vc vector
 
using namespace std;
const ll mn=500100, mod=1000000007;
 
ll x[mn], y[mn], n;
ll tpro[2 * mn];
ll tmax[2 * mn];
set<ll> act;
ll my[mn];
void updpro(ll pos, ll val){
    for (tpro[pos += mn]=val; pos > 1; pos >>= 1) tpro[pos>>1]=(tpro[pos] * tpro[pos^1])%mod;
}
void updmax(ll pos, ll val){
    for (tmax[pos += mn]=val; pos > 1; pos >>= 1) tmax[pos>>1]=max(tmax[pos], tmax[pos^1]);
}
ll getpro(ll l, ll r){
    ll ret=1;
    for(l+=mn, r+=mn;l<r;l>>=1, r>>=1){
        if(l&1) ret*=tpro[l++];
        if(r&1) ret*=tpro[--r];
        ret%=mod;
    }
    return ret;
}
ll getmax(ll l, ll r){
    ll ret=0;
    for(l+=mn, r+=mn;l<r;l>>=1, r>>=1){
        if(l&1) ret=max(ret, tmax[l++]);
        if(r&1) ret=max(ret, tmax[--r]);
    }
    return ret;
}
void getmy(ll pos){
    ll l=pos, r;
    auto pr=act.upper_bound(pos);
    if(pr==act.end()) r=n;
    else r=(*pr);
    //cout << l <<" " << r << " " << getmax(l, r)<<endl;
    my[pos]=getmax(l, r);
}
 
ll getyear(ll pos){
    //cout << pos << " " << getpro(0, pos+1) <<" " << y[pos]<< endl;
    assert(act.count(pos));
    return (getpro(0, pos+1) * my[pos])%mod;
}
 
ll getans(){
    vc<ll> preglej;
    auto poi = act.end();
    for(ll i=0;i<min((ll)100, (ll)act.size());++i){
        --poi;
        preglej.push_back(*poi);
    }
    reverse(preglej.begin(), preglej.end());
    
    ll best=0, cur=1;
    for(ll i=1;i<preglej.size();++i){
        cur*=x[preglej[i]];
        if(my[preglej[best]]<cur or my[preglej[best]]<cur * my[preglej[i]]) best=i, cur=1;
    }
    
    ll ret=getyear(preglej[best]);
    assert(0<=ret and ret<mod);
    return ret ;
}
 
int updateX(int pos, int val){
    if(x[pos]>1 or pos==0) act.erase(pos);
    x[pos]=val;updpro(pos, val);
    if(x[pos]>1 or pos==0) act.insert(pos);
    
    auto zau = act.upper_bound(pos); --zau;
    getmy(*zau);
    if(zau!=act.begin()){--zau; getmy(*zau);}
    
    return getans();
}
int updateY(int pos, int val){
    y[pos]=val;updmax(pos, val);
    auto poi=act.upper_bound(pos);--poi;
    getmy(*poi);
    
    return getans();
}
 
int init(int N, int X[], int Y[]){
    n=N;for(ll i=0;i<n;++i) x[i]=X[i], y[i]=Y[i];
    for(ll i=0;i<n;++i) updpro(i, X[i]), updmax(i, Y[i]);
    for(ll i=0;i<n;++i) if(x[i]>1 or i==0) act.insert(i);
    for(ll i=0;i<n;++i) if(x[i]>1 or i==0) getmy(i);
    return getans();
}

Compilation message

horses.cpp: In function 'long long int getans()':
horses.cpp:61:17: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   61 |     for(ll i=1;i<preglej.size();++i){
      |                ~^~~~~~~~~~~~~~~
horses.cpp: In function 'int updateX(int, int)':
horses.cpp:80:18: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
   80 |     return getans();
      |            ~~~~~~^~
horses.cpp: In function 'int updateY(int, int)':
horses.cpp:87:18: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
   87 |     return getans();
      |            ~~~~~~^~
horses.cpp: In function 'int init(int, int*, int*)':
horses.cpp:95:18: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
   95 |     return getans();
      |            ~~~~~~^~

Subtask #1
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 448 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 444 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 444 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 1 ms 448 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 444 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 0 ms 340 KB Output is correct

Subtask #2
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 448 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 448 KB Output is correct
5 Correct 0 ms 452 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 448 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 448 KB Output is correct
23 Runtime error 3 ms 852 KB Execution killed with signal 6
24 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 282 ms 113720 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 444 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 448 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 444 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 1 ms 452 KB Output is correct
20 Correct 1 ms 448 KB Output is correct
21 Correct 1 ms 448 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Runtime error 2 ms 840 KB Execution killed with signal 6
24 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 452 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 448 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 0 ms 444 KB Output is correct
21 Correct 1 ms 444 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Runtime error 2 ms 840 KB Execution killed with signal 6
24 Halted 0 ms 0 KB -