oj.uz

답안 #590057

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
590057 2022-07-05T13:51:04 Z alirezasamimi100 말 (IOI15_horses) C++17
17 / 100
 648 ms 46748 KB 
#include "horses.h"
#include <bits/stdc++.h>
#define lc v<<1
#define rc v<<1|1
using ll = long long int;
using namespace std;
const int MOD = 1000000007, MN = 5e5 + 10;

ll pow(ll x, ll y, ll mod){
    ll ans=1;
    while (y != 0) {
        if (y & 1) ans = ans * x % mod;
        y >>= 1;
        x = x * x % mod;
    }
    return ans;
}

ll f[MN*4],g[MN],RX[MN];
int n;
set<int> st;

void update(int v, int l, int r, int p, ll x){
    if(r-l==1){
        f[v]=x;
        return;
    }
    int m=(l+r)>>1;
    if(p<m) update(lc,l,m,p,x);
    else update(rc,m,r,p,x);
    f[v]=max(f[lc],f[rc]);
}

ll get(int v, int l, int r, int tl, int tr){
    if(l>=tr || tl>=r || tl>=tr) return 0;
    if(l>=tl && r<=tr) return f[v];
    int m=(l+r)>>1;
    return max(get(lc,l,m,tl,tr),get(rc,m,r,tl,tr));
}

void upd(int t, ll x){
    for(t+=5; t<MN; t+=t&-t) g[t]=g[t]*x%MOD;
}

ll gt(int t, ll x=1){
    for(t+=5; t; t-=t&-t) x=x*g[t]%MOD;
    return x;
}

int init(int N, int X[], int Y[]) {
    n=N;
    st.clear();
    for(ll i=0; i<MN; i++) g[i]=1;
    for(int i=0; i<N; i++){
        update(1,0,n,i,Y[i]);
        upd(i,X[i]);
        RX[i]=X[i];
        if(X[i]>1) st.insert(-i);
    }
    ll ans=0,k=-1;
    for(int t : st){
        if(ans>(ll)1e9) break;
        t=-t;
        k=t;
        ans=max(ans,get(1,0,n,t,n));
        ans*=RX[t];
    }
    ans=ans%MOD*gt(k-1)%MOD;
    return max(ans,f[1]);
}

int updateX(int pos, int val) {
    ll x=pow(RX[pos],MOD-2,MOD)*val%MOD;
    upd(pos,x);
    RX[pos]=val;
    if(val>1) st.insert(-pos);
    else st.erase(-pos);
    ll ans=0,k=-1;
    for(int t : st){
        if(ans>(ll)1e9) break;
        t=-t;
        k=t;
        ans=max(ans,get(1,0,n,t,n));
        ans*=RX[t];
    }
    ans=ans%MOD*gt(k-1)%MOD;
    return max(ans,f[1]);
}

int updateY(int pos, int val) {
    update(1,0,n,pos,val);
    ll ans=0,k=-1;
    for(int t : st){
        if(ans>(ll)1e9) break;
        t=-t;
        k=t;
        ans=max(ans,get(1,0,n,t,n));
        ans*=RX[t];
    }
    ans=ans%MOD*gt(k-1)%MOD;
    return max(ans,f[1]);
}

Compilation message

horses.cpp: In function 'int init(int, int*, int*)':
horses.cpp:68:21: warning: conversion from 'll' {aka 'long long int'} to 'int' may change value [-Wconversion]
   68 |     ans=ans%MOD*gt(k-1)%MOD;
      |                    ~^~
horses.cpp:69:15: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
   69 |     return max(ans,f[1]);
      |            ~~~^~~~~~~~~~
horses.cpp: In function 'int updateX(int, int)':
horses.cpp:86:21: warning: conversion from 'll' {aka 'long long int'} to 'int' may change value [-Wconversion]
   86 |     ans=ans%MOD*gt(k-1)%MOD;
      |                    ~^~
horses.cpp:87:15: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
   87 |     return max(ans,f[1]);
      |            ~~~^~~~~~~~~~
horses.cpp: In function 'int updateY(int, int)':
horses.cpp:100:21: warning: conversion from 'll' {aka 'long long int'} to 'int' may change value [-Wconversion]
  100 |     ans=ans%MOD*gt(k-1)%MOD;
      |                    ~^~
horses.cpp:101:15: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
  101 |     return max(ans,f[1]);
      |            ~~~^~~~~~~~~~

Subtask #1
17.0 / 17.0

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

Subtask #2
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4148 KB Output is correct
2 Correct 2 ms 4180 KB Output is correct
3 Correct 3 ms 4180 KB Output is correct
4 Correct 2 ms 4180 KB Output is correct
5 Correct 3 ms 4180 KB Output is correct
6 Correct 2 ms 4180 KB Output is correct
7 Correct 3 ms 4180 KB Output is correct
8 Correct 3 ms 4180 KB Output is correct
9 Correct 2 ms 4180 KB Output is correct
10 Correct 3 ms 4184 KB Output is correct
11 Correct 3 ms 4156 KB Output is correct
12 Correct 3 ms 4180 KB Output is correct
13 Correct 3 ms 4180 KB Output is correct
14 Correct 2 ms 4152 KB Output is correct
15 Correct 2 ms 4148 KB Output is correct
16 Correct 2 ms 4128 KB Output is correct
17 Correct 2 ms 4180 KB Output is correct
18 Correct 2 ms 4180 KB Output is correct
19 Correct 3 ms 4180 KB Output is correct
20 Correct 3 ms 4152 KB Output is correct
21 Incorrect 2 ms 4180 KB Output isn't correct
22 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 648 ms 46748 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4180 KB Output is correct
2 Correct 3 ms 4180 KB Output is correct
3 Correct 3 ms 4180 KB Output is correct
4 Correct 3 ms 4208 KB Output is correct
5 Correct 2 ms 4180 KB Output is correct
6 Correct 2 ms 4152 KB Output is correct
7 Correct 2 ms 4180 KB Output is correct
8 Correct 2 ms 4148 KB Output is correct
9 Correct 3 ms 4180 KB Output is correct
10 Correct 2 ms 4180 KB Output is correct
11 Correct 2 ms 4180 KB Output is correct
12 Correct 3 ms 4148 KB Output is correct
13 Correct 3 ms 4180 KB Output is correct
14 Correct 3 ms 4180 KB Output is correct
15 Correct 2 ms 4180 KB Output is correct
16 Correct 2 ms 4180 KB Output is correct
17 Correct 2 ms 4180 KB Output is correct
18 Correct 2 ms 4148 KB Output is correct
19 Correct 2 ms 4180 KB Output is correct
20 Correct 2 ms 4180 KB Output is correct
21 Incorrect 2 ms 4180 KB Output isn't correct
22 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4156 KB Output is correct
2 Correct 3 ms 4180 KB Output is correct
3 Correct 2 ms 4152 KB Output is correct
4 Correct 2 ms 4152 KB Output is correct
5 Correct 2 ms 4180 KB Output is correct
6 Correct 3 ms 4148 KB Output is correct
7 Correct 2 ms 4152 KB Output is correct
8 Correct 2 ms 4180 KB Output is correct
9 Correct 2 ms 4180 KB Output is correct
10 Correct 2 ms 4180 KB Output is correct
11 Correct 4 ms 4180 KB Output is correct
12 Correct 3 ms 4156 KB Output is correct
13 Correct 3 ms 4180 KB Output is correct
14 Correct 2 ms 4152 KB Output is correct
15 Correct 3 ms 4180 KB Output is correct
16 Correct 2 ms 4152 KB Output is correct
17 Correct 2 ms 4180 KB Output is correct
18 Correct 2 ms 4180 KB Output is correct
19 Correct 2 ms 4180 KB Output is correct
20 Correct 3 ms 4180 KB Output is correct
21 Incorrect 3 ms 4180 KB Output isn't correct
22 Halted 0 ms 0 KB -