oj.uz

Submission #915727

# Submission time Handle Problem Language Result Execution time Memory
915727 2024-01-24T15:51:41 Z biank Meetings (IOI18_meetings) C++14
19 / 100
 5500 ms 504816 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);
    vector<vll> p(n,vll(n+1));
    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]);
        forn(j,n) p[i][j+1]=p[i][j]+c[j];
    }
    vll ans(q,INF);
    forn(i,q) {
        r[i]++;
        forn(j,n) ans[i]=min(ans[i],p[j][r[i]]-p[j][l[i]]);
    }
    return ans;
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 67 ms 70996 KB Output is correct
3 Correct 66 ms 71016 KB Output is correct
4 Correct 66 ms 71052 KB Output is correct
5 Correct 67 ms 71260 KB Output is correct
6 Correct 68 ms 71048 KB Output is correct
7 Correct 67 ms 71056 KB Output is correct
8 Correct 69 ms 70992 KB Output is correct
9 Correct 65 ms 70964 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 67 ms 70996 KB Output is correct
3 Correct 66 ms 71016 KB Output is correct
4 Correct 66 ms 71052 KB Output is correct
5 Correct 67 ms 71260 KB Output is correct
6 Correct 68 ms 71048 KB Output is correct
7 Correct 67 ms 71056 KB Output is correct
8 Correct 69 ms 70992 KB Output is correct
9 Correct 65 ms 70964 KB Output is correct
10 Correct 763 ms 196560 KB Output is correct
11 Correct 439 ms 196560 KB Output is correct
12 Correct 748 ms 196564 KB Output is correct
13 Correct 435 ms 196564 KB Output is correct
14 Correct 715 ms 196564 KB Output is correct
15 Correct 746 ms 196436 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 Execution timed out 5572 ms 504816 KB Time limit exceeded
3 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 Execution timed out 5572 ms 504816 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #5
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 67 ms 70996 KB Output is correct
3 Correct 66 ms 71016 KB Output is correct
4 Correct 66 ms 71052 KB Output is correct
5 Correct 67 ms 71260 KB Output is correct
6 Correct 68 ms 71048 KB Output is correct
7 Correct 67 ms 71056 KB Output is correct
8 Correct 69 ms 70992 KB Output is correct
9 Correct 65 ms 70964 KB Output is correct
10 Correct 763 ms 196560 KB Output is correct
11 Correct 439 ms 196560 KB Output is correct
12 Correct 748 ms 196564 KB Output is correct
13 Correct 435 ms 196564 KB Output is correct
14 Correct 715 ms 196564 KB Output is correct
15 Correct 746 ms 196436 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Execution timed out 5572 ms 504816 KB Time limit exceeded
18 Halted 0 ms 0 KB -