oj.uz

Submission #318943

# Submission time Handle Problem Language Result Execution time Memory
318943 2020-11-03T14:08:38 Z Dymo Cloud Computing (CEOI18_clo) C++14
100 / 100
 544 ms 2276 KB 
#include<bits/stdc++.h>

using namespace std;


#define pb    push_back
#define eb   emplace_back
#define ll  long long
#define pll pair<ll,ll>
#define ff first
#define ss second
#define endl "\n"
const ll maxn=1e5+54;
const ll mod =1e9+7  ;
const ll base=1e18;
ll dp[3][maxn];
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    if (fopen("t.txt", "r"))
    {
        freopen("test.txt", "r", stdin);
      //  freopen("team.out", "w", stdout);
    }
    ll n, m;
     cin>> n ;
     vector<pair<ll,pll>> vt;
     for (int i=1;i<=n;i++)
     {
           ll c,f, v;
            cin>> c>> f>> v;
            v=-v;
            vt.pb(make_pair(f,make_pair(c,v)));
     }
     cin>>m;
     for (int i=1;i<=m;i++)
     {
         ll c, f, v;
          cin>> c>> f>> v;
          c=-c;
          vt.pb(make_pair(f,make_pair(c,v)));
     }
     for (int i=0;i<maxn;i++)
     {
          dp[0][i]=dp[1][i]=-1e15;

     }
     dp[0][0]=0;
     sort(vt.rbegin(),vt.rend());
     ll cnt=0;
     for (auto p:vt)
     {
        cnt++;
        ll now=cnt%2;
        ll pre=1-now;
        ll cst=p.ss.ss;
        ll num=p.ss.ff;
        for (int i=0;i<maxn;i++)
        {
            dp[now][i]=dp[pre][i];
            if (i-num<maxn&&i-num>=0)
            {
               dp[now][i]=max(dp[now][i],dp[pre][i-num]+cst);
            }
        }
     }
     ll ans=0;
      for (int i=0;i<maxn;i++)
        {
            ans=max(ans,dp[cnt%2][i]);
        }
        cout <<ans;

}

Compilation message

clo.cpp: In function 'int main()':
clo.cpp:24:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   24 |         freopen("test.txt", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1900 KB Output is correct
2 Correct 2 ms 1900 KB Output is correct
3 Correct 16 ms 1900 KB Output is correct
4 Correct 27 ms 1900 KB Output is correct
5 Correct 243 ms 2148 KB Output is correct
6 Correct 240 ms 2152 KB Output is correct
7 Correct 263 ms 2052 KB Output is correct
8 Correct 257 ms 2028 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1900 KB Output is correct
2 Correct 3 ms 1900 KB Output is correct
3 Correct 18 ms 1900 KB Output is correct
4 Correct 15 ms 1900 KB Output is correct
5 Correct 117 ms 2144 KB Output is correct
6 Correct 118 ms 2028 KB Output is correct
7 Correct 255 ms 2028 KB Output is correct
8 Correct 253 ms 2156 KB Output is correct
9 Correct 247 ms 2148 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 1900 KB Output is correct
2 Correct 6 ms 1900 KB Output is correct
3 Correct 24 ms 1900 KB Output is correct
4 Correct 24 ms 1900 KB Output is correct
5 Correct 47 ms 1900 KB Output is correct
6 Correct 47 ms 2012 KB Output is correct
7 Correct 64 ms 1900 KB Output is correct
8 Correct 64 ms 2028 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 1900 KB Output is correct
2 Correct 4 ms 1900 KB Output is correct
3 Correct 189 ms 2028 KB Output is correct
4 Correct 228 ms 2148 KB Output is correct
5 Correct 476 ms 2276 KB Output is correct
6 Correct 544 ms 2200 KB Output is correct
7 Correct 502 ms 2156 KB Output is correct
8 Correct 497 ms 2276 KB Output is correct

Subtask #5
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1900 KB Output is correct
2 Correct 21 ms 1900 KB Output is correct
3 Correct 104 ms 2028 KB Output is correct
4 Correct 252 ms 2028 KB Output is correct
5 Correct 514 ms 2156 KB Output is correct
6 Correct 509 ms 2276 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1900 KB Output is correct
2 Correct 2 ms 1900 KB Output is correct
3 Correct 16 ms 1900 KB Output is correct
4 Correct 27 ms 1900 KB Output is correct
5 Correct 243 ms 2148 KB Output is correct
6 Correct 240 ms 2152 KB Output is correct
7 Correct 263 ms 2052 KB Output is correct
8 Correct 257 ms 2028 KB Output is correct
9 Correct 2 ms 1900 KB Output is correct
10 Correct 3 ms 1900 KB Output is correct
11 Correct 18 ms 1900 KB Output is correct
12 Correct 15 ms 1900 KB Output is correct
13 Correct 117 ms 2144 KB Output is correct
14 Correct 118 ms 2028 KB Output is correct
15 Correct 255 ms 2028 KB Output is correct
16 Correct 253 ms 2156 KB Output is correct
17 Correct 247 ms 2148 KB Output is correct
18 Correct 5 ms 1900 KB Output is correct
19 Correct 6 ms 1900 KB Output is correct
20 Correct 24 ms 1900 KB Output is correct
21 Correct 24 ms 1900 KB Output is correct
22 Correct 47 ms 1900 KB Output is correct
23 Correct 47 ms 2012 KB Output is correct
24 Correct 64 ms 1900 KB Output is correct
25 Correct 64 ms 2028 KB Output is correct
26 Correct 4 ms 1900 KB Output is correct
27 Correct 4 ms 1900 KB Output is correct
28 Correct 189 ms 2028 KB Output is correct
29 Correct 228 ms 2148 KB Output is correct
30 Correct 476 ms 2276 KB Output is correct
31 Correct 544 ms 2200 KB Output is correct
32 Correct 502 ms 2156 KB Output is correct
33 Correct 497 ms 2276 KB Output is correct
34 Correct 2 ms 1900 KB Output is correct
35 Correct 21 ms 1900 KB Output is correct
36 Correct 104 ms 2028 KB Output is correct
37 Correct 252 ms 2028 KB Output is correct
38 Correct 514 ms 2156 KB Output is correct
39 Correct 509 ms 2276 KB Output is correct
40 Correct 135 ms 2028 KB Output is correct
41 Correct 244 ms 2028 KB Output is correct
42 Correct 382 ms 2156 KB Output is correct
43 Correct 516 ms 2276 KB Output is correct
44 Correct 503 ms 2276 KB Output is correct
45 Correct 512 ms 2276 KB Output is correct
46 Correct 255 ms 2084 KB Output is correct
47 Correct 380 ms 2156 KB Output is correct
48 Correct 377 ms 2272 KB Output is correct