oj.uz

Submission #129412

# Submission time Handle Problem Language Result Execution time Memory
129412 2019-07-12T08:10:51 Z neki Cloud Computing (CEOI18_clo) C++14
54 / 100
 1327 ms 4636 KB 
#include <bits/stdc++.h>
#define maxn 2010

#define loop(i, a, b) for(int i=a;i<b;i++)
#define cc(a) cout<< a << endl;
using namespace std;
long long inf=LONG_LONG_MIN/2;

struct event{
    int co, f, val;
};
long long max(long long a, long long b){return (a>b) ? a:b;}
bool cmp(event a, event b){
   if(a.f>b.f) return true;
   if(a.f==b.f) return (a.co<b.co);
   return false;
}

event es[2* maxn];

int main() {
    int n;cin >> n;
    loop(i, 0, n){
        scanf("%d%d%d", &es[i].co, &es[i].f, &es[i].val);
        es[i].val*=-1;
    }
    int m;cin >> m;
    loop(i, n, n+m){
        scanf("%d%d%d", &es[i].co, &es[i].f, &es[i].val);
        es[i].co*=-1;
    }
    sort(es, es+n+m, cmp);
    vector<long long> dp={0};
    long long ans=0;
    loop(i, 0, n+m){
        auto dp2=dp;
        if( 0<(int)dp.size()+es[i].co and dp.size()<(int)dp.size()+es[i].co) dp2.resize(dp.size()+es[i].co, inf);
        loop(j, 0, dp.size()){
            if(j+es[i].co>=0) dp2[j+es[i].co]=max(dp2[j+es[i].co],dp[j]+es[i].val);
        }
        dp=dp2;
    }
    loop(i, 0, dp.size()) ans=max(ans, dp[i]);
    cc(ans);
}

Compilation message

clo.cpp: In function 'int main()':
clo.cpp:37:52: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         if( 0<(int)dp.size()+es[i].co and dp.size()<(int)dp.size()+es[i].co) dp2.resize(dp.size()+es[i].co, inf);
                                           ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
clo.cpp:4:36: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 #define loop(i, a, b) for(int i=a;i<b;i++)
clo.cpp:38:14:
         loop(j, 0, dp.size()){
              ~~~~~~~~~~~~~~~        
clo.cpp:38:9: note: in expansion of macro 'loop'
         loop(j, 0, dp.size()){
         ^~~~
clo.cpp:4:36: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 #define loop(i, a, b) for(int i=a;i<b;i++)
clo.cpp:43:10:
     loop(i, 0, dp.size()) ans=max(ans, dp[i]);
          ~~~~~~~~~~~~~~~            
clo.cpp:43:5: note: in expansion of macro 'loop'
     loop(i, 0, dp.size()) ans=max(ans, dp[i]);
     ^~~~
clo.cpp:24:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d%d", &es[i].co, &es[i].f, &es[i].val);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
clo.cpp:29:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d%d", &es[i].co, &es[i].f, &es[i].val);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 252 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 3 ms 376 KB Output is correct
5 Correct 4 ms 376 KB Output is correct
6 Correct 3 ms 376 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 4 ms 376 KB Output is correct

Subtask #2
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 400 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 87 ms 1492 KB Output is correct
6 Correct 3 ms 376 KB Output is correct
7 Correct 457 ms 2880 KB Output is correct
8 Correct 34 ms 868 KB Output is correct
9 Incorrect 776 ms 4488 KB Output isn't correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 292 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 252 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 368 KB Output is correct
7 Correct 3 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 256 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 404 KB Output is correct
3 Correct 72 ms 1536 KB Output is correct
4 Correct 9 ms 376 KB Output is correct
5 Correct 1065 ms 4608 KB Output is correct
6 Correct 1327 ms 4636 KB Output is correct

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 252 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 3 ms 376 KB Output is correct
5 Correct 4 ms 376 KB Output is correct
6 Correct 3 ms 376 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 4 ms 376 KB Output is correct
9 Correct 2 ms 256 KB Output is correct
10 Correct 2 ms 400 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 87 ms 1492 KB Output is correct
14 Correct 3 ms 376 KB Output is correct
15 Correct 457 ms 2880 KB Output is correct
16 Correct 34 ms 868 KB Output is correct
17 Incorrect 776 ms 4488 KB Output isn't correct