oj.uz

답안 #307024

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
307024 2020-09-26T19:03:23 Z VROOM_VARUN Cloud Computing (CEOI18_clo) C++14
100 / 100
 585 ms 1528 KB 
#include <cstdio>
#include <vector>
#include <algorithm>

using namespace std;

struct Event {
  enum Type { Processor, Task };
  Type type;
  int cores, frequency, price;
  Event(Type type, int cores, int frequency, int price)
      : type(type), cores(cores), frequency(frequency), price(price) { }
};

const int MAXN = 2005, MAXC = 55, MAXDP = MAXN*MAXC;
const long long int INF = 1000000000000000000LL; // 10^18
int n,m;
vector<Event> events;
long long int dp[MAXDP];

bool comp(const Event& event1, const Event& event2) {
  if (event1.frequency == event2.frequency)
    return event1.type < event2.type;
  return event1.frequency > event2.frequency;
}

int main() {
  scanf("%d", &n);
  for (int i = 0; i < n; ++i) {
    int c,f,v;
    scanf("%d%d%d", &c, &f, &v);
    events.push_back(Event(Event::Processor,c,f,v));
  }
  scanf("%d", &m);
  for (int i = 0; i < m; ++i) {
    int c,f,v;
    scanf("%d%d%d", &c, &f, &v);
    events.push_back(Event(Event::Task,c,f,v));
  }

  sort(events.begin(), events.end(), comp);

  for (int i = 0; i < MAXDP; ++i)
    dp[i] = -INF;
  dp[0] = 0;

  for (int i = 0; i < (int)events.size(); ++i)
    if (events[i].type == Event::Processor)
      for (int j = MAXDP-1; j >= 0; --j) {
        int index = j + events[i].cores;
        long long int value = dp[j] - events[i].price;
        if (index < MAXDP && dp[index] < value)
          dp[index] = value;
      }
    else
      for (int j = 0; j < MAXDP; ++j) {
        int index = j - events[i].cores;
        long long int value = dp[j] + events[i].price;
        if (index >= 0 && dp[j] != -INF && dp[index] < value)
          dp[index] = value;
      }

  long long int result = 0;
  for (int i = 0; i < MAXDP; ++i)
    result = max(result, dp[i]);

  printf("%lld\n", result);
}

Compilation message

clo.cpp: In function 'int main()':
clo.cpp:28:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   28 |   scanf("%d", &n);
      |   ~~~~~^~~~~~~~~~
clo.cpp:31:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   31 |     scanf("%d%d%d", &c, &f, &v);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~
clo.cpp:34:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   34 |   scanf("%d", &m);
      |   ~~~~~^~~~~~~~~~
clo.cpp:37:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   37 |     scanf("%d%d%d", &c, &f, &v);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1152 KB Output is correct
2 Correct 1 ms 1152 KB Output is correct
3 Correct 12 ms 1152 KB Output is correct
4 Correct 23 ms 1152 KB Output is correct
5 Correct 202 ms 1272 KB Output is correct
6 Correct 213 ms 1272 KB Output is correct
7 Correct 223 ms 1280 KB Output is correct
8 Correct 216 ms 1280 KB Output is correct

Subtask #2
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 1152 KB Output is correct
2 Correct 2 ms 1152 KB Output is correct
3 Correct 13 ms 1152 KB Output is correct
4 Correct 14 ms 1152 KB Output is correct
5 Correct 100 ms 1152 KB Output is correct
6 Correct 97 ms 1152 KB Output is correct
7 Correct 220 ms 1280 KB Output is correct
8 Correct 220 ms 1276 KB Output is correct
9 Correct 221 ms 1280 KB Output is correct

Subtask #3
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 1152 KB Output is correct
2 Correct 4 ms 1152 KB Output is correct
3 Correct 20 ms 1152 KB Output is correct
4 Correct 21 ms 1152 KB Output is correct
5 Correct 39 ms 1152 KB Output is correct
6 Correct 39 ms 1152 KB Output is correct
7 Correct 54 ms 1152 KB Output is correct
8 Correct 55 ms 1240 KB Output is correct

Subtask #4
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 1152 KB Output is correct
2 Correct 3 ms 1152 KB Output is correct
3 Correct 162 ms 1272 KB Output is correct
4 Correct 201 ms 1268 KB Output is correct
5 Correct 468 ms 1332 KB Output is correct
6 Correct 570 ms 1280 KB Output is correct
7 Correct 577 ms 1400 KB Output is correct
8 Correct 562 ms 1280 KB Output is correct

Subtask #5
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 1152 KB Output is correct
2 Correct 18 ms 1152 KB Output is correct
3 Correct 97 ms 1152 KB Output is correct
4 Correct 219 ms 1400 KB Output is correct
5 Correct 521 ms 1280 KB Output is correct
6 Correct 585 ms 1332 KB Output is correct

Subtask #6
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1152 KB Output is correct
2 Correct 1 ms 1152 KB Output is correct
3 Correct 12 ms 1152 KB Output is correct
4 Correct 23 ms 1152 KB Output is correct
5 Correct 202 ms 1272 KB Output is correct
6 Correct 213 ms 1272 KB Output is correct
7 Correct 223 ms 1280 KB Output is correct
8 Correct 216 ms 1280 KB Output is correct
9 Correct 2 ms 1152 KB Output is correct
10 Correct 2 ms 1152 KB Output is correct
11 Correct 13 ms 1152 KB Output is correct
12 Correct 14 ms 1152 KB Output is correct
13 Correct 100 ms 1152 KB Output is correct
14 Correct 97 ms 1152 KB Output is correct
15 Correct 220 ms 1280 KB Output is correct
16 Correct 220 ms 1276 KB Output is correct
17 Correct 221 ms 1280 KB Output is correct
18 Correct 4 ms 1152 KB Output is correct
19 Correct 4 ms 1152 KB Output is correct
20 Correct 20 ms 1152 KB Output is correct
21 Correct 21 ms 1152 KB Output is correct
22 Correct 39 ms 1152 KB Output is correct
23 Correct 39 ms 1152 KB Output is correct
24 Correct 54 ms 1152 KB Output is correct
25 Correct 55 ms 1240 KB Output is correct
26 Correct 3 ms 1152 KB Output is correct
27 Correct 3 ms 1152 KB Output is correct
28 Correct 162 ms 1272 KB Output is correct
29 Correct 201 ms 1268 KB Output is correct
30 Correct 468 ms 1332 KB Output is correct
31 Correct 570 ms 1280 KB Output is correct
32 Correct 577 ms 1400 KB Output is correct
33 Correct 562 ms 1280 KB Output is correct
34 Correct 2 ms 1152 KB Output is correct
35 Correct 18 ms 1152 KB Output is correct
36 Correct 97 ms 1152 KB Output is correct
37 Correct 219 ms 1400 KB Output is correct
38 Correct 521 ms 1280 KB Output is correct
39 Correct 585 ms 1332 KB Output is correct
40 Correct 115 ms 1252 KB Output is correct
41 Correct 223 ms 1408 KB Output is correct
42 Correct 319 ms 1400 KB Output is correct
43 Correct 501 ms 1384 KB Output is correct
44 Correct 493 ms 1400 KB Output is correct
45 Correct 478 ms 1528 KB Output is correct
46 Correct 215 ms 1280 KB Output is correct
47 Correct 318 ms 1400 KB Output is correct
48 Correct 310 ms 1280 KB Output is correct