oj.uz

Submission #658852

# Submission time Handle Problem Language Result Execution time Memory
658852 2022-11-15T05:32:03 Z EthanKim8683 Cloud Computing (CEOI18_clo) C++17
100 / 100
 928 ms 2148 KB 
#include<bits/stdc++.h>
using namespace std;
using I=int;
using Lli=long long int;
using B=bool;
const I N=2000;
const I M=2000;
const I C=50;
const Lli MIN=-1e18;
vector<tuple<Lli,I,Lli>>trns;
Lli dp[2][N*C+1];
void cmb(Lli&a,Lli b){
  a=max(a,b);
}
I main(){
  cin.tie(0)->sync_with_stdio(0);
  fill(&dp[0][0],&dp[0][0]+2*(N*C+1),MIN);
  I n;cin>>n;
  for(I i=0;i<n;i++){
    I c;Lli f,v;cin>>c>>f>>v;
    trns.push_back({f,c,-v});
  }
  I m;cin>>m;
  for(I i=0;i<m;i++){
    I c;Lli f,v;cin>>c>>f>>v;
    trns.push_back({f,-c,v});
  }
  sort(trns.begin(),trns.end());
  reverse(trns.begin(),trns.end());
  Lli res=MIN;
  dp[0][0]=0;
  for(I i=0;i<trns.size();i++){
    auto[f,c,v]=trns[i];
    for(I j=0;j<=n*C;j++){
      if(j+c>=0)cmb(dp[(i+1)%2][j+c],dp[i%2][j]+v);
      cmb(dp[(i+1)%2][j],dp[i%2][j]);
      cmb(res,dp[i%2][j]);
    }
    for(I j=0;j<=n*C;j++)dp[i%2][j]=MIN;
  }
  for(I i=0;i<=n*C;i++)cmb(res,dp[trns.size()%2][i]);
  printf("%lli\n",res);
}

Compilation message

clo.cpp: In function 'I main()':
clo.cpp:32:14: warning: comparison of integer expressions of different signedness: 'I' {aka 'int'} and 'std::vector<std::tuple<long long int, int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   32 |   for(I i=0;i<trns.size();i++){
      |             ~^~~~~~~~~~~~

Subtask #1
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1876 KB Output is correct
2 Correct 1 ms 1876 KB Output is correct
3 Correct 1 ms 1876 KB Output is correct
4 Correct 1 ms 1884 KB Output is correct
5 Correct 5 ms 2004 KB Output is correct
6 Correct 5 ms 1952 KB Output is correct
7 Correct 6 ms 2004 KB Output is correct
8 Correct 6 ms 2004 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1876 KB Output is correct
2 Correct 1 ms 1876 KB Output is correct
3 Correct 3 ms 1876 KB Output is correct
4 Correct 3 ms 1876 KB Output is correct
5 Correct 107 ms 1928 KB Output is correct
6 Correct 107 ms 1924 KB Output is correct
7 Correct 470 ms 2032 KB Output is correct
8 Correct 470 ms 2004 KB Output is correct
9 Correct 444 ms 1980 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1876 KB Output is correct
2 Correct 1 ms 1876 KB Output is correct
3 Correct 3 ms 1876 KB Output is correct
4 Correct 4 ms 1884 KB Output is correct
5 Correct 12 ms 1876 KB Output is correct
6 Correct 13 ms 1892 KB Output is correct
7 Correct 26 ms 1912 KB Output is correct
8 Correct 19 ms 1900 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1876 KB Output is correct
2 Correct 1 ms 1876 KB Output is correct
3 Correct 273 ms 1964 KB Output is correct
4 Correct 4 ms 1876 KB Output is correct
5 Correct 859 ms 2108 KB Output is correct
6 Correct 910 ms 2108 KB Output is correct
7 Correct 892 ms 2108 KB Output is correct
8 Correct 888 ms 2104 KB Output is correct

Subtask #5
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1876 KB Output is correct
2 Correct 2 ms 1876 KB Output is correct
3 Correct 55 ms 1876 KB Output is correct
4 Correct 198 ms 1988 KB Output is correct
5 Correct 888 ms 2120 KB Output is correct
6 Correct 912 ms 2084 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1876 KB Output is correct
2 Correct 1 ms 1876 KB Output is correct
3 Correct 1 ms 1876 KB Output is correct
4 Correct 1 ms 1884 KB Output is correct
5 Correct 5 ms 2004 KB Output is correct
6 Correct 5 ms 1952 KB Output is correct
7 Correct 6 ms 2004 KB Output is correct
8 Correct 6 ms 2004 KB Output is correct
9 Correct 1 ms 1876 KB Output is correct
10 Correct 1 ms 1876 KB Output is correct
11 Correct 3 ms 1876 KB Output is correct
12 Correct 3 ms 1876 KB Output is correct
13 Correct 107 ms 1928 KB Output is correct
14 Correct 107 ms 1924 KB Output is correct
15 Correct 470 ms 2032 KB Output is correct
16 Correct 470 ms 2004 KB Output is correct
17 Correct 444 ms 1980 KB Output is correct
18 Correct 1 ms 1876 KB Output is correct
19 Correct 1 ms 1876 KB Output is correct
20 Correct 3 ms 1876 KB Output is correct
21 Correct 4 ms 1884 KB Output is correct
22 Correct 12 ms 1876 KB Output is correct
23 Correct 13 ms 1892 KB Output is correct
24 Correct 26 ms 1912 KB Output is correct
25 Correct 19 ms 1900 KB Output is correct
26 Correct 1 ms 1876 KB Output is correct
27 Correct 1 ms 1876 KB Output is correct
28 Correct 273 ms 1964 KB Output is correct
29 Correct 4 ms 1876 KB Output is correct
30 Correct 859 ms 2108 KB Output is correct
31 Correct 910 ms 2108 KB Output is correct
32 Correct 892 ms 2108 KB Output is correct
33 Correct 888 ms 2104 KB Output is correct
34 Correct 1 ms 1876 KB Output is correct
35 Correct 2 ms 1876 KB Output is correct
36 Correct 55 ms 1876 KB Output is correct
37 Correct 198 ms 1988 KB Output is correct
38 Correct 888 ms 2120 KB Output is correct
39 Correct 912 ms 2084 KB Output is correct
40 Correct 58 ms 1928 KB Output is correct
41 Correct 175 ms 2004 KB Output is correct
42 Correct 547 ms 2036 KB Output is correct
43 Correct 905 ms 2112 KB Output is correct
44 Correct 905 ms 2132 KB Output is correct
45 Correct 928 ms 2148 KB Output is correct
46 Correct 249 ms 1984 KB Output is correct
47 Correct 554 ms 2100 KB Output is correct
48 Correct 529 ms 2088 KB Output is correct