제출 #129418

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
129418		neki	Cloud Computing (CEOI18_clo)	C++14	100 / 100	1519 ms	5484 KiB

clo

#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);
}

컴파일 시 표준 에러 (stderr) 메시지

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 / 18
• Subtask 2: 18 / 18
• Subtask 3: 18 / 18
• Subtask 4: 18 / 18
• Subtask 5: 18 / 18
• Subtask 6: 10 / 10