oj.uz

답안 #1014053

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1014053 2024-07-04T10:06:31 Z Error404 말 (IOI15_horses) C++17
100 / 100
 138 ms 60568 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<ll>
#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;
    ll mulx;
  ll 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)%mod; 
    }
    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]);
}


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 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;
}


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;
}

Compilation message

horses.cpp: In function 'int init(int, int*, int*)':
horses.cpp:98:17: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
   98 |     return t[1].ans;
      |            ~~~~~^~~
horses.cpp: In function 'int updateX(int, int)':
horses.cpp:107:17: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
  107 |     return t[1].ans;
      |            ~~~~~^~~
horses.cpp: In function 'int updateY(int, int)':
horses.cpp:115:17: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
  115 |     return t[1].ans;
      |            ~~~~~^~~

Subtask #1
17.0 / 17.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 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 1 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 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

Subtask #2
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 344 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 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 344 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 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 476 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 452 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 0 ms 456 KB Output is correct
32 Correct 1 ms 348 KB Output is correct

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 72 ms 53840 KB Output is correct
2 Correct 138 ms 60568 KB Output is correct
3 Correct 101 ms 55860 KB Output is correct
4 Correct 112 ms 57748 KB Output is correct

Subtask #4
23.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 1 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 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 344 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 0 ms 596 KB Output is correct
32 Correct 1 ms 456 KB Output is correct
33 Correct 54 ms 55168 KB Output is correct
34 Correct 58 ms 55044 KB Output is correct
35 Correct 79 ms 58676 KB Output is correct
36 Correct 78 ms 58360 KB Output is correct
37 Correct 53 ms 54196 KB Output is correct
38 Correct 56 ms 54564 KB Output is correct
39 Correct 41 ms 53896 KB Output is correct
40 Correct 64 ms 56352 KB Output is correct
41 Correct 44 ms 54080 KB Output is correct
42 Correct 39 ms 54120 KB Output is correct
43 Correct 58 ms 56028 KB Output is correct
44 Correct 49 ms 56048 KB Output is correct

Subtask #5
23.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 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 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 344 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 73 ms 55796 KB Output is correct
34 Correct 135 ms 60384 KB Output is correct
35 Correct 103 ms 55736 KB Output is correct
36 Correct 123 ms 57860 KB Output is correct
37 Correct 56 ms 55028 KB Output is correct
38 Correct 52 ms 55156 KB Output is correct
39 Correct 68 ms 58396 KB Output is correct
40 Correct 76 ms 58504 KB Output is correct
41 Correct 44 ms 54096 KB Output is correct
42 Correct 53 ms 54612 KB Output is correct
43 Correct 39 ms 53968 KB Output is correct
44 Correct 61 ms 56420 KB Output is correct
45 Correct 42 ms 54192 KB Output is correct
46 Correct 39 ms 54108 KB Output is correct
47 Correct 57 ms 56036 KB Output is correct
48 Correct 55 ms 56144 KB Output is correct
49 Correct 116 ms 56644 KB Output is correct
50 Correct 114 ms 56596 KB Output is correct
51 Correct 104 ms 59968 KB Output is correct
52 Correct 102 ms 59616 KB Output is correct
53 Correct 109 ms 55872 KB Output is correct
54 Correct 82 ms 55984 KB Output is correct
55 Correct 68 ms 54868 KB Output is correct
56 Correct 90 ms 57412 KB Output is correct
57 Correct 68 ms 55124 KB Output is correct
58 Correct 67 ms 55580 KB Output is correct
59 Correct 56 ms 56172 KB Output is correct