oj.uz

Submission #79039

# Submission time Handle Problem Language Result Execution time Memory
79039 2018-10-10T19:19:58 Z doowey Meetings (IOI18_meetings) C++14
19 / 100
 731 ms 398684 KB 
#include "meetings.h"
#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

const int N = 5005;
ll meet[N][N];

ll pref(int dim, int l, int r){
	ll ans = meet[dim][r];
	if(l != 0)
		ans -= meet[dim][l - 1];
	return ans;
}

vector<ll> minimum_costs(vector<int> H, vector<int> L, vector<int> R) {
	int n = H.size();
	int mx;
	for(int i = 0 ;i < n; i ++ ){
		meet[i][i] = H[i];
		mx = H[i];
		for(int j = i - 1; j >= 0; j -- ){
			mx = max(mx, H[j]);
			meet[i][j] = mx;
		}
		mx = H[i];
		for(int j = i + 1; j < n; j ++ ){
			mx = max(mx, H[j]);
			meet[i][j] = mx;
		}
	}
	for(int i = 0 ; i < n; i ++ ){
		for(int j = 1; j < n; j ++ ){
			meet[i][j] += meet[i][j - 1];
		}
	}
	vector<ll> ans;
	int lf, rf;
	ll tot;
	for(int i = 0; i < L.size(); i ++ ){
		lf = L[i];
		rf = R[i];
		tot = (ll)1e18;
		for(int j = lf; j <= rf; j ++ ){
			tot = min(tot, pref(j, lf, rf));
		}
		ans.push_back(tot);
	}
	return ans;
}

Compilation message

meetings.cpp: In function 'std::vector<long long int> minimum_costs(std::vector<int>, std::vector<int>, std::vector<int>)':
meetings.cpp:41:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = 0; i < L.size(); i ++ ){
                 ~~^~~~~~~~~~

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 100 ms 82872 KB Output is correct
3 Correct 101 ms 82832 KB Output is correct
4 Correct 102 ms 82904 KB Output is correct
5 Correct 100 ms 82896 KB Output is correct
6 Correct 100 ms 82908 KB Output is correct
7 Correct 98 ms 82908 KB Output is correct
8 Correct 112 ms 82868 KB Output is correct
9 Correct 98 ms 82908 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 100 ms 82872 KB Output is correct
3 Correct 101 ms 82832 KB Output is correct
4 Correct 102 ms 82904 KB Output is correct
5 Correct 100 ms 82896 KB Output is correct
6 Correct 100 ms 82908 KB Output is correct
7 Correct 98 ms 82908 KB Output is correct
8 Correct 112 ms 82868 KB Output is correct
9 Correct 98 ms 82908 KB Output is correct
10 Correct 511 ms 196488 KB Output is correct
11 Correct 719 ms 196512 KB Output is correct
12 Correct 514 ms 196428 KB Output is correct
13 Correct 731 ms 196476 KB Output is correct
14 Correct 523 ms 196444 KB Output is correct
15 Correct 522 ms 196500 KB Output is correct

Subtask #3
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 348 KB Output is correct
2 Runtime error 447 ms 398684 KB Execution killed with signal 11 (could be triggered by violating memory limits)
3 Halted 0 ms 0 KB -

Subtask #4
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 348 KB Output is correct
2 Runtime error 447 ms 398684 KB Execution killed with signal 11 (could be triggered by violating memory limits)
3 Halted 0 ms 0 KB -

Subtask #5
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 100 ms 82872 KB Output is correct
3 Correct 101 ms 82832 KB Output is correct
4 Correct 102 ms 82904 KB Output is correct
5 Correct 100 ms 82896 KB Output is correct
6 Correct 100 ms 82908 KB Output is correct
7 Correct 98 ms 82908 KB Output is correct
8 Correct 112 ms 82868 KB Output is correct
9 Correct 98 ms 82908 KB Output is correct
10 Correct 511 ms 196488 KB Output is correct
11 Correct 719 ms 196512 KB Output is correct
12 Correct 514 ms 196428 KB Output is correct
13 Correct 731 ms 196476 KB Output is correct
14 Correct 523 ms 196444 KB Output is correct
15 Correct 522 ms 196500 KB Output is correct
16 Correct 2 ms 348 KB Output is correct
17 Runtime error 447 ms 398684 KB Execution killed with signal 11 (could be triggered by violating memory limits)
18 Halted 0 ms 0 KB -