oj.uz

Submission #915744

# Submission time Handle Problem Language Result Execution time Memory
915744 2024-01-24T16:13:29 Z biank Meetings (IOI18_meetings) C++14
36 / 100
 5500 ms 10092 KB 
#include "meetings.h"
#include <bits/stdc++.h>
using namespace std;
#define SIZE(x) int(x.size())
#define forn(i,n) for(int i=0;i<int(n);i++)
#define forsn(i,s,n) for(int i=int(s);i<int(n);i++)
#define dforn(i,n) for(int i=int(n)-1;i>=0;i--)
typedef long long ll;
typedef vector<ll> vll;
typedef vector<int> vi;
const ll INF = 1e18;
const int MAXN = 1e5;

struct Node {
    int pref, suff, maxi, sz;
    Node() : pref(0), suff(0), maxi(0), sz(0) {}
    Node(int v) : pref(v==1), suff(v==1), maxi(v==1), sz(1) {}
    Node(Node left, Node right) {
        pref = left.pref + right.pref * (left.pref == left.sz);
        suff = right.suff + left.suff * (right.suff == right.sz);
        maxi = max({left.maxi, right.maxi, left.suff + right.pref});
        sz = left.sz + right.sz;
    }
};

Node st[2*MAXN];
int n;

int query(int l, int r) {
    Node ansL, ansR;
    for(l+=n, r+=n; l<r; l/=2, r/=2) {
        if(l&1) ansL=Node(ansL,st[l++]);
        if(r&1) ansR=Node(st[--r],ansR);
    }
    return Node(ansL, ansR).maxi;
}

vll subtask3(vi h, vi l, vi r) {
    n=SIZE(h);
    forn(i,n) st[i+n]=Node(h[i]);
    dforn(i,n) st[i]=Node(st[2*i],st[2*i+1]);
    int q=SIZE(l);
    vll ans(q);
    forn(i,q) {
        int maxi=query(l[i],r[i]+1);
        ans[i]=(r[i]-l[i]+1LL)*2LL-maxi;
    }
    return ans;
}

vll minimum_costs(vi h, vi l, vi r) {
    int q=SIZE(l), n=SIZE(h);
    bool s3=q<=MAXN&&n<=MAXN;
    forn(i,n) s3&=h[i]<=2;
    if(s3) return subtask3(h,l,r);
    vll ans(q,INF);
    forn(i,n) {
        vi c(n);
        c[i]=h[i];
        dforn(j,i) c[j]=max(c[j+1],h[j]);
        forsn(j,i+1,n) c[j]=max(c[j-1],h[j]);
        vll p(n+1);
        p[0]=0;
        forn(j,n) p[j+1]=p[j]+c[j];
        forn(j,q) ans[j]=min(ans[j],p[r[j]+1]-p[l[j]]);
    }
    return ans;
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3416 KB Output is correct
2 Correct 35 ms 3416 KB Output is correct
3 Correct 36 ms 3420 KB Output is correct
4 Correct 36 ms 3416 KB Output is correct
5 Correct 36 ms 3420 KB Output is correct
6 Correct 36 ms 3420 KB Output is correct
7 Correct 36 ms 3596 KB Output is correct
8 Correct 36 ms 3416 KB Output is correct
9 Correct 36 ms 3416 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3416 KB Output is correct
2 Correct 35 ms 3416 KB Output is correct
3 Correct 36 ms 3420 KB Output is correct
4 Correct 36 ms 3416 KB Output is correct
5 Correct 36 ms 3420 KB Output is correct
6 Correct 36 ms 3420 KB Output is correct
7 Correct 36 ms 3596 KB Output is correct
8 Correct 36 ms 3416 KB Output is correct
9 Correct 36 ms 3416 KB Output is correct
10 Correct 129 ms 3752 KB Output is correct
11 Correct 124 ms 3676 KB Output is correct
12 Correct 135 ms 3844 KB Output is correct
13 Correct 125 ms 3672 KB Output is correct
14 Correct 128 ms 3676 KB Output is correct
15 Correct 128 ms 3768 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3616 KB Output is correct
2 Correct 20 ms 4956 KB Output is correct
3 Correct 45 ms 7768 KB Output is correct
4 Correct 45 ms 9808 KB Output is correct
5 Correct 33 ms 9720 KB Output is correct
6 Correct 45 ms 10092 KB Output is correct
7 Correct 45 ms 9812 KB Output is correct

Subtask #4
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3616 KB Output is correct
2 Correct 20 ms 4956 KB Output is correct
3 Correct 45 ms 7768 KB Output is correct
4 Correct 45 ms 9808 KB Output is correct
5 Correct 33 ms 9720 KB Output is correct
6 Correct 45 ms 10092 KB Output is correct
7 Correct 45 ms 9812 KB Output is correct
8 Execution timed out 5509 ms 9836 KB Time limit exceeded
9 Halted 0 ms 0 KB -

Subtask #5
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3416 KB Output is correct
2 Correct 35 ms 3416 KB Output is correct
3 Correct 36 ms 3420 KB Output is correct
4 Correct 36 ms 3416 KB Output is correct
5 Correct 36 ms 3420 KB Output is correct
6 Correct 36 ms 3420 KB Output is correct
7 Correct 36 ms 3596 KB Output is correct
8 Correct 36 ms 3416 KB Output is correct
9 Correct 36 ms 3416 KB Output is correct
10 Correct 129 ms 3752 KB Output is correct
11 Correct 124 ms 3676 KB Output is correct
12 Correct 135 ms 3844 KB Output is correct
13 Correct 125 ms 3672 KB Output is correct
14 Correct 128 ms 3676 KB Output is correct
15 Correct 128 ms 3768 KB Output is correct
16 Correct 2 ms 3616 KB Output is correct
17 Correct 20 ms 4956 KB Output is correct
18 Correct 45 ms 7768 KB Output is correct
19 Correct 45 ms 9808 KB Output is correct
20 Correct 33 ms 9720 KB Output is correct
21 Correct 45 ms 10092 KB Output is correct
22 Correct 45 ms 9812 KB Output is correct
23 Execution timed out 5509 ms 9836 KB Time limit exceeded
24 Halted 0 ms 0 KB -