oj.uz

Submission #365031

# Submission time Handle Problem Language Result Execution time Memory
365031 2021-02-10T19:09:23 Z BartolM Horses (IOI15_horses) C++17
57 / 100
 1500 ms 45188 KB 
#include "horses.h"
#include <bits/stdc++.h>

using namespace std;

#define X first
#define Y second
#define mp make_pair
#define pb push_back
typedef long long ll;
typedef pair <int, int> pii;
typedef pair <int, pii> pip;
typedef pair <pii, int> ppi;
typedef pair <ll, ll> pll;

const int INF=0x3f3f3f3f;
const int MOD=1e9+7;
const int OFF=(1<<19);
const int MAXN=5e5+5;

int n;
pii T[2*OFF];
int Tmax[2*OFF];
int x[MAXN], y[MAXN];
set <int> S;

int mul(int a, int b) {
    return (ll)a*b%MOD;
}

pii f(pii a, pii b) {
    return mp(mul(a.X, b.X), min((ll)MOD, (ll)a.Y*b.Y));
}

pii umn(int a, int b, int pos=1, int lo=0, int hi=OFF) {
    if (lo>=a && hi<=b) return T[pos];
    if (lo>=b || hi<=a) return mp(1, 1);
    int mid=(lo+hi)/2;
    return f(umn(a, b, pos*2, lo, mid), umn(a, b, pos*2+1, mid, hi));
}

int maxi(int a, int b, int pos=1, int lo=0, int hi=OFF) {
    if (lo>=a && hi<=b) return Tmax[pos];
    if (lo>=b || hi<=a) return 1;
    int mid=(lo+hi)/2;
    return max(maxi(a, b, pos*2, lo, mid), maxi(a, b, pos*2+1, mid, hi));
}

int mrg(int a, int b, int ya, int yb) {
    if (a==n) return b;
    if (b==n) return a;
    int bb=f(umn(a+1, b+1), mp(yb, yb)).Y;
    return bb>=ya ? b : a;
}

int answer() {

    int res=n, cnt=31, yres=0;
    set <int>::iterator it=S.end(); it--;
    while (it!=S.begin() && cnt) {
        auto nx=it;
        it--;
        cnt--;
        int curr_y=maxi(*it, *nx);

        res=mrg(*it, res, curr_y, yres);
        if (res==*it) yres=curr_y;
    }
    return mul(umn(0, res+1).X, yres);
}

int init(int N, int XX[], int YY[]) {
    n=N;
    for (int i=0; i<n; ++i) x[i]=XX[i], y[i]=YY[i];
    for (int i=0; i<n; ++i) if (x[i]!=1) S.insert(i);
    S.insert(n); S.insert(0);

    memset(Tmax, 0, sizeof Tmax);
    fill(T, T+2*OFF, mp(1, 1));
    for (int i=0; i<n; ++i) Tmax[OFF+i]=y[i], T[OFF+i].X=T[OFF+i].Y=x[i];
    for (int i=OFF-1; i>0; --i) T[i]=f(T[i*2], T[i*2+1]), Tmax[i]=max(Tmax[i*2], Tmax[i*2+1]);

    return answer();
}

int updateY(int pos, int val) {
    y[pos]=val;
    pos+=OFF;
    Tmax[pos]=val;
    pos/=2;
    while (pos) {
        Tmax[pos]=max(Tmax[pos*2], Tmax[pos*2+1]);
        pos/=2;
    }
    return answer();
}

int updateX(int pos, int val) {

    if (val!=1) S.insert(pos);
    x[pos]=val;
    if (val==1 && S.count(pos)) S.erase(pos);
    S.insert(0);

    pos+=OFF;
    T[pos].X=T[pos].Y=val;
    pos/=2;

    while (pos) {
        T[pos]=f(T[pos*2], T[pos*2+1]);
        pos/=2;
    }
    return answer();
}

Compilation message

horses.cpp: In function 'int mul(int, int)':
horses.cpp:28:19: warning: conversion from 'll' {aka 'long long int'} to 'int' may change value [-Wconversion]
   28 |     return (ll)a*b%MOD;
      |            ~~~~~~~^~~~

Subtask #1
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 12652 KB Output is correct
2 Correct 10 ms 12652 KB Output is correct
3 Correct 10 ms 12652 KB Output is correct
4 Correct 12 ms 12652 KB Output is correct
5 Correct 10 ms 12652 KB Output is correct
6 Correct 10 ms 12652 KB Output is correct
7 Correct 17 ms 12652 KB Output is correct
8 Correct 10 ms 12780 KB Output is correct
9 Correct 10 ms 12652 KB Output is correct
10 Correct 12 ms 12652 KB Output is correct
11 Correct 11 ms 12652 KB Output is correct
12 Correct 10 ms 12652 KB Output is correct
13 Correct 11 ms 12652 KB Output is correct
14 Correct 10 ms 12652 KB Output is correct
15 Correct 11 ms 12652 KB Output is correct
16 Correct 10 ms 12652 KB Output is correct
17 Correct 10 ms 12652 KB Output is correct
18 Correct 10 ms 12672 KB Output is correct
19 Correct 10 ms 12652 KB Output is correct
20 Correct 10 ms 12652 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 12652 KB Output is correct
2 Correct 10 ms 12652 KB Output is correct
3 Correct 10 ms 12652 KB Output is correct
4 Correct 10 ms 12652 KB Output is correct
5 Correct 10 ms 12652 KB Output is correct
6 Correct 10 ms 12652 KB Output is correct
7 Correct 10 ms 12652 KB Output is correct
8 Correct 10 ms 12652 KB Output is correct
9 Correct 10 ms 12652 KB Output is correct
10 Correct 10 ms 12652 KB Output is correct
11 Correct 10 ms 12652 KB Output is correct
12 Correct 10 ms 12652 KB Output is correct
13 Correct 10 ms 12652 KB Output is correct
14 Correct 11 ms 12652 KB Output is correct
15 Correct 10 ms 12652 KB Output is correct
16 Correct 10 ms 12652 KB Output is correct
17 Correct 10 ms 12652 KB Output is correct
18 Correct 10 ms 12652 KB Output is correct
19 Correct 11 ms 12652 KB Output is correct
20 Correct 10 ms 12652 KB Output is correct
21 Correct 10 ms 12652 KB Output is correct
22 Correct 10 ms 12652 KB Output is correct
23 Correct 34 ms 12652 KB Output is correct
24 Correct 27 ms 12652 KB Output is correct
25 Correct 32 ms 12652 KB Output is correct
26 Correct 26 ms 12652 KB Output is correct
27 Correct 28 ms 12652 KB Output is correct
28 Correct 28 ms 12908 KB Output is correct
29 Correct 12 ms 12652 KB Output is correct
30 Correct 27 ms 12652 KB Output is correct
31 Correct 21 ms 12652 KB Output is correct
32 Correct 27 ms 12652 KB Output is correct

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1584 ms 44888 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 12652 KB Output is correct
2 Correct 10 ms 12652 KB Output is correct
3 Correct 10 ms 12652 KB Output is correct
4 Correct 10 ms 12652 KB Output is correct
5 Correct 10 ms 12652 KB Output is correct
6 Correct 10 ms 12652 KB Output is correct
7 Correct 10 ms 12652 KB Output is correct
8 Correct 10 ms 12652 KB Output is correct
9 Correct 10 ms 12652 KB Output is correct
10 Correct 10 ms 12652 KB Output is correct
11 Correct 10 ms 12652 KB Output is correct
12 Correct 10 ms 12652 KB Output is correct
13 Correct 10 ms 12652 KB Output is correct
14 Correct 10 ms 12652 KB Output is correct
15 Correct 10 ms 12652 KB Output is correct
16 Correct 10 ms 12780 KB Output is correct
17 Correct 10 ms 12652 KB Output is correct
18 Correct 10 ms 12652 KB Output is correct
19 Correct 11 ms 12652 KB Output is correct
20 Correct 10 ms 12652 KB Output is correct
21 Correct 10 ms 12652 KB Output is correct
22 Correct 10 ms 12652 KB Output is correct
23 Correct 29 ms 12780 KB Output is correct
24 Correct 28 ms 12780 KB Output is correct
25 Correct 27 ms 12652 KB Output is correct
26 Correct 26 ms 12652 KB Output is correct
27 Correct 28 ms 12652 KB Output is correct
28 Correct 28 ms 12780 KB Output is correct
29 Correct 12 ms 12652 KB Output is correct
30 Correct 28 ms 12652 KB Output is correct
31 Correct 21 ms 12652 KB Output is correct
32 Correct 27 ms 12652 KB Output is correct
33 Correct 270 ms 20844 KB Output is correct
34 Correct 208 ms 20844 KB Output is correct
35 Correct 363 ms 44268 KB Output is correct
36 Correct 340 ms 44460 KB Output is correct
37 Correct 264 ms 20972 KB Output is correct
38 Correct 296 ms 32876 KB Output is correct
39 Correct 49 ms 20588 KB Output is correct
40 Correct 334 ms 44268 KB Output is correct
41 Correct 146 ms 20716 KB Output is correct
42 Correct 217 ms 20716 KB Output is correct
43 Correct 171 ms 44140 KB Output is correct
44 Correct 172 ms 44140 KB Output is correct

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 12652 KB Output is correct
2 Correct 10 ms 12652 KB Output is correct
3 Correct 10 ms 12672 KB Output is correct
4 Correct 10 ms 12652 KB Output is correct
5 Correct 10 ms 12652 KB Output is correct
6 Correct 10 ms 12652 KB Output is correct
7 Correct 10 ms 12652 KB Output is correct
8 Correct 10 ms 12652 KB Output is correct
9 Correct 10 ms 12652 KB Output is correct
10 Correct 10 ms 12652 KB Output is correct
11 Correct 10 ms 12652 KB Output is correct
12 Correct 10 ms 12652 KB Output is correct
13 Correct 10 ms 12652 KB Output is correct
14 Correct 10 ms 12652 KB Output is correct
15 Correct 10 ms 12652 KB Output is correct
16 Correct 10 ms 12652 KB Output is correct
17 Correct 10 ms 12652 KB Output is correct
18 Correct 10 ms 12652 KB Output is correct
19 Correct 10 ms 12652 KB Output is correct
20 Correct 10 ms 12652 KB Output is correct
21 Correct 10 ms 12652 KB Output is correct
22 Correct 10 ms 12652 KB Output is correct
23 Correct 36 ms 12652 KB Output is correct
24 Correct 27 ms 12652 KB Output is correct
25 Correct 27 ms 12652 KB Output is correct
26 Correct 26 ms 12652 KB Output is correct
27 Correct 28 ms 12652 KB Output is correct
28 Correct 28 ms 12652 KB Output is correct
29 Correct 14 ms 12652 KB Output is correct
30 Correct 27 ms 12652 KB Output is correct
31 Correct 21 ms 12652 KB Output is correct
32 Correct 27 ms 12652 KB Output is correct
33 Execution timed out 1574 ms 45188 KB Time limit exceeded
34 Halted 0 ms 0 KB -