oj.uz

Submission #624802

# Submission time Handle Problem Language Result Execution time Memory
624802 2022-08-08T18:31:17 Z Icebear16 Meetings (IOI18_meetings) C++14
19 / 100
 5500 ms 755676 KB 
#include "meetings.h"
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define sz(a) a.size()
vector<long long> minimum_costs(vector<int> H, vector<int> L,vector<int> R) {
  	int Q = L.size();
  	int n = H.size();
 	int adj[n][n];
  	vector<long long> C(Q);
  	for(int i=0;i<n;i++){
		adj[i][i]=H[i];
  		for(int k=i-1;k>=0;k--){
  			adj[i][k]=max(adj[i][k+1],H[k]);
		  }
  		for(int k=i+1;k<n;k++){
  			adj[i][k]=max(adj[i][k-1],H[k]);
		  }
	}
	long long dj[n][n];
	for(int i=0;i<n;i++){
		for(int j=0;j<n;j++){
			dj[i][j]=adj[i][j];
		}
	}
	for(int i=0;i<n;i++){
		for(int j=1;j<n;j++){
			dj[i][j]+=dj[i][j-1];
		}
	}
// 	int rt[n][n], lt[n][n];
//	for(int i=0;i<n;i++){
//		for(int j=0;j<n;j++){
//			cout<<dj[i][j]<<" ";
//		}
//		cout<<endl;
//	}
	for(int i=0;i<Q;i++){
  		long long ans=1e18;
		for(int j=0;j<n;j++){
			if(L[i]==0){
				ans=min(ans,dj[j][R[i]]);
			}else{
				ans=min(ans,dj[j][R[i]]-dj[j][L[i]-1]);
			}
		}
		C[i]=ans;
	}
  return C;
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 96 ms 105948 KB Output is correct
3 Correct 100 ms 106096 KB Output is correct
4 Correct 100 ms 106044 KB Output is correct
5 Correct 98 ms 106000 KB Output is correct
6 Correct 98 ms 106080 KB Output is correct
7 Correct 99 ms 105952 KB Output is correct
8 Correct 100 ms 106028 KB Output is correct
9 Correct 95 ms 105988 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 96 ms 105948 KB Output is correct
3 Correct 100 ms 106096 KB Output is correct
4 Correct 100 ms 106044 KB Output is correct
5 Correct 98 ms 106000 KB Output is correct
6 Correct 98 ms 106080 KB Output is correct
7 Correct 99 ms 105952 KB Output is correct
8 Correct 100 ms 106028 KB Output is correct
9 Correct 95 ms 105988 KB Output is correct
10 Correct 711 ms 294072 KB Output is correct
11 Correct 518 ms 294072 KB Output is correct
12 Correct 648 ms 294092 KB Output is correct
13 Correct 586 ms 294080 KB Output is correct
14 Correct 669 ms 294084 KB Output is correct
15 Correct 672 ms 294076 KB Output is correct

Subtask #3
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Execution timed out 5574 ms 755676 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #4
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Execution timed out 5574 ms 755676 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 212 KB Output is correct
2 Correct 96 ms 105948 KB Output is correct
3 Correct 100 ms 106096 KB Output is correct
4 Correct 100 ms 106044 KB Output is correct
5 Correct 98 ms 106000 KB Output is correct
6 Correct 98 ms 106080 KB Output is correct
7 Correct 99 ms 105952 KB Output is correct
8 Correct 100 ms 106028 KB Output is correct
9 Correct 95 ms 105988 KB Output is correct
10 Correct 711 ms 294072 KB Output is correct
11 Correct 518 ms 294072 KB Output is correct
12 Correct 648 ms 294092 KB Output is correct
13 Correct 586 ms 294080 KB Output is correct
14 Correct 669 ms 294084 KB Output is correct
15 Correct 672 ms 294076 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Execution timed out 5574 ms 755676 KB Time limit exceeded
18 Halted 0 ms 0 KB -