oj.uz

답안 #288368

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
288368 2020-09-01T12:53:04 Z Kastanda 말 (IOI15_horses) C++11
100 / 100
 183 ms 50296 KB 
// M
#include<bits/stdc++.h>
#include "horses.h"
#define lc (id << 1)
#define rc (lc ^ 1)
#define md ((l + r) >> 1)
using namespace std;
typedef long long ll;
const int N = 500005, Mod = 1e9 + 7;
const ll INF = 1e9 + 100;
struct Data {int rs, mlx; ll pref, suff, opty, multx;};
int n, X[N], Y[N];
Data D[N * 4];
inline void Recalc(int id)
{
        D[id].mlx = D[lc].mlx * (ll)D[rc].mlx % Mod;
        D[id].multx = min(D[lc].multx * (ll)D[rc].multx, INF);
        if (D[lc].opty > D[lc].suff * (ll)D[rc].pref)
        {
                D[id].opty = D[lc].opty;
                D[id].rs = D[lc].rs;
                D[id].pref = D[lc].pref;
                D[id].suff = min((ll)D[lc].suff * D[rc].multx, INF);
        }
        else
        {
                D[id].opty = D[rc].opty;
                D[id].rs = D[lc].mlx * (ll)D[rc].rs % Mod;
                D[id].pref = min(D[lc].multx * (ll)D[rc].pref, INF);
                D[id].suff = D[rc].suff;
        }
}
void Build(int id = 1, int l = 0, int r = n)
{
        if (r - l < 2)
        {
                D[id].rs = (ll)X[l] * Y[l] % Mod;
                D[id].mlx = X[l] % Mod;
                D[id].multx = min((ll)X[l], INF);
                D[id].pref = min((ll)X[l] * Y[l], INF);
                D[id].suff = 1LL;
                D[id].opty = Y[l];
                return ;
        }
        Build(lc, l, md);
        Build(rc, md, r);
        Recalc(id);
}
void UpdXVal(int i, int id = 1, int l = 0, int r = n)
{
        if (r - l < 2)
        {
                D[id].rs = (ll)X[l] * Y[l] % Mod;
                D[id].mlx = X[l] % Mod;
                D[id].multx = min((ll)X[l], INF);
                D[id].pref = min((ll)X[l] * Y[l], INF);
                D[id].suff = 1LL;
                D[id].opty = Y[l];
                return ;
        }
        if (i < md)
                UpdXVal(i, lc, l, md);
        else
                UpdXVal(i, rc, md, r);
        Recalc(id);
}

int init(int _n, int _X[], int _Y[])
{
        n = _n;
        for (int i = 0; i < n; i ++)
                X[i] = _X[i], Y[i] = _Y[i];
        Build();
        return D[1].rs;
}

int updateX(int pos, int val)
{
        X[pos] = val;
        UpdXVal(pos);
        return D[1].rs;
}

int updateY(int pos, int val)
{
        Y[pos] = val;
        UpdXVal(pos);
        return D[1].rs;
}

Compilation message

horses.cpp: In function 'void Recalc(int)':
horses.cpp:16:47: warning: conversion from 'll' {aka 'long long int'} to 'int' may change value [-Wconversion]
   16 |         D[id].mlx = D[lc].mlx * (ll)D[rc].mlx % Mod;
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
horses.cpp:28:53: warning: conversion from 'll' {aka 'long long int'} to 'int' may change value [-Wconversion]
   28 |                 D[id].rs = D[lc].mlx * (ll)D[rc].rs % Mod;
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
horses.cpp: In function 'void Build(int, int, int)':
horses.cpp:37:44: warning: conversion from 'll' {aka 'long long int'} to 'int' may change value [-Wconversion]
   37 |                 D[id].rs = (ll)X[l] * Y[l] % Mod;
      |                            ~~~~~~~~~~~~~~~~^~~~~
horses.cpp: In function 'void UpdXVal(int, int, int, int)':
horses.cpp:53:44: warning: conversion from 'll' {aka 'long long int'} to 'int' may change value [-Wconversion]
   53 |                 D[id].rs = (ll)X[l] * Y[l] % Mod;
      |                            ~~~~~~~~~~~~~~~~^~~~~

Subtask #1
17.0 / 17.0

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

Subtask #2
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 0 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 0 ms 384 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 0 ms 384 KB Output is correct
21 Correct 0 ms 384 KB Output is correct
22 Correct 1 ms 304 KB Output is correct
23 Correct 1 ms 384 KB Output is correct
24 Correct 1 ms 384 KB Output is correct
25 Correct 1 ms 384 KB Output is correct
26 Correct 1 ms 384 KB Output is correct
27 Correct 1 ms 384 KB Output is correct
28 Correct 1 ms 384 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Correct 1 ms 384 KB Output is correct
31 Correct 1 ms 384 KB Output is correct
32 Correct 1 ms 384 KB Output is correct

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 96 ms 50152 KB Output is correct
2 Correct 183 ms 50256 KB Output is correct
3 Correct 153 ms 50192 KB Output is correct
4 Correct 170 ms 50168 KB Output is correct

Subtask #4
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 1 ms 488 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 0 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 0 ms 384 KB Output is correct
17 Correct 0 ms 384 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 0 ms 384 KB Output is correct
20 Correct 0 ms 384 KB Output is correct
21 Correct 0 ms 384 KB Output is correct
22 Correct 1 ms 360 KB Output is correct
23 Correct 1 ms 384 KB Output is correct
24 Correct 1 ms 384 KB Output is correct
25 Correct 1 ms 488 KB Output is correct
26 Correct 1 ms 384 KB Output is correct
27 Correct 1 ms 384 KB Output is correct
28 Correct 1 ms 384 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Correct 1 ms 384 KB Output is correct
31 Correct 1 ms 512 KB Output is correct
32 Correct 1 ms 512 KB Output is correct
33 Correct 76 ms 49304 KB Output is correct
34 Correct 67 ms 49272 KB Output is correct
35 Correct 81 ms 49244 KB Output is correct
36 Correct 85 ms 49308 KB Output is correct
37 Correct 53 ms 49272 KB Output is correct
38 Correct 52 ms 49324 KB Output is correct
39 Correct 48 ms 49280 KB Output is correct
40 Correct 64 ms 49272 KB Output is correct
41 Correct 60 ms 49272 KB Output is correct
42 Correct 60 ms 49356 KB Output is correct
43 Correct 59 ms 49144 KB Output is correct
44 Correct 66 ms 49144 KB Output is correct

Subtask #5
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 0 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 0 ms 384 KB Output is correct
20 Correct 1 ms 384 KB Output is correct
21 Correct 1 ms 384 KB Output is correct
22 Correct 0 ms 384 KB Output is correct
23 Correct 1 ms 384 KB Output is correct
24 Correct 1 ms 416 KB Output is correct
25 Correct 1 ms 384 KB Output is correct
26 Correct 1 ms 384 KB Output is correct
27 Correct 2 ms 384 KB Output is correct
28 Correct 1 ms 512 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Correct 1 ms 384 KB Output is correct
31 Correct 1 ms 384 KB Output is correct
32 Correct 1 ms 384 KB Output is correct
33 Correct 87 ms 50156 KB Output is correct
34 Correct 175 ms 50168 KB Output is correct
35 Correct 177 ms 50168 KB Output is correct
36 Correct 167 ms 50168 KB Output is correct
37 Correct 69 ms 49272 KB Output is correct
38 Correct 63 ms 49236 KB Output is correct
39 Correct 80 ms 49272 KB Output is correct
40 Correct 86 ms 49272 KB Output is correct
41 Correct 57 ms 49276 KB Output is correct
42 Correct 59 ms 49320 KB Output is correct
43 Correct 46 ms 49276 KB Output is correct
44 Correct 63 ms 49272 KB Output is correct
45 Correct 53 ms 49248 KB Output is correct
46 Correct 51 ms 49272 KB Output is correct
47 Correct 65 ms 49144 KB Output is correct
48 Correct 66 ms 49256 KB Output is correct
49 Correct 156 ms 50172 KB Output is correct
50 Correct 155 ms 50204 KB Output is correct
51 Correct 122 ms 50184 KB Output is correct
52 Correct 123 ms 50152 KB Output is correct
53 Correct 147 ms 50296 KB Output is correct
54 Correct 110 ms 50168 KB Output is correct
55 Correct 91 ms 49400 KB Output is correct
56 Correct 112 ms 50164 KB Output is correct
57 Correct 93 ms 50240 KB Output is correct
58 Correct 89 ms 50180 KB Output is correct
59 Correct 62 ms 49144 KB Output is correct