oj.uz

Submission #394414

# Submission time Handle Problem Language Result Execution time Memory
394414 2021-04-26T14:08:58 Z Theo830 Meetings (IOI18_meetings) C++17
4 / 100
 5500 ms 284988 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll INF = 1e18+7;
ll MOD = 998244353;
typedef pair<ll,ll> ii;
#define iii pair<ll,ii>
#define f(i,a,b) for(ll i = a;i < b;i++)
#define pb push_back
#define vll vector<ll>
#define F first
#define S second
#define all(x) (x).begin(), (x).end()
///I hope I will get uprating and don't make mistakes
///I will never stop programming
///sqrt(-1) Love C++
///Please don't hack me
///@TheofanisOrfanou Theo830
///Think different approaches (bs,dp,greedy,graphs,shortest paths,mst)
///Stay Calm
///Look for special cases
///Beware of overflow and array bounds
///Think the problem backwards
///Training
#include "meetings.h"
std::vector<long long> minimum_costs(std::vector<int> H, std::vector<int> L,std::vector<int> R) {
  int Q = L.size();
  ll n = H.size();
  ll maxi[n][n];
  f(i,0,n){
    maxi[i][i] = H[i];
    f(j,i+1,n){
        maxi[i][j] = max(maxi[i][j-1],1LL * H[j]);
    }
  }
  vector<long long> C(Q);
  f(k,0,Q){
    ll ans = INF;
    f(i,L[k],R[k]+1){
        ll res = 0;
        f(j,L[k],R[k]+1){
            res += maxi[min(i,j)][max(i,j)];
        }
        ans = min(ans,res);
    }
    C[k] = ans;
  }
  return C;
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 79 ms 46540 KB Output is correct
3 Correct 586 ms 46552 KB Output is correct
4 Correct 181 ms 46592 KB Output is correct
5 Correct 571 ms 46636 KB Output is correct
6 Correct 59 ms 46528 KB Output is correct
7 Correct 27 ms 46512 KB Output is correct
8 Correct 32 ms 46556 KB Output is correct
9 Correct 552 ms 46568 KB Output is correct

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 79 ms 46540 KB Output is correct
3 Correct 586 ms 46552 KB Output is correct
4 Correct 181 ms 46592 KB Output is correct
5 Correct 571 ms 46636 KB Output is correct
6 Correct 59 ms 46528 KB Output is correct
7 Correct 27 ms 46512 KB Output is correct
8 Correct 32 ms 46556 KB Output is correct
9 Correct 552 ms 46568 KB Output is correct
10 Execution timed out 5522 ms 117424 KB Time limit exceeded
11 Halted 0 ms 0 KB -

Subtask #3
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Execution timed out 5540 ms 284988 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 204 KB Output is correct
2 Execution timed out 5540 ms 284988 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #5
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 79 ms 46540 KB Output is correct
3 Correct 586 ms 46552 KB Output is correct
4 Correct 181 ms 46592 KB Output is correct
5 Correct 571 ms 46636 KB Output is correct
6 Correct 59 ms 46528 KB Output is correct
7 Correct 27 ms 46512 KB Output is correct
8 Correct 32 ms 46556 KB Output is correct
9 Correct 552 ms 46568 KB Output is correct
10 Execution timed out 5522 ms 117424 KB Time limit exceeded
11 Halted 0 ms 0 KB -