oj.uz

Submission #915732

# Submission time Handle Problem Language Result Execution time Memory
915732 2024-01-24T15:54:17 Z biank Meetings (IOI18_meetings) C++14
19 / 100
 5500 ms 6736 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;

vll minimum_costs(vi h, vi l, vi r) {
    int q=SIZE(l), n=SIZE(h);
    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 1 ms 344 KB Output is correct
2 Correct 35 ms 524 KB Output is correct
3 Correct 35 ms 348 KB Output is correct
4 Correct 34 ms 600 KB Output is correct
5 Correct 35 ms 500 KB Output is correct
6 Correct 35 ms 348 KB Output is correct
7 Correct 35 ms 348 KB Output is correct
8 Correct 35 ms 344 KB Output is correct
9 Correct 35 ms 348 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 35 ms 524 KB Output is correct
3 Correct 35 ms 348 KB Output is correct
4 Correct 34 ms 600 KB Output is correct
5 Correct 35 ms 500 KB Output is correct
6 Correct 35 ms 348 KB Output is correct
7 Correct 35 ms 348 KB Output is correct
8 Correct 35 ms 344 KB Output is correct
9 Correct 35 ms 348 KB Output is correct
10 Correct 128 ms 644 KB Output is correct
11 Correct 124 ms 744 KB Output is correct
12 Correct 129 ms 604 KB Output is correct
13 Correct 124 ms 600 KB Output is correct
14 Correct 127 ms 756 KB Output is correct
15 Correct 127 ms 744 KB Output is correct

Subtask #3
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 831 ms 2516 KB Output is correct
3 Execution timed out 5537 ms 6736 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #4
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 831 ms 2516 KB Output is correct
3 Execution timed out 5537 ms 6736 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #5
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 35 ms 524 KB Output is correct
3 Correct 35 ms 348 KB Output is correct
4 Correct 34 ms 600 KB Output is correct
5 Correct 35 ms 500 KB Output is correct
6 Correct 35 ms 348 KB Output is correct
7 Correct 35 ms 348 KB Output is correct
8 Correct 35 ms 344 KB Output is correct
9 Correct 35 ms 348 KB Output is correct
10 Correct 128 ms 644 KB Output is correct
11 Correct 124 ms 744 KB Output is correct
12 Correct 129 ms 604 KB Output is correct
13 Correct 124 ms 600 KB Output is correct
14 Correct 127 ms 756 KB Output is correct
15 Correct 127 ms 744 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 831 ms 2516 KB Output is correct
18 Execution timed out 5537 ms 6736 KB Time limit exceeded
19 Halted 0 ms 0 KB -