oj.uz

답안 #1014045

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1014045 2024-07-04T09:56:36 Z Error404 말 (IOI15_horses) C++17
17 / 100
 90 ms 45452 KB 
#include "bits/stdc++.h"
using namespace std;
#define ll long long
#define f first
#define s second
#define pi pair<ll,ll>
#define vi vector<int>
#define vd vector<double>
#define vpi vector<pi>
#define pb push_back
#define INF 1e18
#define endl '\n'
//#define int ll
#define pii pair<pi,ll>
const int mod = 1e9+7;

vd x, y;
vi ox, oy;
const int MAX = 500000;
int n;
struct dt {
    double sum, pref;
    int mulx,ans;
};

dt t[MAX*4];


dt make_data(int i){
    dt a;
    a.sum = x[i];
    a.mulx = ox[i];
    a.pref = x[i] + y[i];
    a.ans = (ox[i]*oy[i])%mod;
    return a;
}



dt combine(dt a, dt b){
    dt hold;
    hold.sum = a.sum+ b.sum;
    hold.mulx = ((a.mulx % mod) * (b.mulx % mod))%mod;
    if(a.pref > a.sum+b.pref){
        hold.pref = a.pref;
        hold.ans = a.ans;
    }
    else{
        hold.pref = a.sum+ b.pref;
        hold.ans = a.mulx * b.ans; 
    }
    return hold;
} 

void build(int v,int l,int r){
    if(l==r){
        t[v] = make_data(l);
        return;
    }

    int m = (l+r)/2;
    build(v*2,l,m);
    build(v*2+1,m+1,r);
    t[v] = combine(t[v*2],t[v*2+1]);
}


int init(int N, int a[], int b[]){
    n = N;
    x.resize(n+1);
    y.resize(n+1);
    ox.resize(n+1);
    oy.resize(n+1);

    x[0]=0;
    y[0]=0;
    for(int i =1 ; i <= n; i++){
        ox[i] = a[i-1];
        oy[i] = b[i-1];
        x[i] =log10(ox[i]);
        y[i] =  log10(oy[i]);
    }
    build(1,1,n);
    return t[1].ans;
}



void update(int v, int l,int r, int pos){
    if(l==r){
        t[v]= make_data(l);
        return;
    }
    int m = (l+r)/2;
    if(pos<=m) update(v*2,l,m,pos);
    else  update(v*2+1,m+1,r,pos);
    t[v] = combine(t[v*2],t[v*2+1]);
  
}



int updateX(int pos,int val){
    pos ++;
    x[pos] = log10(val);
    ox[pos]= val;
    update(1,1,n,pos);
    return t[1].ans;
}

int updateY(int pos,int val){
    pos++;
    y[pos] = log10(val);
    oy[pos] = val;
    update(1,1,n,pos);
    return t[1].ans;
}

Subtask #1
17.0 / 17.0

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

Subtask #2
0 / 17.0

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

Subtask #3
0 / 20.0

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

Subtask #4
0 / 23.0

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

Subtask #5
0 / 23.0

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