답안 #111887

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
111887	2019-05-16T15:56:29 Z	mechfrog88	모임들 (IOI18_meetings)	C++14	19 / 100	5500 ms	504596 KB

meetings

#include "meetings.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

vector<ll> minimum_costs(vector<int> h,vector<int> l,vector<int> r) {
  int n = l.size();
  ll a = h.size();
  vector<ll> c(n);
  vector <vector<ll>> d(a,vector<ll>(a,0));
  for (int z=0;z<a;z++){
  	ll maxi = h[z];
  	d[z][z] = h[z];
  	for (int x=z+1;x<a;x++){
  		maxi = max(maxi,ll(h[x]));
  		d[z][x] = d[z][x-1] + maxi;
  	}
  	maxi = h[z];
  	for (int x=z-1;x>-1;x--){
  		maxi = max(maxi,ll(h[x]));
  		d[z][x] = d[z][x+1] + maxi;
  	}
  }
  for (int z=0;z<n;z++){
  	ll left = l[z];
  	ll right = r[z];
  	c[z] = LLONG_MAX;
  	for (int x=left;x<=right;x++){
  		c[z] = min(c[z],d[x][right]+d[x][left]-ll(h[x]));
  	}
  }
  return c;
}

Subtask #1

4.0 / 4.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	83 ms	70880 KB	Output is correct
3	Correct	83 ms	70920 KB	Output is correct
4	Correct	83 ms	70912 KB	Output is correct
5	Correct	82 ms	70876 KB	Output is correct
6	Correct	82 ms	70884 KB	Output is correct
7	Correct	82 ms	70884 KB	Output is correct
8	Correct	80 ms	70888 KB	Output is correct
9	Correct	83 ms	70876 KB	Output is correct

Subtask #2

15.0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	83 ms	70880 KB	Output is correct
3	Correct	83 ms	70920 KB	Output is correct
4	Correct	83 ms	70912 KB	Output is correct
5	Correct	82 ms	70876 KB	Output is correct
6	Correct	82 ms	70884 KB	Output is correct
7	Correct	82 ms	70884 KB	Output is correct
8	Correct	80 ms	70888 KB	Output is correct
9	Correct	83 ms	70876 KB	Output is correct
10	Correct	513 ms	196436 KB	Output is correct
11	Correct	710 ms	196444 KB	Output is correct
12	Correct	511 ms	196436 KB	Output is correct
13	Correct	696 ms	196320 KB	Output is correct
14	Correct	524 ms	196368 KB	Output is correct
15	Correct	528 ms	196424 KB	Output is correct

Subtask #3

0 / 17.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Execution timed out	5582 ms	504596 KB	Time limit exceeded
3	Halted	0 ms	0 KB	-

Subtask #4

0 / 24.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Execution timed out	5582 ms	504596 KB	Time limit exceeded
3	Halted	0 ms	0 KB	-

Subtask #5

0 / 40.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	83 ms	70880 KB	Output is correct
3	Correct	83 ms	70920 KB	Output is correct
4	Correct	83 ms	70912 KB	Output is correct
5	Correct	82 ms	70876 KB	Output is correct
6	Correct	82 ms	70884 KB	Output is correct
7	Correct	82 ms	70884 KB	Output is correct
8	Correct	80 ms	70888 KB	Output is correct
9	Correct	83 ms	70876 KB	Output is correct
10	Correct	513 ms	196436 KB	Output is correct
11	Correct	710 ms	196444 KB	Output is correct
12	Correct	511 ms	196436 KB	Output is correct
13	Correct	696 ms	196320 KB	Output is correct
14	Correct	524 ms	196368 KB	Output is correct
15	Correct	528 ms	196424 KB	Output is correct
16	Correct	2 ms	376 KB	Output is correct
17	Execution timed out	5582 ms	504596 KB	Time limit exceeded
18	Halted	0 ms	0 KB	-